Welcome to mirror list, hosted at ThFree Co, Russian Federation.

BLI_smallhash.h « blenlib « blender « source - git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: a8eb6fd25162459d0da922cd0553a5575fc72a0f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
/*
 * ***** 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.
 *
 * The Original Code is Copyright (C) 2008 Blender Foundation.
 * All rights reserved.
 *
 * The Original Code is: all of this file.
 *
 * Contributor(s): Joseph Eagar.
 *
 * ***** END GPL LICENSE BLOCK *****
 */
 
#ifndef BLI_SMALLHASH_H
#define BLI_SMALLHASH_H

/** \file BLI_smallhash.h
 *  \ingroup bli
 */

/* a light stack-friendly hash library,
 * (it uses stack space for smallish hash tables) */

/* based on a doubling non-chaining approach */

typedef struct {
	uintptr_t key;
	void *val;
} SmallHashEntry;

/*how much stack space to use before dynamically allocating memory*/
#define SMSTACKSIZE	521
typedef struct SmallHash {
	SmallHashEntry *table;
	SmallHashEntry _stacktable[SMSTACKSIZE];
	SmallHashEntry _copytable[SMSTACKSIZE];
	SmallHashEntry *stacktable, *copytable;
	int used;
	int curhash;
	int size;
} SmallHash;

typedef struct {
	SmallHash *hash;
	int i;
} SmallHashIter;

void	BLI_smallhash_init(SmallHash *hash);
void	BLI_smallhash_release(SmallHash *hash);
void	BLI_smallhash_insert(SmallHash *hash, uintptr_t key, void *item);
void	BLI_smallhash_remove(SmallHash *hash, uintptr_t key);
void *	BLI_smallhash_lookup(SmallHash *hash, uintptr_t key);
int		BLI_smallhash_haskey(SmallHash *hash, uintptr_t key);
int		BLI_smallhash_count(SmallHash *hash);
void *	BLI_smallhash_iternext(SmallHashIter *iter, uintptr_t *key);
void *	BLI_smallhash_iternew(SmallHash *hash, SmallHashIter *iter, uintptr_t *key);
/* void BLI_smallhash_print(SmallHash *hash); */ /* UNUSED */

#endif // BLI_SMALLHASH_H