Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > f6ec3de51c94922f2240c0767594dcf5 > files > 581

antlr3-C-docs-3.2-14.fc15.noarch.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>ANTLR3C: include/antlr3collections.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">ANTLR3C&#160;<span id="projectnumber">3.1.2</span></div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li><a href="dirs.html"><span>Directories</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>Globals</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('antlr3collections_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#nested-classes">Data Structures</a> &#124;
<a href="#define-members">Defines</a> &#124;
<a href="#typedef-members">Typedefs</a>  </div>
  <div class="headertitle">
<h1>antlr3collections.h File Reference</h1>  </div>
</div>
<div class="contents">
<div class="textblock"><code>#include &lt;<a class="el" href="antlr3defs_8h.html">antlr3defs.h</a>&gt;</code><br/>
<code>#include &lt;<a class="el" href="antlr3bitset_8h.html">antlr3bitset.h</a>&gt;</code><br/>
</div><div class="textblock"><div class="dynheader">
Include dependency graph for antlr3collections.h:</div>
<div class="dyncontent">
<div class="center"><img src="antlr3collections_8h__incl.png" border="0" usemap="#include_2antlr3collections_8h" alt=""/></div>
<map name="include_2antlr3collections_8h" id="include_2antlr3collections_8h">
<area shape="rect" id="node3" href="antlr3defs_8h.html" title="Basic type and constant definitions for ANTLR3 Runtime." alt="" coords="439,155,580,181"/><area shape="rect" id="node16" href="antlr3bitset_8h.html" title="Defines the basic structures of an ANTLR3 bitset." alt="" coords="488,80,651,107"/><area shape="rect" id="node5" href="antlr3errors_8h.html" title="antlr3errors.h" alt="" coords="5,229,168,256"/><area shape="rect" id="node11" href="antlr3interfaces_8h.html" title="Declarations for all the antlr3 C runtime interfaces/classes." alt="" coords="493,229,696,256"/><area shape="rect" id="node13" href="antlr3convertutf_8h.html" title="antlr3convertutf.h" alt="" coords="720,229,923,256"/></map>
</div>
</div><div class="textblock"><div class="dynheader">
This graph shows which files directly or indirectly include this file:</div>
<div class="dyncontent">
<div class="center"><img src="antlr3collections_8h__dep__incl.png" border="0" usemap="#include_2antlr3collections_8hdep" alt=""/></div>
<map name="include_2antlr3collections_8hdep" id="include_2antlr3collections_8hdep">
<area shape="rect" id="node3" href="antlr3_8h.html" title="include/antlr3.h" alt="" coords="1275,677,1457,704"/><area shape="rect" id="node5" href="antlr3basetree_8h.html" title="Definition of the ANTLR3 base tree." alt="" coords="809,155,1070,181"/><area shape="rect" id="node7" href="antlr3basetreeadaptor_8h.html" title="Definition of the ANTLR3 base tree adaptor." alt="" coords="1021,304,1351,331"/><area shape="rect" id="node10" href="antlr3commontreeadaptor_8h.html" title="Definition of the ANTLR3 common tree adaptor." alt="" coords="231,379,583,405"/><area shape="rect" id="node13" href="antlr3commontreenodestream_8h.html" title="Definition of the ANTLR3 common tree node stream." alt="" coords="483,453,865,480"/><area shape="rect" id="node29" href="antlr3rewritestreams_8h.html" title="include/antlr3rewritestreams.h" alt="" coords="86,603,409,629"/><area shape="rect" id="node47" href="antlr3tokenstream_8h.html" title="Defines the interface for an ANTLR3 common token stream." alt="" coords="1446,453,1737,480"/><area shape="rect" id="node55" href="antlr3bitset_8h.html" title="Defines the basic structures of an ANTLR3 bitset." alt="" coords="1629,155,1871,181"/><area shape="rect" id="node63" href="antlr3string_8h.html" title="Simple string interface allows indiscriminate allocation of strings such that they can be allocated a..." alt="" coords="1105,80,1347,107"/><area shape="rect" id="node37" href="antlr3commontree_8h.html" title="include/antlr3commontree.h" alt="" coords="479,304,762,331"/><area shape="rect" id="node41" href="antlr3debugeventlistener_8h.html" title="The definition of all debugging events that a recognizer can trigger." alt="" coords="707,229,1070,256"/><area shape="rect" id="node52" href="antlr3parsetree_8h.html" title="Abstraction of Common tree to provide payload and string representation of node." alt="" coords="361,229,633,256"/><area shape="rect" id="node15" href="antlr3baserecognizer_8h.html" title="Defines the basic structure to support recognizing by either a lexer, parser, or tree parser..." alt="" coords="998,528,1321,555"/><area shape="rect" id="node32" href="antlr3treeparser_8h.html" title="include/antlr3treeparser.h" alt="" coords="483,603,766,629"/><area shape="rect" id="node18" href="antlr3cyclicdfa_8h.html" title="include/antlr3cyclicdfa.h" alt="" coords="790,603,1062,629"/><area shape="rect" id="node21" href="antlr3lexer_8h.html" title="Base interface for any ANTLR3 lexer." alt="" coords="1403,603,1635,629"/><area shape="rect" id="node25" href="antlr3parser_8h.html" title="Base implementation of an ANTLR3 parser." alt="" coords="1086,603,1329,629"/><area shape="rect" id="node70" href="antlr3input_8h.html" title="Defines the basic structures used to manipulate character streams from any input source." alt="" coords="1107,379,1339,405"/></map>
</div>
</div><table class="memberdecls">
<tr><td colspan="2"><h2><a name="nested-classes"></a>
Data Structures</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___h_a_s_h___b_u_c_k_e_t__struct.html">ANTLR3_HASH_BUCKET_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Internal structure of a hash table bucket, which tracks all keys that hash to the same bucket.  <a href="struct_a_n_t_l_r3___h_a_s_h___b_u_c_k_e_t__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_t_r_y__struct.html">ANTLR3_HASH_ENTRY_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Internal structure representing an element in a hash bucket.  <a href="struct_a_n_t_l_r3___h_a_s_h___e_n_t_r_y__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_u_m__struct.html">ANTLR3_HASH_ENUM_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Internal structure representing an enumeration of a table.  <a href="struct_a_n_t_l_r3___h_a_s_h___e_n_u_m__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">ANTLR3_HASH_KEY_struct</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___h_a_s_h___t_a_b_l_e__struct.html">ANTLR3_HASH_TABLE_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that tracks a hash table.  <a href="struct_a_n_t_l_r3___h_a_s_h___t_a_b_l_e__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">ANTLR3_INT_TRIE_NODE_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that defines an element/node in an ANTLR3_INT_TRIE.  <a href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e__struct.html">ANTLR3_INT_TRIE_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that defines an ANTLR3_INT_TRIE.  <a href="struct_a_n_t_l_r3___i_n_t___t_r_i_e__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___l_i_s_t__struct.html">ANTLR3_LIST_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that represents a LIST collection.  <a href="struct_a_n_t_l_r3___l_i_s_t__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___s_t_a_c_k__struct.html">ANTLR3_STACK_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that represents a Stack collection.  <a href="struct_a_n_t_l_r3___s_t_a_c_k__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___t_o_p_o__struct.html">ANTLR3_TOPO_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">A topological sort system that given a set of dependencies of a node m on node n, can sort them in dependency order.  <a href="struct_a_n_t_l_r3___t_o_p_o__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">ANTLR3_TRIE_ENTRY_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that holds the payload entry in an ANTLR3_INT_TRIE or ANTLR3_STRING_TRIE.  <a href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">ANTLR3_VECTOR_ELEMENT_struct</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___f_a_c_t_o_r_y__struct.html">ANTLR3_VECTOR_FACTORY_struct</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that tracks vectors in a vector and auto deletes the vectors in the vector factory when closed.  <a href="struct_a_n_t_l_r3___v_e_c_t_o_r___f_a_c_t_o_r_y__struct.html#_details">More...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r__struct.html">ANTLR3_VECTOR_struct</a></td></tr>
<tr><td colspan="2"><h2><a name="define-members"></a>
Defines</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a0feae63d65198c2f3af9c9b5415f37be">ANTLR3_FACTORY_VPOOL_SIZE</a>&#160;&#160;&#160;256</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Default vector pool size if otherwise unspecified.  <a href="#a0feae63d65198c2f3af9c9b5415f37be"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a2dd62def2462cc1572472a4f156081fe">ANTLR3_HASH_TYPE_INT</a>&#160;&#160;&#160;0</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Indicates the hashed file has integer keys.  <a href="#a2dd62def2462cc1572472a4f156081fe"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a71ad9ddc64f0cf36d37698d628b524a8">ANTLR3_HASH_TYPE_STR</a>&#160;&#160;&#160;1</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Indicates the hashed file has numeric keys.  <a href="#a71ad9ddc64f0cf36d37698d628b524a8"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a2dd8f0741b3d0242c8aaa7eccfc8f015">ANTLR3_VECTOR_INTERNAL_SIZE</a>&#160;&#160;&#160;16</td></tr>
<tr><td colspan="2"><h2><a name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___h_a_s_h___b_u_c_k_e_t__struct.html">ANTLR3_HASH_BUCKET_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a07fc69090d49cb1961b9d459e66dc63b">ANTLR3_HASH_BUCKET</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Internal structure of a hash table bucket, which tracks all keys that hash to the same bucket.  <a href="#a07fc69090d49cb1961b9d459e66dc63b"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_t_r_y__struct.html">ANTLR3_HASH_ENTRY_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a447c628e6aeae2f7d74c5d93aaa804b1">ANTLR3_HASH_ENTRY</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Internal structure representing an element in a hash bucket.  <a href="#a447c628e6aeae2f7d74c5d93aaa804b1"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_u_m__struct.html">ANTLR3_HASH_ENUM_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a6adb3ed1c6f1f2ea5f9555528e3bb811">ANTLR3_HASH_ENUM</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Internal structure representing an enumeration of a table.  <a href="#a6adb3ed1c6f1f2ea5f9555528e3bb811"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">ANTLR3_HASH_KEY_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a67e2f00efde84a6ce02d81e614d031f2">ANTLR3_HASH_KEY</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___h_a_s_h___t_a_b_l_e__struct.html">ANTLR3_HASH_TABLE_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a762f8572390efd0a46c882d7b13e1804">ANTLR3_HASH_TABLE</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that tracks a hash table.  <a href="#a762f8572390efd0a46c882d7b13e1804"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e__struct.html">ANTLR3_INT_TRIE_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a4ee3ef3e503f17c456189bb999ea1376">ANTLR3_INT_TRIE</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that defines an ANTLR3_INT_TRIE.  <a href="#a4ee3ef3e503f17c456189bb999ea1376"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">ANTLR3_INT_TRIE_NODE_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#ad7fcc12bf03dadd826937c0a74c0a8e7">ANTLR3_INT_TRIE_NODE</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that defines an element/node in an ANTLR3_INT_TRIE.  <a href="#ad7fcc12bf03dadd826937c0a74c0a8e7"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <a class="el" href="struct_a_n_t_l_r3___l_i_s_t__struct.html">ANTLR3_LIST_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a0e3aca0e726c4b347ad041df61374b3b">ANTLR3_LIST</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that represents a LIST collection.  <a href="#a0e3aca0e726c4b347ad041df61374b3b"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <a class="el" href="struct_a_n_t_l_r3___s_t_a_c_k__struct.html">ANTLR3_STACK_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#ad6ee3073bca40097070880a934e1c3ac">ANTLR3_STACK</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that represents a Stack collection.  <a href="#ad6ee3073bca40097070880a934e1c3ac"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <a class="el" href="struct_a_n_t_l_r3___t_o_p_o__struct.html">ANTLR3_TOPO_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a0e328bf39a77daccddb947f1957c789a">ANTLR3_TOPO</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">A topological sort system that given a set of dependencies of a node m on node n, can sort them in dependency order.  <a href="#a0e328bf39a77daccddb947f1957c789a"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">ANTLR3_TRIE_ENTRY_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a5a4ee8114441110a13a1d8cbf3a4a180">ANTLR3_TRIE_ENTRY</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that holds the payload entry in an ANTLR3_INT_TRIE or ANTLR3_STRING_TRIE.  <a href="#a5a4ee8114441110a13a1d8cbf3a4a180"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r__struct.html">ANTLR3_VECTOR_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#abd75b9dda9da7d4b9dbc3fd8f87367f6">ANTLR3_VECTOR</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">ANTLR3_VECTOR_ELEMENT_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#abfda13563fcaed6ee2b14934bd5c4d20">ANTLR3_VECTOR_ELEMENT</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___f_a_c_t_o_r_y__struct.html">ANTLR3_VECTOR_FACTORY_struct</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a31b2ed2b77ad3d59e4e73636602fced0">ANTLR3_VECTOR_FACTORY</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">Structure that tracks vectors in a vector and auto deletes the vectors in the vector factory when closed.  <a href="#a31b2ed2b77ad3d59e4e73636602fced0"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">ANTLR3_HASH_KEY_struct</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a1ee403fb57021487a3ed534abe05fb2a">pANTLR3_HASH_KEY</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">ANTLR3_INT_TRIE_NODE_struct</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#aef3c074a581067c000b7bfc7d6583ffe">pANTLR3_INT_TRIE_NODE</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">ANTLR3_TRIE_ENTRY_struct</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a6e433c54e4d176e8656a00707a35a384">pANTLR3_TRIE_ENTRY</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <br class="typebreak"/>
<a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">ANTLR3_VECTOR_ELEMENT_struct</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="antlr3collections_8h.html#a5effc0d4051a1f31330e641ed807c161">pANTLR3_VECTOR_ELEMENT</a></td></tr>
</table>
<hr/><h2>Define Documentation</h2>
<a class="anchor" id="a0feae63d65198c2f3af9c9b5415f37be"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_FACTORY_VPOOL_SIZE" ref="a0feae63d65198c2f3af9c9b5415f37be" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define ANTLR3_FACTORY_VPOOL_SIZE&#160;&#160;&#160;256</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Default vector pool size if otherwise unspecified. </p>

<p>Referenced by <a class="el" href="antlr3collections_8c.html#a212aa039ba56656b98bc6e20f2954c1e">closeVectorFactory()</a>, <a class="el" href="antlr3collections_8c.html#af2e0986dc2c7f23b76b653aa3b6e6274">newPool()</a>, and <a class="el" href="antlr3collections_8c.html#aae2b5e482ecb52195b7d0b6693b888c1">newVector()</a>.</p>

</div>
</div>
<a class="anchor" id="a2dd62def2462cc1572472a4f156081fe"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_TYPE_INT" ref="a2dd62def2462cc1572472a4f156081fe" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define ANTLR3_HASH_TYPE_INT&#160;&#160;&#160;0</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Indicates the hashed file has integer keys. </p>

<p>Referenced by <a class="el" href="antlr3collections_8c.html#ab1cfbe163e017a81802608cba170ab6a">antlr3HashPutI()</a>, and <a class="el" href="group__p_a_n_t_l_r3___b_a_s_e___r_e_c_o_g_n_i_z_e_r.html#ga0b61381c64a3cf6fa719be2f3fe6cc79">memoize()</a>.</p>

</div>
</div>
<a class="anchor" id="a71ad9ddc64f0cf36d37698d628b524a8"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_TYPE_STR" ref="a71ad9ddc64f0cf36d37698d628b524a8" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define ANTLR3_HASH_TYPE_STR&#160;&#160;&#160;1</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Indicates the hashed file has numeric keys. </p>

<p>Referenced by <a class="el" href="antlr3collections_8c.html#a51a90be3333359353ae3d5edd2eb5089">antlr3HashFree()</a>, <a class="el" href="antlr3collections_8c.html#a2e1eb0280223979fb6fde18c4c31a218">antlr3HashPut()</a>, <a class="el" href="antlr3collections_8c.html#ae82482b65854afcf24283347aa936bd3">freeIntNode()</a>, <a class="el" href="group__p_a_n_t_l_r3___b_a_s_e___r_e_c_o_g_n_i_z_e_r.html#gabc080ec9aaa275e0361dea5a1eb431c0">getRuleMemoization()</a>, and <a class="el" href="antlr3collections_8c.html#a3ebf80a2d49c150bb4cec09b1f1a8de8">intTrieAdd()</a>.</p>

</div>
</div>
<a class="anchor" id="a2dd8f0741b3d0242c8aaa7eccfc8f015"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_VECTOR_INTERNAL_SIZE" ref="a2dd8f0741b3d0242c8aaa7eccfc8f015" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define ANTLR3_VECTOR_INTERNAL_SIZE&#160;&#160;&#160;16</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Referenced by <a class="el" href="antlr3defs_8h.html#a257bb3a732b0aee54f196ea448944d0b">antlr3SetVectorApi()</a>, <a class="el" href="antlr3defs_8h.html#ad2af1b896785509504749cc82e9ac07a">antlr3VectorFactoryNew()</a>, <a class="el" href="antlr3collections_8c.html#acebfdc6cc1b28c406946fa6e72c1f581">antlr3VectorFree()</a>, <a class="el" href="antlr3collections_8c.html#ac0149859fb053a93f46163e0ee568b7f">antlr3VectorResize()</a>, <a class="el" href="antlr3collections_8c.html#a212aa039ba56656b98bc6e20f2954c1e">closeVectorFactory()</a>, and <a class="el" href="antlr3collections_8c.html#aae2b5e482ecb52195b7d0b6693b888c1">newVector()</a>.</p>

</div>
</div>
<hr/><h2>Typedef Documentation</h2>
<a class="anchor" id="a07fc69090d49cb1961b9d459e66dc63b"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_BUCKET" ref="a07fc69090d49cb1961b9d459e66dc63b" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___b_u_c_k_e_t__struct.html">ANTLR3_HASH_BUCKET_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___b_u_c_k_e_t__struct.html">ANTLR3_HASH_BUCKET</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Internal structure of a hash table bucket, which tracks all keys that hash to the same bucket. </p>

</div>
</div>
<a class="anchor" id="a447c628e6aeae2f7d74c5d93aaa804b1"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_ENTRY" ref="a447c628e6aeae2f7d74c5d93aaa804b1" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_t_r_y__struct.html">ANTLR3_HASH_ENTRY_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_t_r_y__struct.html">ANTLR3_HASH_ENTRY</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Internal structure representing an element in a hash bucket. </p>
<p>Stores the original key so that duplicate keys can be rejected if necessary, and contains function can be supported. If the hash key could be unique I would have invented the perfect compression algorithm ;-) </p>

</div>
</div>
<a class="anchor" id="a6adb3ed1c6f1f2ea5f9555528e3bb811"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_ENUM" ref="a6adb3ed1c6f1f2ea5f9555528e3bb811" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_u_m__struct.html">ANTLR3_HASH_ENUM_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___e_n_u_m__struct.html">ANTLR3_HASH_ENUM</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Internal structure representing an enumeration of a table. </p>
<p>This is returned by antlr3Enumeration() Allows the programmer to traverse the table in hash order without knowing what is in the actual table.</p>
<p>Note that it is up to the caller to ensure that the table structure does not change in the hash bucket that is currently being enumerated as this structure just tracks the next pointers in the bucket series. </p>

</div>
</div>
<a class="anchor" id="a67e2f00efde84a6ce02d81e614d031f2"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_KEY" ref="a67e2f00efde84a6ce02d81e614d031f2" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">ANTLR3_HASH_KEY_struct</a>  <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">ANTLR3_HASH_KEY</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<a class="anchor" id="a762f8572390efd0a46c882d7b13e1804"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_HASH_TABLE" ref="a762f8572390efd0a46c882d7b13e1804" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___t_a_b_l_e__struct.html">ANTLR3_HASH_TABLE_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___t_a_b_l_e__struct.html">ANTLR3_HASH_TABLE</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that tracks a hash table. </p>

</div>
</div>
<a class="anchor" id="a4ee3ef3e503f17c456189bb999ea1376"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_INT_TRIE" ref="a4ee3ef3e503f17c456189bb999ea1376" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e__struct.html">ANTLR3_INT_TRIE_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e__struct.html">ANTLR3_INT_TRIE</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that defines an ANTLR3_INT_TRIE. </p>
<p>For this particular implementation, as you might expect, the key is turned into a "string" by looking at bit(key, depth) of the integer key. Using 64 bit keys gives us a depth limit of 64 (or bit 0..63) and potentially a huge trie. This is the algorithm for a Patricia Trie. Note also that this trie [can] accept multiple entries for the same key and is therefore a kind of elastic bucket patricia trie.</p>
<p>If you find this code useful, please feel free to 'steal' it for any purpose as covered by the BSD license under which ANTLR is issued. You can cut the code but as the ANTLR library is only about 50K (Windows Vista), you might find it easier to just link the library. Please keep all comments and licenses and so on in any version of this you create of course.</p>
<p>Jim Idle. </p>

</div>
</div>
<a class="anchor" id="ad7fcc12bf03dadd826937c0a74c0a8e7"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_INT_TRIE_NODE" ref="ad7fcc12bf03dadd826937c0a74c0a8e7" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">ANTLR3_INT_TRIE_NODE_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">ANTLR3_INT_TRIE_NODE</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that defines an element/node in an ANTLR3_INT_TRIE. </p>

</div>
</div>
<a class="anchor" id="a0e3aca0e726c4b347ad041df61374b3b"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_LIST" ref="a0e3aca0e726c4b347ad041df61374b3b" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___l_i_s_t__struct.html">ANTLR3_LIST_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___l_i_s_t__struct.html">ANTLR3_LIST</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that represents a LIST collection. </p>

</div>
</div>
<a class="anchor" id="ad6ee3073bca40097070880a934e1c3ac"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_STACK" ref="ad6ee3073bca40097070880a934e1c3ac" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___s_t_a_c_k__struct.html">ANTLR3_STACK_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___s_t_a_c_k__struct.html">ANTLR3_STACK</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that represents a Stack collection. </p>

</div>
</div>
<a class="anchor" id="a0e328bf39a77daccddb947f1957c789a"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_TOPO" ref="a0e328bf39a77daccddb947f1957c789a" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___t_o_p_o__struct.html">ANTLR3_TOPO_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___t_o_p_o__struct.html">ANTLR3_TOPO</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>A topological sort system that given a set of dependencies of a node m on node n, can sort them in dependency order. </p>
<p>This is a generally useful utility object that does not care what the things are it is sorting. Generally the set to be sorted will be numeric indexes into some other structure such as an ANTLR3_VECTOR. I have provided a sort method that given ANTLR3_VECTOR as an input will sort the vector entries in place, as well as a sort method that just returns an array of the sorted noded indexes, in case you are not sorting ANTLR3_VECTORS but some set of your own device.</p>
<p>Of the two main algorithms that could be used, I chose to use the depth first search for unvisited nodes as a) This runs in linear time, and b) it is what we used in the ANTLR Tool to perform a topological sort of the input grammar files based on their dependencies. </p>

</div>
</div>
<a class="anchor" id="a5a4ee8114441110a13a1d8cbf3a4a180"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_TRIE_ENTRY" ref="a5a4ee8114441110a13a1d8cbf3a4a180" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">ANTLR3_TRIE_ENTRY_struct</a>
 <a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">ANTLR3_TRIE_ENTRY</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that holds the payload entry in an ANTLR3_INT_TRIE or ANTLR3_STRING_TRIE. </p>

</div>
</div>
<a class="anchor" id="abd75b9dda9da7d4b9dbc3fd8f87367f6"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_VECTOR" ref="abd75b9dda9da7d4b9dbc3fd8f87367f6" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r__struct.html">ANTLR3_VECTOR_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r__struct.html">ANTLR3_VECTOR</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<a class="anchor" id="abfda13563fcaed6ee2b14934bd5c4d20"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_VECTOR_ELEMENT" ref="abfda13563fcaed6ee2b14934bd5c4d20" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">ANTLR3_VECTOR_ELEMENT_struct</a>
     <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">ANTLR3_VECTOR_ELEMENT</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<a class="anchor" id="a31b2ed2b77ad3d59e4e73636602fced0"></a><!-- doxytag: member="antlr3collections.h::ANTLR3_VECTOR_FACTORY" ref="a31b2ed2b77ad3d59e4e73636602fced0" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___f_a_c_t_o_r_y__struct.html">ANTLR3_VECTOR_FACTORY_struct</a>
 <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___f_a_c_t_o_r_y__struct.html">ANTLR3_VECTOR_FACTORY</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>Structure that tracks vectors in a vector and auto deletes the vectors in the vector factory when closed. </p>

</div>
</div>
<a class="anchor" id="a1ee403fb57021487a3ed534abe05fb2a"></a><!-- doxytag: member="antlr3collections.h::pANTLR3_HASH_KEY" ref="a1ee403fb57021487a3ed534abe05fb2a" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">ANTLR3_HASH_KEY_struct</a> * <a class="el" href="struct_a_n_t_l_r3___h_a_s_h___k_e_y__struct.html">pANTLR3_HASH_KEY</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<a class="anchor" id="aef3c074a581067c000b7bfc7d6583ffe"></a><!-- doxytag: member="antlr3collections.h::pANTLR3_INT_TRIE_NODE" ref="aef3c074a581067c000b7bfc7d6583ffe" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">ANTLR3_INT_TRIE_NODE_struct</a> *  <a class="el" href="struct_a_n_t_l_r3___i_n_t___t_r_i_e___n_o_d_e__struct.html">pANTLR3_INT_TRIE_NODE</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<a class="anchor" id="a6e433c54e4d176e8656a00707a35a384"></a><!-- doxytag: member="antlr3collections.h::pANTLR3_TRIE_ENTRY" ref="a6e433c54e4d176e8656a00707a35a384" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">ANTLR3_TRIE_ENTRY_struct</a> *  <a class="el" href="struct_a_n_t_l_r3___t_r_i_e___e_n_t_r_y__struct.html">pANTLR3_TRIE_ENTRY</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<a class="anchor" id="a5effc0d4051a1f31330e641ed807c161"></a><!-- doxytag: member="antlr3collections.h::pANTLR3_VECTOR_ELEMENT" ref="a5effc0d4051a1f31330e641ed807c161" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">ANTLR3_VECTOR_ELEMENT_struct</a> * <a class="el" href="struct_a_n_t_l_r3___v_e_c_t_o_r___e_l_e_m_e_n_t__struct.html">pANTLR3_VECTOR_ELEMENT</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
</div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="antlr3collections_8h.html">antlr3collections.h</a>      </li>
      <li class="footer">Generated on Tue Feb 8 2011 for ANTLR3C by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
    </ul>
  </div>

</body>
</html>