trie.h File Reference

Fast string lookups. More...

Functions
Trie *	trie_new (void)
	Create a new trie.
void	trie_free (Trie *trie)
	Destroy a trie.
void	trie_insert (Trie *trie, char *key, void *value)
	Insert a new key-value pair into a trie.
void *	trie_lookup (Trie *trie, char *key)
	Look up a value from its key in a trie.
void	trie_remove (Trie *trie, char *key)
	Remove an entry from a trie.
int	trie_num_entries (Trie *trie)
	Find the number of entries in a trie.

---

Detailed Description

Fast string lookups.

A trie is a data structure which provides fast mappings from strings to values.

To create a new trie, use trie_new. To destroy a trie, use trie_free.

To insert a value into a trie, use trie_insert. To remove a value from a trie, use trie_remove.

To look up a value from its key, use trie_lookup.

To find the number of entries in a trie, use trie_num_entries.

---

Function Documentation

void trie_free (  Trie *  trie  )

Destroy a trie. Parameters: trie  The trie to destroy.

void trie_insert (  Trie *  trie, char *  key, void *  value )

Insert a new key-value pair into a trie. Parameters: trie  The trie. key  The key to access the new value. value  The value.

void* trie_lookup (  Trie *  trie, char *  key )

Look up a value from its key in a trie. Parameters: trie  The trie. key  The key. Returns: The value associated with the key, or NULL if not found in the trie.

Trie* trie_new (  void   )

Create a new trie. Returns: Pointer to a new trie structure.

int trie_num_entries (  Trie *  trie  )

Find the number of entries in a trie. Parameters: trie  The trie. Returns: Count of the number of entries in the trie.

void trie_remove (  Trie *  trie, char *  key )

Remove an entry from a trie. Parameters: trie  The trie. key  The key of the entry to remove.

---