OnixS C++ CME Market Data Handler  4.8.0.10
API documentation
Public Types | Public Member Functions | List of all members
TinySet< Key > Class Template Reference

#include <TinySet.h>

Public Types

typedef Key Item
 
typedef std::vector< Item > Items
 
typedef Items::const_iterator ConstIterator
 

Public Member Functions

 TinySet ()
 
 TinySet (size_t capacity)
 
 TinySet (const TinySet &other)
 
 ~TinySet ()
 
bool empty () const
 
size_t size () const
 
void reserve (size_t capacity)
 
ConstIterator begin () const
 
ConstIterator end () const
 
ConstIterator find (const Item &item) const
 
bool insert (const Item &item)
 
bool erase (const Item &item)
 
void clear ()
 
void swap (TinySet &other)
 
TinySet & operator= (const TinySet &other)
 

Detailed Description

template<class Key>
class OnixS::CME::MDH::TinySet< Key >

Class implementing set optimized for storing small number of items.

Definition at line 37 of file TinySet.h.

Member Typedef Documentation

typedef Items::const_iterator ConstIterator

Aliases iterator over set items.

Definition at line 52 of file TinySet.h.

typedef Key Item

Aliases set item type.

Definition at line 41 of file TinySet.h.

typedef std::vector<Item> Items

Aliases internal representation.

Definition at line 46 of file TinySet.h.

Constructor & Destructor Documentation

TinySet ( )
inline

Initializes empty set.

Definition at line 55 of file TinySet.h.

TinySet ( size_t  capacity)
inlineexplicit

Initializes empty set and configures internal storage to be enough capacious to store given number of items.

Definition at line 63 of file TinySet.h.

TinySet ( const TinySet< Key > &  other)
inline

Initializes set as copy of other one.

Definition at line 70 of file TinySet.h.

~TinySet ( )
inline

Cleans everything up.

Definition at line 77 of file TinySet.h.

Member Function Documentation

ConstIterator begin ( ) const
inline

Provides iterating facilities.

Definition at line 104 of file TinySet.h.

void clear ( )
inline

Brings set to blank state.

Definition at line 172 of file TinySet.h.

bool empty ( ) const
inline

Indicates whether set is empty.

Definition at line 82 of file TinySet.h.

ConstIterator end ( ) const
inline

Provides iterating facilities.

Definition at line 111 of file TinySet.h.

bool erase ( const Item &  item)
inline

Removes given item from the set. Returned value indicates whether item was actually removed.

Definition at line 150 of file TinySet.h.

ConstIterator find ( const Item &  item) const
inline

Tells whether set contains given item.

Definition at line 118 of file TinySet.h.

bool insert ( const Item &  item)
inline

Inserts items into the set. Returned value indicates whether item was inserted (true) or set already contained given item (false).

Definition at line 133 of file TinySet.h.

TinySet& operator= ( const TinySet< Key > &  other)
inline

Re-initializes instance as copy of other instance.

Definition at line 189 of file TinySet.h.

void reserve ( size_t  capacity)
inline

Makes internal storage capacious enough to store given number of items.

Definition at line 96 of file TinySet.h.

size_t size ( ) const
inline

Number of items in the set.

Definition at line 88 of file TinySet.h.

void swap ( TinySet< Key > &  other)
inline

Swaps content with the other instance.

Definition at line 179 of file TinySet.h.

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