libdballe 9.6
|
Index of all stations known to a summary. More...
#include <summary_utils.h>
Public Types | |
typedef core::SmallSet< StationEntry< Station >, Station, station_entries_get_value< Station > > | Parent |
typedef Parent::iterator | iterator |
typedef Parent::const_iterator | const_iterator |
typedef Parent::reverse_iterator | reverse_iterator |
typedef Parent::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
bool | operator== (const StationEntries< Station > &o) const |
bool | operator!= (const StationEntries< Station > &o) const |
void | add (const Station &station, const VarDesc &vd, const dballe::DatetimeRange &dtrange, size_t count) |
Merge the given entry. | |
template<typename OStation > | |
void | add (const StationEntries< OStation > &entry) |
Merge the given entries. | |
void | add (const StationEntries< Station > &entry) |
Merge the given entries. | |
void | add (const StationEntry< Station > &entry) |
Merge the given entry. | |
void | add_filtered (const StationEntries &entry, const dballe::Query &query) |
bool | has (const Station &station) const |
const StationEntries & | sorted () const |
bool | iter_filtered (const dballe::Query &query, std::function< bool(const Station &, const summary::VarDesc &, const DatetimeRange &dtrange, size_t count)> dest) const |
Additional Inherited Members | |
![]() | |
typedef std::vector< StationEntry< Station > >::const_iterator | const_iterator |
typedef std::vector< StationEntry< Station > >::iterator | iterator |
typedef std::vector< StationEntry< Station > >::const_reverse_iterator | const_reverse_iterator |
typedef std::vector< StationEntry< Station > >::reverse_iterator | reverse_iterator |
![]() | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
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 Station &value) const |
const_iterator | find (const Station &value) const |
iterator | find (const Station &value) |
StationEntry< Station > & | add (const StationEntry< Station > &item) |
void | rearrange_dirty () const |
![]() | |
std::vector< StationEntry< Station > > | items |
size_t | dirty |
Index of all stations known to a summary.
It behaves similarly to a std::vector<StationEntry<Station>>