Lucene++ - a full-featured, c++ search engine
API Documentation
Go to the documentation of this file.
7 #ifndef SORTEDVINTLIST_H
8 #define SORTEDVINTLIST_H
57 static const int32_t
VB1;
83 friend class SortedDocIdSetIterator;
SortedVIntList(const OpenBitSetPtr &bits)
Create a SortedVIntList from an OpenBitSet.
#define LUCENE_CLASS(Name)
Definition: LuceneObject.h:24
boost::shared_ptr< BitSet > BitSetPtr
Definition: LuceneTypes.h:522
SortedVIntList(const BitSetPtr &bits)
Create a SortedVIntList from a BitSet.
int32_t lastBytePos
Definition: SortedVIntList.h:63
SortedVIntList(const DocIdSetIteratorPtr &docIdSetIterator)
Create a SortedVIntList.
virtual DocIdSetIteratorPtr iterator()
void addInt(int32_t nextInt)
SortedVIntList(Collection< int32_t > sortedInts)
Create a SortedVIntList from all elements of an array of integers.
int32_t lastInt
Definition: SortedVIntList.h:64
static const int32_t BIT_SHIFT
Definition: SortedVIntList.h:58
static const int32_t MAX_BYTES_PER_INT
Definition: SortedVIntList.h:59
A DocIdSet contains a set of doc ids. Implementing classes must only implement iterator to provide ac...
Definition: DocIdSet.h:16
Definition: AbstractAllTermDocs.h:12
boost::shared_ptr< DocIdSetIterator > DocIdSetIteratorPtr
Definition: LuceneTypes.h:324
boost::shared_ptr< OpenBitSet > OpenBitSetPtr
Definition: LuceneTypes.h:543
SortedVIntList(Collection< int32_t > sortedInts, int32_t inputSize)
Create a SortedVIntList from an array of integers.
static const int32_t VB1
Definition: SortedVIntList.h:57
Stores and iterate on sorted integers in compressed form in RAM.
Definition: SortedVIntList.h:22
static const int32_t BITS2VINTLIST_SIZE
When a BitSet has fewer than 1 in BITS2VINTLIST_SIZE bits set, a SortedVIntList representing the inde...
Definition: SortedVIntList.h:49
virtual ~SortedVIntList()
virtual bool isCacheable()
This DocIdSet implementation is cacheable.
ByteArray bytes
Definition: SortedVIntList.h:62
int32_t _size
Definition: SortedVIntList.h:61
clucene.sourceforge.net