Class to define the set of mappings. More...
#include <BundleMappings.h>
Public Member Functions | |
iterator | find (const BundleList *list) |
Return an iterator at the mapping to the given list, or end() if the mapping is not present. | |
bool | contains (const BundleList *list) |
Syntactic sugar for finding whether or not a mapping exists for the given list. |
Class to define the set of mappings.
Currently the code just uses a vector to store the mappings to make it compact in memory and because the number of queues for each bundle is likely small.
Definition at line 59 of file BundleMappings.h.
bool dtn::BundleMappings::contains | ( | const BundleList * | list | ) | [inline] |
Syntactic sugar for finding whether or not a mapping exists for the given list.
Definition at line 71 of file BundleMappings.h.
Referenced by dtn::Bundle::is_queued_on().
BundleMappings::iterator dtn::BundleMappings::find | ( | const BundleList * | list | ) |
Return an iterator at the mapping to the given list, or end() if the mapping is not present.
Definition at line 28 of file BundleMappings.cc.
References end.
Referenced by contains(), dtn::BundleList::del_bundle(), and dtn::BundleList::erase().