|
libdballe
8.6
|
Set structure optimized for a small number of items. More...
#include <smallset.h>
Public Member Functions | |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| reverse_iterator | rbegin () |
| reverse_iterator | rend () |
| const_reverse_iterator | rbegin () const |
| const_reverse_iterator | rend () const |
| size_t | size () const |
| bool | empty () const |
| bool | operator== (const SmallSet &o) const |
| bool | operator!= (const SmallSet &o) const |
| void | clear () |
| int | binary_search (const Value &value) const |
| const_iterator | find (const Value &value) const |
| iterator | find (const Value &value) |
| Item & | add (const Item &item) |
| void | rearrange_dirty () const |
Public Attributes | |
| std::vector< Item > | items |
| size_t | dirty = 0 |
Set structure optimized for a small number of items.
1.8.16