commit cb4fc83bff266a5334e8165a7e0e2798c8c4a550
author HangZhang <hadeshang@gmail.com> Tue Mar 11 16:57:11 2014 +0800
committer Alex Afanasyev <alexander.afanasyev@ucla.edu> Tue Mar 11 16:31:09 2014 -0700
tree a0a3f9ff6345df22a20baf07307b84320672c1c8
parent 69871f03d349d288f7c5632391057a6a0f4bc4f8

table:  shortcuts between FIB, PIT, Measurements, StrategyChoice

refs #1202

Change-Id: Ie63ab792e840de7e0889d385d3e8ea8a112cb7e5

daemon/table/fib.hpp

diff --git a/daemon/table/fib.hpp b/daemon/table/fib.hpp
index 5e2e03d..0fbacea 100644
--- a/daemon/table/fib.hpp
+++ b/daemon/table/fib.hpp
@@ -69,6 +69,9 @@
   void
   erase(const fib::Entry& entry);
 
+  shared_ptr<fib::Entry>
+  findLongestPrefixMatch(shared_ptr<name_tree::Entry> nameTreeEntry) const;
+
 private:
   NameTree& m_nameTree;
   size_t m_nItems;
@@ -79,7 +82,7 @@
    *  It is returned by findLongestPrefixMatch if nothing is matched.
    */
   // Returning empty entry instead of nullptr makes forwarding and strategy implementation easier.
-  static const shared_ptr<fib::Entry> m_emptyEntry;
+  static const shared_ptr<fib::Entry> s_emptyEntry;
 };
 
 inline size_t