adevs::Bag< T > Class Template Reference

#include <adevs_bag.h>

List of all members.

Classes

class  iterator
 A bidirectional iterator for the Bag. More...

Public Types

typedef iterator const_iterator

Public Member Functions

 Bag (unsigned int cap=8)
 Create an empty bag with an initial capacity.
 Bag (const Bag< T > &src)
 Copy constructor uses the = operator of T.
const Bag< T > & operator= (const Bag< T > &src)
 Assignment operator uses the = operator of T.
unsigned count (const T &a) const
 Count the instances of a stored in the bag.
unsigned size () const
 Get the number of elements in the bag.
bool empty () const
 Same as size()==0.
iterator begin () const
 Get an iterator pointing to the first element in the bag.
iterator end () const
 Get an iterator to the end of the bag (i.e., just after the last element).
void erase (const T &k)
 Erase the first instance of k.
void erase (iterator p)
 Erase the element pointed to by p.
void clear ()
 Remove all of the elements from the bag.
iterator find (const T &k) const
 Find the first instance of k, or end() if no instance is found. Uses == for comparing T.
void insert (const T &t)
 Put t into the bag.

Detailed Description

template<class T>
class adevs::Bag< T >

The Bag is (almost) a model of a STL Multiple Associative Container. This implementation is optimized for the simulation engine, and it does not satisfy the STL complexity requirements. Neither does it implement the full set of required methods, but those methods that are implemented conform to the standard (except for the time complexity requirement).


The documentation for this class was generated from the following file:

Generated on 3 Jul 2013 for adevs by  doxygen 1.6.1