class NextTableMap

NextTableMap behaves more or less like a map between a BGPRouteTable<A>* and a const PeerHandler*, but it gives deterministic ordering semantics so our test suites aren't dependent on the memory allocator. More...

 
LOGO
 Annotated List  Files  Globals  Hierarchy  Index  Top

Public Types

Public Methods


Detailed Description

NextTableMap behaves more or less like a map between a BGPRouteTable<A>* and a const PeerHandler*, but it gives deterministic ordering semantics so our test suites aren't dependent on the memory allocator. This class basically hides the complexity of maintaining two parallel data structures from the main FanoutTable code

typedef NextTableMapIterator<A> iterator

iterator

 NextTableMap ()

NextTableMap

 ~NextTableMap ()

~NextTableMap

void  insert (BGPRouteTable<A> *next_table, const PeerHandler *ph, uint32_t genid)

insert

void  erase (iterator& iter)

erase

iterator  find (BGPRouteTable<A> *next_table)

find

iterator  begin ()

begin

iterator  end ()

end


Generated by: pavlin on possum.icir.org on Wed Apr 13 21:53:16 2005, using kdoc $.