16template <
class KEY,
class VALUE,
class LESS = std::less<KEY> >
72 operator bool()
const {
85 void put(
const KEY& key,
const VALUE& value) {
86 (*mapContainer)[key] = value;
91 for (
iterator current = first; current != last; ++current) {
92 (*mapContainer)[current->first] = current->second;
101 template <
class ITER>
114 VALUE
get(
const KEY& key)
const {
116 return findValue ==
mapContainer->end() ? VALUE() : findValue->second;
Base class for all Lucene synchronised classes.
Definition LuceneSync.h:15
Utility template class to handle maps that can be safely copied and shared.
Definition Map.h:17
VALUE get(const KEY &key) const
Definition Map.h:114
Map< KEY, VALUE, LESS > this_type
Definition Map.h:19
VALUE & operator[](const KEY &key)
Definition Map.h:123
void putAll(ITER first, ITER last)
Definition Map.h:90
int32_t size() const
Definition Map.h:44
void remove(ITER pos)
Definition Map.h:97
ITER remove(ITER first, ITER last)
Definition Map.h:102
bool contains(const KEY &key) const
Definition Map.h:119
const_iterator begin() const
Definition Map.h:64
std::map< KEY, VALUE, LESS > map_type
Definition Map.h:21
iterator end()
Definition Map.h:60
KEY key_type
Definition Map.h:24
void put(const KEY &key, const VALUE &value)
Definition Map.h:85
bool remove(const KEY &key)
Definition Map.h:106
boost::shared_ptr< map_type > mapContainer
Definition Map.h:31
map_type::const_iterator const_iterator
Definition Map.h:23
void reset()
Definition Map.h:40
virtual ~Map()
Definition Map.h:27
const_iterator end() const
Definition Map.h:68
iterator begin()
Definition Map.h:56
static this_type newInstance()
Definition Map.h:34
VALUE value_type
Definition Map.h:25
bool operator!() const
Definition Map.h:76
void clear()
Definition Map.h:52
map_type & operator=(const map_type &other)
Definition Map.h:80
bool empty() const
Definition Map.h:48
map_type::iterator iterator
Definition Map.h:22
iterator find(const KEY &key)
Definition Map.h:110
std::pair< KEY, VALUE > key_value
Definition Map.h:20
Definition AbstractAllTermDocs.h:12