64 lines
2.6 KiB
C++
64 lines
2.6 KiB
C++
/*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* 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 2
|
|
* 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, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
* Contributor(s): Daniel Dunbar
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
#ifndef __BLI_EDGEHASH_H__
|
|
#define __BLI_EDGEHASH_H__
|
|
|
|
/** \file BLI_edgehash.h
|
|
* \ingroup bli
|
|
* \author Daniel Dunbar
|
|
* \brief A general unordered 2-int pair hash table ADT.
|
|
*/
|
|
|
|
struct EdgeHash;
|
|
struct EdgeHashIterator;
|
|
typedef struct EdgeHash EdgeHash;
|
|
typedef struct EdgeHashIterator EdgeHashIterator;
|
|
|
|
typedef void (*EdgeHashFreeFP)(void *key);
|
|
|
|
enum {
|
|
EDGEHASH_FLAG_ALLOW_DUPES = (1 << 0), /* only checked for in debug mode */
|
|
};
|
|
|
|
EdgeHash *BLI_edgehash_new(void);
|
|
void BLI_edgehash_free(EdgeHash *eh, EdgeHashFreeFP valfreefp);
|
|
void BLI_edgehash_insert(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val);
|
|
void BLI_edgehash_assign(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val);
|
|
void *BLI_edgehash_lookup(EdgeHash *eh, unsigned int v0, unsigned int v1);
|
|
void **BLI_edgehash_lookup_p(EdgeHash *eh, unsigned int v0, unsigned int v1);
|
|
bool BLI_edgehash_haskey(EdgeHash *eh, unsigned int v0, unsigned int v1);
|
|
int BLI_edgehash_size(EdgeHash *eh);
|
|
void BLI_edgehash_clear(EdgeHash *eh, EdgeHashFreeFP valfreefp);
|
|
void BLI_edgehash_flag_set(EdgeHash *eh, unsigned short flag);
|
|
void BLI_edgehash_flag_clear(EdgeHash *eh, unsigned short flag);
|
|
|
|
EdgeHashIterator *BLI_edgehashIterator_new(EdgeHash *eh);
|
|
void BLI_edgehashIterator_free(EdgeHashIterator *ehi);
|
|
void BLI_edgehashIterator_getKey(EdgeHashIterator *ehi, unsigned int *v0_r, unsigned int *v1_r);
|
|
void *BLI_edgehashIterator_getValue(EdgeHashIterator *ehi);
|
|
void BLI_edgehashIterator_setValue(EdgeHashIterator *ehi, void *val);
|
|
void BLI_edgehashIterator_step(EdgeHashIterator *ehi);
|
|
bool BLI_edgehashIterator_isDone(EdgeHashIterator *ehi);
|
|
|
|
#endif
|