#include <TextQueryRep.hpp>
Inheritance diagram for ArrayQueryRep:

Public Methods | |
| ArrayQueryRep (int size) | |
| The size passed in must be large enough to hold all the terms. | |
| ArrayQueryRep (int size,TextQuery &qry,Index &dbIndex) | |
| The size passed in must be large enough to hold all the terms, typically dbIndex.termCountUnique()+1. | |
| ArrayQueryRep (int size,FreqVector &qryVec) | |
| build a query rep with a frequency vector. | |
| virtual | ~ArrayQueryRep () |
| virtual void | startIteration () |
| This, along with hasMore(), nextTerm(), supports iteration over terms. | |
| virtual bool | hasMore () |
| virtual QueryTerm* | nextTerm () |
| Fetch the next term. A new instance is generated; the caller is responsible for deleting it! | |
| virtual void | incCount (int wdIndex,double count) |
| virtual void | setCount (int wdIndex,double count) |
| virtual double | totalCount () |
| virtual double | scoreConstant () |
| Any query-specific constant term in the scoring formula. | |
| virtual void | setScoreConstant (double scoreConst) |
Protected Methods | |
| virtual QueryTerm* | makeQueryTerm (int wdIndex,double wdCount) |
Protected Attributes | |
| double | scConst |
| ArrayCounter<double>* | ct |
|
|
The size passed in must be large enough to hold all the terms.
|
|
|
The size passed in must be large enough to hold all the terms, typically dbIndex.termCountUnique()+1.
|
|
|
build a query rep with a frequency vector.
|
|
|
|
|
|
Reimplemented from TextQueryRep. |
|
|
|
|
|
Reimplemented in OkapiQueryRep. |
|
|
Fetch the next term. A new instance is generated; the caller is responsible for deleting it!
Reimplemented from TextQueryRep. |
|
|
Any query-specific constant term in the scoring formula.
Reimplemented from TextQueryRep. Reimplemented in SimpleKLQueryModel. |
|
|
|
|
|
|
|
|
This, along with hasMore(), nextTerm(), supports iteration over terms.
Reimplemented from TextQueryRep. |
|
|
|
|
|
|
|
|
|
1.2.4 written by Dimitri van Heesch,
© 1997-2000