📄 trie_8h.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>C Algorithms: trie.h File Reference</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.4 --><div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="annotated.html">Data Structures</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="functions.html">Data Fields</a> | <a class="qindex" href="globals.html">Globals</a></div><h1>trie.h File Reference</h1>Fast string lookups. <a href="#_details">More...</a><p><table border="0" cellpadding="0" cellspacing="0"><tr><td></td></tr><tr><td colspan="2"><br><h2>Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">Trie * </td><td class="memItemRight" valign="bottom"><a class="el" href="trie_8h.html#a1">trie_new</a> (void)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Create a new trie. <a href="#a1"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="trie_8h.html#a2">trie_free</a> (Trie *trie)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Destroy a trie. <a href="#a2"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="trie_8h.html#a3">trie_insert</a> (Trie *trie, char *key, void *value)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Insert a new key-value pair into a trie. <a href="#a3"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void * </td><td class="memItemRight" valign="bottom"><a class="el" href="trie_8h.html#a4">trie_lookup</a> (Trie *trie, char *key)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Look up a value from its key in a trie. <a href="#a4"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="trie_8h.html#a5">trie_remove</a> (Trie *trie, char *key)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Remove an entry from a trie. <a href="#a5"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="trie_8h.html#a6">trie_num_entries</a> (Trie *trie)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Find the number of entries in a trie. <a href="#a6"></a><br></td></tr></table><hr><a name="_details"></a><h2>Detailed Description</h2>Fast string lookups. <p>A trie is a data structure which provides fast mappings from strings to values.<p>To create a new trie, use <a class="el" href="trie_8h.html#a1">trie_new</a>. To destroy a trie, use <a class="el" href="trie_8h.html#a2">trie_free</a>.<p>To insert a value into a trie, use <a class="el" href="trie_8h.html#a3">trie_insert</a>. To remove a value from a trie, use <a class="el" href="trie_8h.html#a5">trie_remove</a>.<p>To look up a value from its key, use <a class="el" href="trie_8h.html#a4">trie_lookup</a>.<p>To find the number of entries in a trie, use <a class="el" href="trie_8h.html#a6">trie_num_entries</a>.<hr><h2>Function Documentation</h2><a class="anchor" name="a2"></a><!-- doxytag: member="trie.h::trie_free" ref="a2" args="(Trie *trie)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">void trie_free </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">Trie * </td> <td class="mdname1" valign="top" nowrap> <em>trie</em> </td> <td class="md" valign="top"> ) </td> <td class="md" nowrap></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Destroy a trie. <p><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>trie</em> </td><td>The trie to destroy.</td></tr> </table></dl> </td> </tr></table><a class="anchor" name="a3"></a><!-- doxytag: member="trie.h::trie_insert" ref="a3" args="(Trie *trie, char *key, void *value)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">void trie_insert </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">Trie * </td> <td class="mdname" nowrap> <em>trie</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>char * </td> <td class="mdname" nowrap> <em>key</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>void * </td> <td class="mdname" nowrap> <em>value</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Insert a new key-value pair into a trie. <p><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>trie</em> </td><td>The trie. </td></tr> <tr><td valign="top"></td><td valign="top"><em>key</em> </td><td>The key to access the new value. </td></tr> <tr><td valign="top"></td><td valign="top"><em>value</em> </td><td>The value.</td></tr> </table></dl> </td> </tr></table><a class="anchor" name="a4"></a><!-- doxytag: member="trie.h::trie_lookup" ref="a4" args="(Trie *trie, char *key)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">void* trie_lookup </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">Trie * </td> <td class="mdname" nowrap> <em>trie</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>char * </td> <td class="mdname" nowrap> <em>key</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Look up a value from its key in a trie. <p><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>trie</em> </td><td>The trie. </td></tr> <tr><td valign="top"></td><td valign="top"><em>key</em> </td><td>The key. </td></tr> </table></dl><dl compact><dt><b>Returns:</b></dt><dd>The value associated with the key, or NULL if not found in the trie.</dd></dl> </td> </tr></table><a class="anchor" name="a1"></a><!-- doxytag: member="trie.h::trie_new" ref="a1" args="(void)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">Trie* trie_new </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">void </td> <td class="mdname1" valign="top" nowrap> </td> <td class="md" valign="top"> ) </td> <td class="md" nowrap></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Create a new trie. <p><dl compact><dt><b>Returns:</b></dt><dd>Pointer to a new trie structure.</dd></dl> </td> </tr></table><a class="anchor" name="a6"></a><!-- doxytag: member="trie.h::trie_num_entries" ref="a6" args="(Trie *trie)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">int trie_num_entries </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">Trie * </td> <td class="mdname1" valign="top" nowrap> <em>trie</em> </td> <td class="md" valign="top"> ) </td> <td class="md" nowrap></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Find the number of entries in a trie. <p><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>trie</em> </td><td>The trie. </td></tr> </table></dl><dl compact><dt><b>Returns:</b></dt><dd>Count of the number of entries in the trie.</dd></dl> </td> </tr></table><a class="anchor" name="a5"></a><!-- doxytag: member="trie.h::trie_remove" ref="a5" args="(Trie *trie, char *key)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">void trie_remove </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">Trie * </td> <td class="mdname" nowrap> <em>trie</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>char * </td> <td class="mdname" nowrap> <em>key</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Remove an entry from a trie. <p><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>trie</em> </td><td>The trie. </td></tr> <tr><td valign="top"></td><td valign="top"><em>key</em> </td><td>The key of the entry to remove.</td></tr> </table></dl> </td> </tr></table><hr size="1"><address style="align: right;"><small>Generated on Mon Jan 30 18:56:23 2006 for C Algorithms by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.4 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -