Ark Server API (ASE) - Wiki
|
#include <ListMap.h>
Public Types | |
using | KeyType = Key |
using | MappedType = Mapped |
using | Reference = Mapped& |
using | ConstReference = const Mapped& |
using | Pointer = Mapped* |
using | ConstPointer = const Mapped* |
using | ValueType = typename Container::value_type |
using | SizeType = typename Container::size_type |
using | Iterator = typename Container::iterator |
using | ConstIterator = typename Container::const_iterator |
Public Member Functions | |
ListMap () | |
Creates an empty ListMap. | |
ListMap (std::size_t initialReserve) | |
ListMap (const ListMap &other) | |
ListMap (ListMap &&other) noexcept | |
ListMap & | operator= (const ListMap &map) |
Assigns another ListMap. | |
ListMap & | operator= (ListMap &&map) noexcept |
Assigns another ListMap. | |
void | swap (ListMap &map) |
Swaps the ListMap with another one. | |
ConstIterator | begin () const |
Returns the beginning of the map. | |
ConstIterator | end () const |
Returns the end of the map. | |
Iterator | begin () |
Returns the beginning of the map. | |
Iterator | end () |
Returns the end of the map. | |
ConstIterator | find (const KeyType &key) const |
Iterator | find (const KeyType &key) |
Iterator | insert (const ValueType &val) |
void | erase (Iterator it) |
SizeType | erase (const KeyType &key) |
void | clear () |
std::size_t | size () const |
bool | empty () const |
ConstReference | operator[] (const KeyType &key) const |
Reference | operator[] (const KeyType &key) |
Private Member Functions | |
template<typename T1 , typename T2 > | |
bool | isEqual (T1 val1, T2 val2) const |
bool | isEqual (const std::string &s1, const std::string &s2) const |
bool | isEqual (const std::string &s1, const char *s2) const |
bool | isEqual (const char *s1, const std::string &s2) const |
bool | isEqual (const char *s1, const char *s2) const |
Private Attributes | |
Container | _container |
This class implements a multimap in terms of a sequential container. The use for this type of associative container is wherever automatic ordering of elements is not desirable. Naturally, this container will have inferior data retrieval performance and it is not recommended for use with large datasets. The main purpose within POCO is for Internet messages (email message, http headers etc), to prevent automatic header entry reordering.
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::ConstIterator = typename Container::const_iterator |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::ConstPointer = const Mapped* |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::ConstReference = const Mapped& |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::Iterator = typename Container::iterator |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::KeyType = Key |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::MappedType = Mapped |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::Pointer = Mapped* |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::Reference = Mapped& |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::SizeType = typename Container::size_type |
using Poco::ListMap< Key, Mapped, Container, CaseSensitive >::ValueType = typename Container::value_type |
|
inline |
|
inlineexplicit |
|
inline |
|
inlinenoexcept |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlineprivate |
|
inlineprivate |
|
inlineprivate |
|
inlineprivate |
|
inlineprivate |
|
inline |
|
inlinenoexcept |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |