Lines Matching refs:table
74 * is deleted from the table.
87 /** Internal structure of a hash table bucket, which tracks
101 /** Structure that tracks a hash table
105 /** Indicates whether the table allows duplicate keys
109 /** Number of buckets available in this table
118 /** How many elements currently exist in the table.
122 /** Whether the hash table should strdup the keys it is given or not.
126 /** Pointer to function to completely delete this table
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table);
131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, void * key);
132 pANTLR3_HASH_ENTRY (*remove) (struct ANTLR3_HASH_TABLE_struct * table, void * key);
133 void * (*get) (struct ANTLR3_HASH_TABLE_struct * table, void * key);
134 ANTLR3_INT32 (*put) (struct ANTLR3_HASH_TABLE_struct * table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
137 void (*delI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key);
138 pANTLR3_HASH_ENTRY (*removeI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key);
139 void * (*getI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key);
140 ANTLR3_INT32 (*putI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
142 ANTLR3_UINT32 (*size) (struct ANTLR3_HASH_TABLE_struct * table);
147 /** Internal structure representing an enumeration of a table.
149 * Allows the programmer to traverse the table in hash order without
150 * knowing what is in the actual table.
152 * Note that it is up to the caller to ensure that the table
159 /* Pointer to the table we are enumerating
161 pANTLR3_HASH_TABLE table;
174 void (*free) (struct ANTLR3_HASH_ENUM_struct * table);
182 /** Hash table that is storing the list elements
184 pANTLR3_HASH_TABLE table;
