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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/** \file
* \brief Simple hash table C API.
* Does not allow 0 values for items...
*
* See Copyright Notice in "iup.h"
*/
#ifndef __IUP_TABLE_H
#define __IUP_TABLE_H
#ifdef __cplusplus
extern "C"
{
#endif
/** \defgroup table Hash Table
* \par
* The hash table can be indexed by strings or pointer address,
* and each value can contain strings, pointers or function pointers.
* \par
* See \ref iup_table.h
* \ingroup util */
/** How the table key is interpreted.
* \ingroup table */
typedef enum _Itable_IndexTypes
{
IUPTABLE_POINTERINDEXED = 10, /**< a pointer address is used as key. */
IUPTABLE_STRINGINDEXED /**< a string as key */
} Itable_IndexTypes;
/** How the value is interpreted.
* \ingroup table */
typedef enum _Itable_Types
{
IUPTABLE_POINTER, /**< regular pointer for strings and other pointers */
IUPTABLE_STRING, /**< string duplicated internally */
IUPTABLE_FUNCPOINTER /**< function pointer */
} Itable_Types;
typedef void (*Ifunc)(void);
struct _Itable;
typedef struct _Itable Itable;
/** Creates a hash table with an initial default size.
* This function is equivalent to iupTableCreateSized(0);
* \ingroup table */
Itable *iupTableCreate(Itable_IndexTypes indexType);
/** Creates a hash table with the specified initial size.
* Use this function if you expect the table to become very large.
* initialSizeIndex is an array into the (internal) list of
* possible hash table sizes. Currently only indexes from 0 to 8
* are supported. If you specify a higher value here, the maximum
* allowed value will be used.
* \ingroup table */
Itable *iupTableCreateSized(Itable_IndexTypes indexType, unsigned int initialSizeIndex);
/** Destroys the Itable.
* Calls \ref iupTableClear.
* \ingroup table */
void iupTableDestroy(Itable *it);
/** Removes all items in the table.
* This function does also free the memory of strings contained in the table!!!!
* \ingroup table */
void iupTableClear(Itable *it);
/** Returns the number of keys stored in the table.
* \ingroup table */
int iupTableCount(Itable *it);
/** Store an element in the table.
* \ingroup table */
void iupTableSet(Itable *it, const char *key, void *value, Itable_Types itemType);
/** Store a function pointer in the table.
* Type is set to IUPTABLE_FUNCPOINTER.
* \ingroup table */
void iupTableSetFunc(Itable *it, const char *key, Ifunc func);
/** Retrieves an element from the table.
* Returns NULL if not found.
* \ingroup table */
void *iupTableGet(Itable *it, const char *key);
/** Retrieves a function pointer from the table.
* If not a function or not found returns NULL.
* value always contains the element pointer.
* \ingroup table */
Ifunc iupTableGetFunc(Itable *it, const char *key, void **value);
/** Retrieves an element from the table and its type.
* \ingroup table */
void *iupTableGetTyped(Itable *it, const char *key, Itable_Types *itemType);
/** Removes the entry at the specified key from the
* hash table and frees the memory used by it if
* it is a string...
* \ingroup table */
void iupTableRemove(Itable *it, const char *key);
/** Key iteration function. Returns a key.
* To iterate over all keys call iupTableFirst at the first
* and call iupTableNext in a loop
* until 0 is returned...
* Do NOT change the content of the hash table during iteration.
* During an iteration you can use context with
* iupTableGetCurr() to access the value of the key
* very fast.
* \ingroup table */
char *iupTableFirst(Itable *it);
/** Key iteration function. See \ref iupTableNext.
* \ingroup table */
char *iupTableNext(Itable *it);
/** Returns the value at the current position.
* The current context is an iterator
* that is filled by iupTableNext().
* iupTableGetCur() is faster then iupTableGet(),
* so when you want to access an item stored
* at a key returned by iupTableNext(),
* use this function instead of iupTableGet().
* \ingroup table */
void *iupTableGetCurr(Itable *it);
/** Removes the current element and returns the next key.
* Use this function to remove an element during an iteration.
* \ingroup table */
char *iupTableRemoveCurr(Itable *it);
#ifdef __cplusplus
}
#endif
#endif
|
