structures::internal_symbol_list< contents > Class Template Reference
#include <symbol_table.h>
Inheritance diagram for structures::internal_symbol_list< contents >:
Collaboration diagram for structures::internal_symbol_list< contents >:
Public Member Functions | |
| internal_symbol_list (int elems) | |
 Public Member Functions inherited from structures::string_hash< internal_symbol_info< contents > > | |
| string_hash (int estimated_elements) | |
| ~string_hash () | |
| Public Member Functions inherited from structures::hash_table< key_type, contents > | |
| hash_table (const hashing_algorithm &hasher, int estimated_elements) | |
| Creates a table using the "hasher" that is ready to store "estimated_elements". More... | |
| virtual | ~hash_table () |
| destroys any objects left in the hash_table. More... | |
| DEFINE_CLASS_NAME ("hash_table") | |
| void | rehash (int estimated_elements) |
| resizes the hashing structures to optimise for a new size of "estimated_elements". More... | |
| int | elements () const |
| the number of valid items we found by traversing the hash table. More... | |
| int | estimated_elements () const |
| returns the size of table we're optimized for. More... | |
| basis::outcome | add (const key_type &key, contents *to_store) |
| Stores "to_store" into the table given its "key" for hashing. More... | |
| basis::outcome | fast_dangerous_add (const key_type &key, contents *to_store) |
| Like the add method above, but doesn't check for duplicates. More... | |
| bool | find (const key_type &key, contents *&item_found) const |
| locates the item specified by the "key", if possible. More... | |
| contents * | find (const key_type &key) const |
| simplified form of above find() method. More... | |
| contents * | acquire (const key_type &key) |
| retrieves the contents held for "key" out of the table. More... | |
| bool | zap (const key_type &key) |
| removes the entry with the "key" specified. More... | |
| void | reset () |
| removes all entries in the table and returns it to a pristine state. More... | |
| void | apply (apply_function *to_apply, void *data_link) |
| Invokes the function "to_apply" on every entry in the table. More... | |
| basis::outcome | add (key_type *key, contents *to_store, bool check_dupes=true) |
| specialized add for a pre-existing pointer "key". More... | |
| bool | verify () const |
| returns true if the hash table is internally consistent. More... | |
| internal_hash_array< key_type, contents > & | table_access () const |
| special accessor for the copy_hash_table method only. More... | |
| Public Member Functions inherited from basis::nameable | |
| virtual const char * | class_name () const =0 |
| Returns the bare name of this class as a constant character pointer. More... | |
Additional Inherited Members | |
| Public Types inherited from structures::hash_table< key_type, contents > | |
| enum | outcomes { IS_NEW = basis::common::IS_NEW , EXISTING = basis::common::EXISTING } |
| typedef bool | apply_function(const key_type &key, contents ¤t, void *data_link) |
| the "apply_function" is what a user of the "apply" method must supply. More... | |
| Static Public Member Functions inherited from structures::hash_table< key_type, contents > | |
| static int | calculate_num_slots (int estimated_elements) |
| a helper method that lets us know what n is for how many 2^n slots we should have. More... | |
Detailed Description
template<class contents>
class structures::internal_symbol_list< contents >
Definition at line 190 of file symbol_table.h.
Constructor & Destructor Documentation
◆ internal_symbol_list()
template<class contents >
|
inline |
Definition at line 194 of file symbol_table.h.
The documentation for this class was generated from the following file:
- /opt/feistymeow.org/feisty_meow/nucleus/library/structures/symbol_table.h
