<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>DTN Reference Implementation: Table.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.8 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>Table.h</h1><a href="Table_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright 2007 Baylor University</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * Licensed under the Apache License, Version 2.0 (the "License");</span>
<a name="l00005"></a>00005 <span class="comment"> * you may not use this file except in compliance with the License.</span>
<a name="l00006"></a>00006 <span class="comment"> * You may obtain a copy of the License at</span>
<a name="l00007"></a>00007 <span class="comment"> *</span>
<a name="l00008"></a>00008 <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * Unless required by applicable law or agreed to in writing, software</span>
<a name="l00011"></a>00011 <span class="comment"> * distributed under the License is distributed on an "AS IS" BASIS,</span>
<a name="l00012"></a>00012 <span class="comment"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span>
<a name="l00013"></a>00013 <span class="comment"> * See the License for the specific language governing permissions and</span>
<a name="l00014"></a>00014 <span class="comment"> * limitations under the License.</span>
<a name="l00015"></a>00015 <span class="comment"> */</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="preprocessor">#ifndef _PROPHET_TABLE_H_</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define _PROPHET_TABLE_H_</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include "<a class="code" href="Util_8h.html">Util.h</a>"</span>
<a name="l00021"></a>00021 <span class="preprocessor">#include "<a class="code" href="servlib_2prophet_2Node_8h.html">Node.h</a>"</span>
<a name="l00022"></a>00022 <span class="preprocessor">#include "<a class="code" href="prophet_2Bundle_8h.html">Bundle.h</a>"</span>
<a name="l00023"></a>00023 <span class="preprocessor">#include "<a class="code" href="BundleCore_8h.html">BundleCore.h</a>"</span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="preprocessor">#include <map></span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <list></span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">namespace </span>prophet
<a name="l00029"></a>00029 {
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="keyword">class </span>Dictionary;
<a name="l00032"></a>00032
<a name="l00036"></a><a class="code" href="structprophet_1_1heap__compare.html">00036</a> <span class="keyword">struct </span><a class="code" href="structprophet_1_1heap__compare.html" title="Compare object for Heap.">heap_compare</a> {
<a name="l00037"></a><a class="code" href="structprophet_1_1heap__compare.html#046f60d67d4b6fabaccf9a9f801e531a">00037</a> <span class="keywordtype">bool</span> <a class="code" href="structprophet_1_1heap__compare.html#046f60d67d4b6fabaccf9a9f801e531a">operator() </a>(<a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* a, <a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* b) {
<a name="l00038"></a>00038 <span class="keywordflow">if</span> (a == NULL || b == NULL) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00039"></a>00039 <span class="keywordflow">return</span> ((*a).p_value() > (*b).p_value());
<a name="l00040"></a>00040 }
<a name="l00041"></a>00041 };
<a name="l00042"></a>00042
<a name="l00046"></a><a class="code" href="structprophet_1_1heap__pos.html">00046</a> <span class="keyword">struct </span><a class="code" href="structprophet_1_1heap__pos.html" title="Swap object for NodeHeap.">heap_pos</a> {
<a name="l00047"></a><a class="code" href="structprophet_1_1heap__pos.html#26a7f31ecfc8512ecf12221dba22e9a3">00047</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="structprophet_1_1heap__pos.html#26a7f31ecfc8512ecf12221dba22e9a3">operator()</a>(<a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* a, <span class="keywordtype">size_t</span> pos)
<a name="l00048"></a>00048 {
<a name="l00049"></a>00049 a-><a class="code" href="classprophet_1_1Node.html#5b185a9167ef8b6e44ea608fd858dcbc" title="}">set_heap_pos</a>(pos);
<a name="l00050"></a>00050 }
<a name="l00051"></a>00051 };
<a name="l00052"></a>00052
<a name="l00057"></a><a class="code" href="classprophet_1_1Table.html">00057</a> <span class="keyword">class </span><a class="code" href="classprophet_1_1Table.html" title="Container for Prophet nodes (routes and predictability values).">Table</a>
<a name="l00058"></a>00058 {
<a name="l00059"></a>00059 <span class="keyword">public</span>:
<a name="l00060"></a><a class="code" href="classprophet_1_1Table.html#61e183b12e68330a58e18612fb338453">00060</a> <span class="keyword">typedef</span> std::map<std::string,Node*,less_string> <a class="code" href="classprophet_1_1Table.html#61e183b12e68330a58e18612fb338453">rib_table</a>;
<a name="l00061"></a>00061 <span class="keyword">typedef</span> std::map<std::string,Node*,less_string>::const_iterator
<a name="l00062"></a><a class="code" href="classprophet_1_1Table.html#a2f4bc33f615e318215dc60b48447a5d">00062</a> <a class="code" href="classprophet_1_1Table.html#a2f4bc33f615e318215dc60b48447a5d">const_iterator</a>;
<a name="l00063"></a><a class="code" href="classprophet_1_1Table.html#3496fbd02c38d1cfd3ada72eab2b3a36">00063</a> <span class="keyword">typedef</span> std::vector<Node*> <a class="code" href="classprophet_1_1Table.html#3496fbd02c38d1cfd3ada72eab2b3a36">Sequence</a>;
<a name="l00064"></a><a class="code" href="classprophet_1_1Table.html#3ab8a6980a2697bb807263c6163f761e">00064</a> <span class="keyword">typedef</span> Sequence::const_iterator <a class="code" href="classprophet_1_1Table.html#3ab8a6980a2697bb807263c6163f761e">heap_iterator</a>;
<a name="l00065"></a>00065
<a name="l00069"></a>00069 <a class="code" href="classprophet_1_1Table.html#ce73a48d847fc6b7ad291ec82bd6c80b" title="Default constructor.">Table</a>(<a class="code" href="classprophet_1_1BundleCore.html" title="Prophet facade&#39;s abstract interface into DTN host&#39;s bundle core.">BundleCore</a>* core,
<a name="l00070"></a>00070 <span class="keyword">const</span> std::string& name,
<a name="l00071"></a>00071 <span class="keywordtype">bool</span> persistent = <span class="keyword">false</span>);
<a name="l00072"></a>00072
<a name="l00076"></a>00076 <a class="code" href="classprophet_1_1Table.html#ce73a48d847fc6b7ad291ec82bd6c80b" title="Default constructor.">Table</a>(<span class="keyword">const</span> <a class="code" href="classprophet_1_1Table.html" title="Container for Prophet nodes (routes and predictability values).">Table</a>& t);
<a name="l00077"></a>00077
<a name="l00081"></a>00081 <a class="code" href="classprophet_1_1Table.html#d530eae364964bb99f44582d5dc2e06f" title="Destructor.">~Table</a>();
<a name="l00082"></a>00082
<a name="l00086"></a>00086 <span class="keyword">const</span> <a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* <a class="code" href="classprophet_1_1Table.html#b3c3698e75794320979428537a37cdef" title="Find and return route for given destination ID; else return NULL.">find</a>(<span class="keyword">const</span> std::string& dest_id) <span class="keyword">const</span>;
<a name="l00087"></a>00087
<a name="l00092"></a>00092 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#8dbc9e921c25d19231b5efe7772cd048" title="Table takes ownership of memory pointed to by Node*, updating its member list (replacing...">update</a>(<a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* n);
<a name="l00093"></a>00093
<a name="l00100"></a>00100 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#61c5ad124e1840280fd0655356fcb30f" title="Convenience function for updating directly-encountered route in table.">update_route</a>(<span class="keyword">const</span> std::string& dest_id,
<a name="l00101"></a>00101 <span class="keywordtype">bool</span> relay = <a class="code" href="classprophet_1_1Node.html#001f6d13d658e508a4a065d689b74fe3">Node::DEFAULT_RELAY</a>,
<a name="l00102"></a>00102 <span class="keywordtype">bool</span> <a class="code" href="dtncat_8c.html#160881851a33309c0106503ac4d14d96">custody</a> = <a class="code" href="classprophet_1_1Node.html#8c16b001d6a0028ccec12540d4348203">Node::DEFAULT_CUSTODY</a>,
<a name="l00103"></a>00103 <span class="keywordtype">bool</span> internet = <a class="code" href="classprophet_1_1Node.html#9a789b306d56aa744100b7b7cbca2937">Node::DEFAULT_INTERNET</a>);
<a name="l00104"></a>00104
<a name="l00111"></a>00111 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#20cab4c11590a5904a541e59b03fc337" title="Convenience function for updating transitively-discovered route in table.">update_transitive</a>(<span class="keyword">const</span> std::string& dest_id,
<a name="l00112"></a>00112 <span class="keyword">const</span> std::string& peer_id,
<a name="l00113"></a>00113 <span class="keywordtype">double</span> peer_pvalue,
<a name="l00114"></a>00114 <span class="keywordtype">bool</span> relay = <a class="code" href="classprophet_1_1Node.html#001f6d13d658e508a4a065d689b74fe3">Node::DEFAULT_RELAY</a>,
<a name="l00115"></a>00115 <span class="keywordtype">bool</span> <a class="code" href="dtncat_8c.html#160881851a33309c0106503ac4d14d96">custody</a> = <a class="code" href="classprophet_1_1Node.html#8c16b001d6a0028ccec12540d4348203">Node::DEFAULT_CUSTODY</a>,
<a name="l00116"></a>00116 <span class="keywordtype">bool</span> internet = <a class="code" href="classprophet_1_1Node.html#9a789b306d56aa744100b7b7cbca2937">Node::DEFAULT_INTERNET</a>);
<a name="l00117"></a>00117
<a name="l00121"></a>00121 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#20cab4c11590a5904a541e59b03fc337" title="Convenience function for updating transitively-discovered route in table.">update_transitive</a>(<span class="keyword">const</span> std::string& peer_id,
<a name="l00122"></a>00122 <span class="keyword">const</span> <a class="code" href="classprophet_1_1PointerList.html">RIBNodeList</a>& nodes,
<a name="l00123"></a>00123 <span class="keyword">const</span> <a class="code" href="classprophet_1_1Dictionary.html" title="Utility class to facilitate converting to and from routing string (endpoint ID) and...">Dictionary</a>& ribd);
<a name="l00124"></a>00124
<a name="l00128"></a>00128 <span class="keywordtype">double</span> <a class="code" href="classprophet_1_1Table.html#0660932fcdaa4a5ebc21d6f7e54c7ebe" title="Convenience function for looking up predictability of a given route.">p_value</a>(<span class="keyword">const</span> std::string& dest_id) <span class="keyword">const</span>;
<a name="l00129"></a>00129
<a name="l00133"></a>00133 <span class="keywordtype">double</span> <a class="code" href="classprophet_1_1Table.html#0660932fcdaa4a5ebc21d6f7e54c7ebe" title="Convenience function for looking up predictability of a given route.">p_value</a>(<span class="keyword">const</span> <a class="code" href="classprophet_1_1Bundle.html" title="Facade interface between Prophet router and host implmentation&#39;s Bundle representation...">Bundle</a>* b) <span class="keyword">const</span>;
<a name="l00134"></a>00134
<a name="l00138"></a>00138 <span class="keywordtype">size_t</span> <a class="code" href="classprophet_1_1Table.html#97dbc037ee1b0e167d97b995cf8b7659" title="Create duplicate list of Nodes, return number of elements.">clone</a>(<a class="code" href="classprophet_1_1PointerList.html" title="Auto deletes pointers in list destructor This object assumes ownership for member...">NodeList</a>& list) <span class="keyword">const</span>;
<a name="l00139"></a>00139
<a name="l00143"></a><a class="code" href="classprophet_1_1Table.html#6015bdbbb40a5eeebd4ac0ecbed529ab">00143</a> <span class="keywordtype">size_t</span> <a class="code" href="classprophet_1_1Table.html#6015bdbbb40a5eeebd4ac0ecbed529ab" title="Returns number of routes held by Table.">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Table.html#a48e56087c6a1c4f78b17450a39526bf" title="Mapped collection of &lt;dest_id,Node*&gt; pairs.">table_</a>.size(); }
<a name="l00144"></a>00144
<a name="l00148"></a><a class="code" href="classprophet_1_1Table.html#342217d624bc8e7efdeaadd035ce994f">00148</a> <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#342217d624bc8e7efdeaadd035ce994f" title="Set upper limit on number of routes retained by Table.">set_max_route</a>(u_int max_route)
<a name="l00149"></a>00149 {
<a name="l00150"></a>00150 <a class="code" href="classprophet_1_1Table.html#66e1a17c87be6dcdb044879b61ce29c5" title="upper limit to number of routes to retain">max_route_</a> = max_route;
<a name="l00151"></a>00151 <a class="code" href="classprophet_1_1Table.html#a634007d67cd85b12f62166ca4db3cca" title="Enforce upper bound by eliminating minimum routes.">enforce_quota</a>();
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153
<a name="l00163"></a>00163 <span class="keywordtype">size_t</span> <a class="code" href="classprophet_1_1Table.html#4bde73fe9f4a477a42619e805e9a4508" title="The predictability of Nodes should diminish with time; to allow for maintenance of...">truncate</a>(<span class="keywordtype">double</span> epsilon);
<a name="l00164"></a>00164
<a name="l00168"></a>00168 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#d771f3abdf649a941a4c8fbfbe7a0f42" title="Update Table from peer&#39;s RIB.">assign</a>(<span class="keyword">const</span> <a class="code" href="classprophet_1_1PointerList.html">RIBNodeList</a>& list,
<a name="l00169"></a>00169 <span class="keyword">const</span> <a class="code" href="classprophet_1_1Dictionary.html" title="Utility class to facilitate converting to and from routing string (endpoint ID) and...">Dictionary</a>& ribd);
<a name="l00170"></a>00170
<a name="l00175"></a>00175 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#d771f3abdf649a941a4c8fbfbe7a0f42" title="Update Table from peer&#39;s RIB.">assign</a>(<span class="keyword">const</span> std::list<const Node*>& list,
<a name="l00176"></a>00176 <span class="keyword">const</span> <a class="code" href="structprophet_1_1NodeParams.html" title="Tunable parameter struct for setting global default values for Prophet node algorithms...">NodeParams</a>* params);
<a name="l00177"></a>00177
<a name="l00182"></a>00182 <span class="keywordtype">size_t</span> <a class="code" href="classprophet_1_1Table.html#0fb8c279c02261f9b600777b6cadd591" title="For maintenance routines, visit each Node in table and invoke its aging algorithm;...">age_nodes</a>();
<a name="l00183"></a>00183
<a name="l00185"></a><a class="code" href="classprophet_1_1Table.html#07b2a913ef24c75457eca1b197b45849">00185</a> <a class="code" href="classprophet_1_1Table.html#a2f4bc33f615e318215dc60b48447a5d">const_iterator</a> <a class="code" href="classprophet_1_1Table.html#07b2a913ef24c75457eca1b197b45849" title="Iterators.">begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Table.html#a48e56087c6a1c4f78b17450a39526bf" title="Mapped collection of &lt;dest_id,Node*&gt; pairs.">table_</a>.begin(); }
<a name="l00186"></a><a class="code" href="classprophet_1_1Table.html#c10fc722d1ba82e18acd45df0bc23daf">00186</a> <a class="code" href="classprophet_1_1Table.html#a2f4bc33f615e318215dc60b48447a5d">const_iterator</a> <a class="code" href="classprophet_1_1Table.html#c10fc722d1ba82e18acd45df0bc23daf" title="Iterators.">end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Table.html#a48e56087c6a1c4f78b17450a39526bf" title="Mapped collection of &lt;dest_id,Node*&gt; pairs.">table_</a>.end(); }
<a name="l00187"></a><a class="code" href="classprophet_1_1Table.html#c754def92cf36f450faba4fb4c2f7c31">00187</a> <a class="code" href="classprophet_1_1Table.html#3ab8a6980a2697bb807263c6163f761e">heap_iterator</a> <a class="code" href="classprophet_1_1Table.html#c754def92cf36f450faba4fb4c2f7c31" title="Iterators.">heap_begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Table.html#a448d426b276031ddf7cb07c6f4188ce" title="Min-heap for quota-enforcement eviction ordering.">heap_</a>.<a class="code" href="classprophet_1_1Heap.html#29f17eeee1c6569552023e544073031c" title="Constant reference to underlying sequence.">sequence</a>().begin(); }
<a name="l00188"></a><a class="code" href="classprophet_1_1Table.html#ae986acf44fa03a092d76a7348bb106a">00188</a> <a class="code" href="classprophet_1_1Table.html#3ab8a6980a2697bb807263c6163f761e">heap_iterator</a> <a class="code" href="classprophet_1_1Table.html#ae986acf44fa03a092d76a7348bb106a" title="Iterators.">heap_end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Table.html#a448d426b276031ddf7cb07c6f4188ce" title="Min-heap for quota-enforcement eviction ordering.">heap_</a>.<a class="code" href="classprophet_1_1Heap.html#29f17eeee1c6569552023e544073031c" title="Constant reference to underlying sequence.">sequence</a>().end(); }
<a name="l00190"></a>00190
<a name="l00191"></a>00191 <span class="keyword">protected</span>:
<a name="l00192"></a><a class="code" href="classprophet_1_1Table.html#6702f69454bf0cbaa3cfa9007214a43d">00192</a> <span class="keyword">typedef</span> rib_table::iterator <a class="code" href="classprophet_1_1Table.html#6702f69454bf0cbaa3cfa9007214a43d">iterator</a>;
<a name="l00193"></a>00193 <span class="keyword">typedef</span> <a class="code" href="classprophet_1_1Heap.html">Heap</a><<a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>*,
<a name="l00194"></a>00194 std::vector<Node*>,
<a name="l00195"></a>00195 <span class="keyword">struct </span><a class="code" href="structprophet_1_1heap__compare.html" title="Compare object for Heap.">heap_compare</a>,
<a name="l00196"></a><a class="code" href="classprophet_1_1Table.html#e40871bf139541587463c8da9cfd8d47">00196</a> struct <a class="code" href="structprophet_1_1heap__pos.html" title="Swap object for NodeHeap.">heap_pos</a>> <a class="code" href="classprophet_1_1Heap.html">NodeHeap</a>;
<a name="l00197"></a>00197
<a name="l00201"></a>00201 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#202673f8ec231f35b1e750b8b6430911" title="Add route to heap.">heap_add</a>(<a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* n);
<a name="l00202"></a>00202
<a name="l00206"></a>00206 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#e4eedc231c636737a7d1289df4863d6d" title="Remove node from heap.">heap_del</a>(<a class="code" href="classprophet_1_1Node.html" title="Node represents a route to another Prophet node, and as such, tracks destination...">Node</a>* n);
<a name="l00207"></a>00207
<a name="l00211"></a>00211 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#a634007d67cd85b12f62166ca4db3cca" title="Enforce upper bound by eliminating minimum routes.">enforce_quota</a>();
<a name="l00212"></a>00212
<a name="l00217"></a>00217 <span class="keywordtype">void</span> <span class="keyword">remove</span>(<a class="code" href="classprophet_1_1Table.html#6702f69454bf0cbaa3cfa9007214a43d">iterator</a>* i);
<a name="l00218"></a>00218
<a name="l00222"></a>00222 <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Table.html#5acac2d4bc869643d71266c2ba388015" title="Clean up memory pointed to by each Node*.">free</a>();
<a name="l00223"></a>00223
<a name="l00227"></a>00227 <span class="keywordtype">bool</span> <a class="code" href="classprophet_1_1Table.html#b3c3698e75794320979428537a37cdef" title="Find and return route for given destination ID; else return NULL.">find</a>(<span class="keyword">const</span> std::string& dest_id, <a class="code" href="classprophet_1_1Table.html#6702f69454bf0cbaa3cfa9007214a43d">iterator</a>* i);
<a name="l00228"></a>00228
<a name="l00229"></a><a class="code" href="classprophet_1_1Table.html#3617981b587cbbd0e3e64afea1e997e0">00229</a> <a class="code" href="classprophet_1_1BundleCore.html" title="Prophet facade&#39;s abstract interface into DTN host&#39;s bundle core.">BundleCore</a>* <span class="keyword">const</span> <a class="code" href="classprophet_1_1Table.html#3617981b587cbbd0e3e64afea1e997e0" title="facade interface into Bundle host">core_</a>;
<a name="l00230"></a><a class="code" href="classprophet_1_1Table.html#a48e56087c6a1c4f78b17450a39526bf">00230</a> <a class="code" href="classprophet_1_1Table.html#61e183b12e68330a58e18612fb338453">rib_table</a> <a class="code" href="classprophet_1_1Table.html#a48e56087c6a1c4f78b17450a39526bf" title="Mapped collection of &lt;dest_id,Node*&gt; pairs.">table_</a>;
<a name="l00231"></a><a class="code" href="classprophet_1_1Table.html#a448d426b276031ddf7cb07c6f4188ce">00231</a> <a class="code" href="classprophet_1_1Heap.html">NodeHeap</a> <a class="code" href="classprophet_1_1Table.html#a448d426b276031ddf7cb07c6f4188ce" title="Min-heap for quota-enforcement eviction ordering.">heap_</a>;
<a name="l00232"></a><a class="code" href="classprophet_1_1Table.html#f8213d41f401d35a14ee320cb92bb6ec">00232</a> <span class="keywordtype">bool</span> <a class="code" href="classprophet_1_1Table.html#f8213d41f401d35a14ee320cb92bb6ec" title="whether to utilize BundleCore&#39;s persistent storage interface for Nodes">persistent_</a>;
<a name="l00233"></a>00233
<a name="l00234"></a><a class="code" href="classprophet_1_1Table.html#39803a4bfdceda69b153a60415b7a8de">00234</a> std::string <a class="code" href="classprophet_1_1Table.html#39803a4bfdceda69b153a60415b7a8de" title="object name">name_</a>;
<a name="l00235"></a><a class="code" href="classprophet_1_1Table.html#66e1a17c87be6dcdb044879b61ce29c5">00235</a> u_int <a class="code" href="classprophet_1_1Table.html#66e1a17c87be6dcdb044879b61ce29c5" title="upper limit to number of routes to retain">max_route_</a>;
<a name="l00236"></a>00236 }; <span class="comment">//class Table</span>
<a name="l00237"></a>00237
<a name="l00238"></a>00238 }; <span class="comment">//namespace prophet</span>
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="preprocessor">#endif // _PROPHET_TABLE_H_</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Fri Jan 30 09:26:58 2009 for DTN Reference Implementation by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.8 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
29c369053a983cc5d8c880dc6e0a2237
>
files
>
710
