10#include <boost/unordered_set.hpp>
16template <
class TYPE,
class HASH = boost::hash<TYPE>,
class EQUAL = std::equal_to<TYPE> >
20 typedef boost::unordered_set<TYPE, HASH, EQUAL>
set_type;
41 instance.
setContainer = Lucene::newInstance<set_type>(first, last);
77 operator bool()
const {
90 bool add(
const TYPE& type) {
Utility template class to handle hash set collections that can be safely copied and shared.
Definition HashSet.h:17
static this_type newInstance(ITER first, ITER last)
Definition HashSet.h:39
virtual ~HashSet()
Definition HashSet.h:25
const_iterator begin() const
Definition HashSet.h:69
bool add(const TYPE &type)
Definition HashSet.h:90
bool operator!() const
Definition HashSet.h:81
void reset()
Definition HashSet.h:45
iterator begin()
Definition HashSet.h:61
bool empty() const
Definition HashSet.h:53
bool remove(const TYPE &type)
Definition HashSet.h:99
set_type::iterator iterator
Definition HashSet.h:21
bool contains(const TYPE &type) const
Definition HashSet.h:107
boost::shared_ptr< set_type > setContainer
Definition HashSet.h:29
boost::unordered_set< TYPE, HASH, EQUAL > set_type
Definition HashSet.h:20
void addAll(ITER first, ITER last)
Definition HashSet.h:95
static this_type newInstance()
Definition HashSet.h:32
set_type & operator=(const set_type &other)
Definition HashSet.h:85
const_iterator end() const
Definition HashSet.h:73
int32_t size() const
Definition HashSet.h:49
iterator end()
Definition HashSet.h:65
void clear()
Definition HashSet.h:57
set_type::const_iterator const_iterator
Definition HashSet.h:22
TYPE value_type
Definition HashSet.h:23
iterator find(const TYPE &type)
Definition HashSet.h:103
HashSet< TYPE, HASH, EQUAL > this_type
Definition HashSet.h:19
Base class for all Lucene synchronised classes.
Definition LuceneSync.h:15
Definition AbstractAllTermDocs.h:12