|
|
int | get_num_nodes () const |
| | Returns the total number of nodes stored.
|
| |
|
Node * | peek_vertex_node (int p1, int p2) const |
| | Returns a vertex node with parent id's p1 and p2 if it exists, NULL otherwise.
|
| |
|
Node * | peek_edge_node (int p1, int p2) const |
| | Returns an edge node with parent id's p1 and p2 if it exists, NULL otherwise.
|
| |
| Node * | get_vertex_node (int p1, int p2) |
| |
| Node * | get_edge_node (int p1, int p2) |
| |
| void | init (int size=H2D_DEFAULT_HASH_SIZE) |
| |
|
void | copy (const HashTable *ht) |
| | Copies another hash table contents.
|
| |
|
void | rebuild () |
| | Reconstructs the hashtable, after, e.g., the nodes have been loaded from a file.
|
| |
|
void | free () |
| | Frees all memory used by the instance.
|
| |
|
void | remove_vertex_node (int id) |
| | Removes a vertex node with parent id's p1 and p2.
|
| |
|
void | remove_edge_node (int id) |
| | Removes an edge node with parent id's p1 and p2.
|
| |
Stores and searches node tables.
HashTable is a base class for Mesh. It serves as a container for all nodes of a mesh. Moreover, it has node searching functions based on hash tables.
Definition at line 41 of file hash.h.