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...

Annotated List  Files  Globals  Hierarchy  Index  Top

Public Types

• typedef NextTableMapIterator<A> iterator

Public Methods

•  NextTableMap ()
•  ~NextTableMap ()
• void  insert (BGPRouteTable<A> *next_table, const PeerHandler *ph, uint32_t genid)
• void  erase (iterator& iter)
• iterator  find (BGPRouteTable<A> *next_table)
• iterator  begin ()
• iterator  end ()

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