A Thesaurus is-a Resource for thesaurus implementations. More...
#include <zorba/thesaurus.h>
Classes | |
class | iterator |
An iterator is used to iterate over lookup results. More... | |
Public Types | |
typedef std::unique_ptr < Thesaurus, internal::ztd::destroy_delete < Thesaurus > > | ptr |
typedef unsigned | range_type |
The integral type for "at least" and "at most" values. | |
Public Member Functions | |
virtual void | destroy () const =0 |
Destroys this Thesaurus. | |
virtual iterator::ptr | lookup (String const &phrase, String const &relationship, range_type at_least, range_type at_most) const =0 |
Looks-up the given phrase. | |
Protected Member Functions | |
virtual | ~Thesaurus () |
A Thesaurus is-a Resource for thesaurus implementations.
Reimplemented from zorba::Resource.
Definition at line 54 of file thesaurus.h.
typedef unsigned zorba::Thesaurus::range_type |
The integral type for "at least" and "at most" values.
Definition at line 59 of file thesaurus.h.
virtual zorba::Thesaurus::~Thesaurus | ( | ) | [protected, virtual] |
virtual void zorba::Thesaurus::destroy | ( | ) | const [pure virtual] |
Destroys this Thesaurus.
This function is called by Zorba when the Thesaurus is no longer needed.
If your URLResolver dynamically allocates Thesaurus objects, then the implementation can simply be (and usually is) delete this
.
If your URLResolver returns a pointer to a static Thesaurus object, then the implementation should do nothing.
Implements zorba::Resource.
virtual iterator::ptr zorba::Thesaurus::lookup | ( | String const & | phrase, |
String const & | relationship, | ||
range_type | at_least, | ||
range_type | at_most | ||
) | const [pure virtual] |
Looks-up the given phrase.
phrase | The phrase to look up. |
relationship | The relationship the synonyms are to have to the given phrase. |
at_least | The minimum number of levels within the thesaurus to be traversed. |
at_most | The maximum number of levels within the thesaurus to be traversed. |
NULL
if the phrase was not found.