| clear() | Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI > | [inline] |
| DoubleRepr() | Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI > | [inline] |
| Edgelist() | Bodon::Edgelist< VECTOR_OL > | [inline] |
| edgeNumber() const | Bodon::Edgelist< VECTOR_OL > | [inline] |
| erase(typename VECTOR_OL::iterator pos) | Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI > | [inline] |
| find(item_t item) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| findBackward(item_t label, typename VECTOR_OL::iterator &hint) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| findBackwardNoBoundaryCheck(item_t label, typename VECTOR_OL::iterator &hint) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| findForward(item_t label, typename VECTOR_OL::iterator &hint) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| findForwardNoBoundaryCheck(item_t label, typename VECTOR_OL::iterator &hint) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| findOrCreate(item_t label) | Bodon::OrderedEdgelist< VECTOR_OL > | |
| insert(const std::vector< Edge > &new_edges) | Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI > | [inline] |
| largestEdgelabel() const | Bodon::OrderedEdgelist< VECTOR_OL > | [inline] |
| lookup(item_t label, void *&subtrie) | Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI > | [inline] |
| Bodon::OrderedEdgelist< VECTOR_OL >::lookup(item_t label, void *&subtrie) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| lookupNocheck(item_t label, void *&subtrie) const | Bodon::OrderedEdgelist< VECTOR_OL > | |
| lookupNoUppercheck(item_t label, void *&subtrie) const | Bodon::OrderedEdgelist< VECTOR_OL > | [inline] |
| lower_bound(typename VECTOR_OL::iterator &it, item_t label) | Bodon::OrderedEdgelist< VECTOR_OL > | [inline] |
| offsetindexvector | Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI > | [private] |
| OrderedEdgelist() | Bodon::OrderedEdgelist< VECTOR_OL > | [inline] |
| smallestEdgelabel() const | Bodon::OrderedEdgelist< VECTOR_OL > | [inline] |
