|
|
| query_term_list () |
| | Constructort.
|
| |
|
auto | begin (void) const |
| | Return the start of the iterator point.
|
| |
|
auto | begin (void) |
| | Return the start of the iterator point.
|
| |
|
auto | end (void) const |
| | return the end of iterator point
|
| |
|
auto | end (void) |
| | return the end of iterator point
|
| |
|
auto | size (void) |
| | return the number of terms
|
| |
|
void | push_back (const slice &term) |
| | Add a query term to the list. This does not increase the term count if the term has been seen before - call sort_unique() to do that.
|
| |
|
void | sort_unique (void) |
| | Sort the query terms then unique the list, incrementing the term count if duplicates are seen. At the end the list has each term represented once and all the term counts represent the numbner of times the term has been seen in the original query.
|
| |
|
|
static void | unittest (void) |
| | Test this class.
|
| |
|
|
static const size_t | max_query_terms = 0xFFFF |
| | We allow up-to this numnber of (not necessarily unique) terms in a query.
|
| |
|
|
std::ostream & | operator<< (std::ostream &stream, const query_term_list &object) |
| |
The documentation for this class was generated from the following file:
