Similar to NearSpansOrdered
, but for the unordered case.
More...
#include <NearSpansUnordered.h>
|
| NearSpansUnordered (const SpanNearQueryPtr &query, const IndexReaderPtr &reader) |
|
virtual | ~NearSpansUnordered () |
|
virtual String | getClassName () |
|
boost::shared_ptr< NearSpansUnordered > | shared_from_this () |
|
virtual void | initialize () |
| Called directly after instantiation to create objects that depend on this object being fully constructed.
|
|
Collection< SpansPtr > | getSubSpans () |
|
virtual bool | next () |
| Move to the next match, returning true if any such exists.
|
|
virtual bool | skipTo (int32_t target) |
| Skips to the first match beyond the current, whose document number is greater than or equal to target.
|
|
virtual int32_t | doc () |
| Returns the document number of the current match. Initially invalid.
|
|
virtual int32_t | start () |
| Returns the start position of the current match. Initially invalid.
|
|
virtual int32_t | end () |
| Returns the end position of the current match. Initially invalid.
|
|
virtual Collection< ByteArray > | getPayload () |
| Returns the payload data for the current span. This is invalid until next() is called for the first time. This method must not be called more than once after each call of next() . However, most payloads are loaded lazily, so if the payload data for the current position is not needed, this method may not be called at all for performance reasons. An ordered SpanQuery does not lazy load, so if you have payloads in your index and you do not want ordered SpanNearQuerys to collect payloads, you can disable collection with a constructor option.
|
|
virtual bool | isPayloadAvailable () |
| Checks if a payload can be loaded at this position.
|
|
virtual String | toString () |
| Returns a string representation of the object.
|
|
virtual | ~Spans () |
|
boost::shared_ptr< Spans > | shared_from_this () |
|
virtual | ~LuceneObject () |
|
virtual LuceneObjectPtr | clone (const LuceneObjectPtr &other=LuceneObjectPtr()) |
| Return clone of this object.
|
|
virtual int32_t | hashCode () |
| Return hash code for this object.
|
|
virtual bool | equals (const LuceneObjectPtr &other) |
| Return whether two objects are equal.
|
|
virtual int32_t | compareTo (const LuceneObjectPtr &other) |
| Compare two objects.
|
|
virtual | ~LuceneSync () |
|
virtual SynchronizePtr | getSync () |
| Return this object synchronize lock.
|
|
virtual LuceneSignalPtr | getSignal () |
| Return this object signal.
|
|
virtual void | lock (int32_t timeout=0) |
| Lock this object using an optional timeout.
|
|
virtual void | unlock () |
| Unlock this object.
|
|
virtual bool | holdsLock () |
| Returns true if this object is currently locked by current thread.
|
|
virtual void | wait (int32_t timeout=0) |
| Wait for signal using an optional timeout.
|
|
virtual void | notifyAll () |
| Notify all threads waiting for signal.
|
|
Similar to NearSpansOrdered
, but for the unordered case.
Only public for subclassing. Most implementations should not need this class
◆ NearSpansUnordered()
◆ ~NearSpansUnordered()
virtual Lucene::NearSpansUnordered::~NearSpansUnordered |
( |
| ) |
|
|
virtual |
◆ _getClassName()
static String Lucene::NearSpansUnordered::_getClassName |
( |
| ) |
|
|
inlinestatic |
◆ addToList()
void Lucene::NearSpansUnordered::addToList |
( |
const SpansCellPtr & |
cell | ) |
|
|
protected |
◆ atMatch()
bool Lucene::NearSpansUnordered::atMatch |
( |
| ) |
|
|
protected |
◆ doc()
virtual int32_t Lucene::NearSpansUnordered::doc |
( |
| ) |
|
|
virtual |
Returns the document number of the current match. Initially invalid.
Implements Lucene::Spans.
◆ end()
virtual int32_t Lucene::NearSpansUnordered::end |
( |
| ) |
|
|
virtual |
Returns the end position of the current match. Initially invalid.
Implements Lucene::Spans.
◆ firstToLast()
void Lucene::NearSpansUnordered::firstToLast |
( |
| ) |
|
|
protected |
◆ getClassName()
virtual String Lucene::NearSpansUnordered::getClassName |
( |
| ) |
|
|
inlinevirtual |
◆ getPayload()
virtual Collection< ByteArray > Lucene::NearSpansUnordered::getPayload |
( |
| ) |
|
|
virtual |
Returns the payload data for the current span. This is invalid until next()
is called for the first time. This method must not be called more than once after each call of next()
. However, most payloads are loaded lazily, so if the payload data for the current position is not needed, this method may not be called at all for performance reasons. An ordered SpanQuery does not lazy load, so if you have payloads in your index and you do not want ordered SpanNearQuerys to collect payloads, you can disable collection with a constructor option.
Note that the return type is a collection, thus the ordering should not be relied upon.
- Returns
- a List of byte arrays containing the data of this payload, otherwise null if isPayloadAvailable is false
Implements Lucene::Spans.
◆ getSubSpans()
◆ initialize()
virtual void Lucene::NearSpansUnordered::initialize |
( |
| ) |
|
|
virtual |
Called directly after instantiation to create objects that depend on this object being fully constructed.
Reimplemented from Lucene::LuceneObject.
◆ initList()
void Lucene::NearSpansUnordered::initList |
( |
bool |
next | ) |
|
|
protected |
◆ isPayloadAvailable()
virtual bool Lucene::NearSpansUnordered::isPayloadAvailable |
( |
| ) |
|
|
virtual |
Checks if a payload can be loaded at this position.
Payloads can only be loaded once per call to next()
.
- Returns
- true if there is a payload available at this position that can be loaded
Implements Lucene::Spans.
◆ listToQueue()
void Lucene::NearSpansUnordered::listToQueue |
( |
| ) |
|
|
protected |
◆ min()
◆ next()
virtual bool Lucene::NearSpansUnordered::next |
( |
| ) |
|
|
virtual |
Move to the next match, returning true if any such exists.
Implements Lucene::Spans.
◆ queueToList()
void Lucene::NearSpansUnordered::queueToList |
( |
| ) |
|
|
protected |
◆ shared_from_this()
◆ skipTo()
virtual bool Lucene::NearSpansUnordered::skipTo |
( |
int32_t |
target | ) |
|
|
virtual |
Skips to the first match beyond the current, whose document number is greater than or equal to target.
Returns true if there is such a match.
Behaves as if written:
bool skipTo(int32_t target)
{
do
{
if (!next())
return false;
}
while (target > doc());
return true;
}
Most implementations are considerably more efficient than that.
Implements Lucene::Spans.
◆ start()
virtual int32_t Lucene::NearSpansUnordered::start |
( |
| ) |
|
|
virtual |
Returns the start position of the current match. Initially invalid.
Implements Lucene::Spans.
◆ toString()
virtual String Lucene::NearSpansUnordered::toString |
( |
| ) |
|
|
virtual |
◆ first
◆ firstTime
bool Lucene::NearSpansUnordered::firstTime |
|
protected |
◆ last
◆ max
◆ more
bool Lucene::NearSpansUnordered::more |
|
protected |
◆ ordered
◆ query
◆ queue
◆ reader
◆ slop
int32_t Lucene::NearSpansUnordered::slop |
|
protected |
◆ subSpans
◆ totalLength
int32_t Lucene::NearSpansUnordered::totalLength |
|
protected |
The documentation for this class was generated from the following file: