You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
48 lines
1.1 KiB
48 lines
1.1 KiB
/**
|
|
* \file
|
|
*
|
|
* \author Georg Hopp
|
|
*
|
|
* \copyright
|
|
* Copyright © 2014 Georg Hopp
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <search.h>
|
|
|
|
#include "tr/hash.h"
|
|
#include "tr/tree.h"
|
|
|
|
static void (*cb)(const void*, const void*);
|
|
|
|
static
|
|
void
|
|
walk(const void * node, const void * data, const int depth)
|
|
{
|
|
cb(node, data);
|
|
}
|
|
|
|
void
|
|
TR_hashEach(
|
|
TR_Hash this,
|
|
const void * data,
|
|
void (*callback)(const void *, const void *))
|
|
{
|
|
cb = callback;
|
|
|
|
TR_treeWalk(this->root, data, walk);
|
|
}
|
|
|
|
// vim: set ts=4 sw=4:
|