#ifdef HAVE_LIBAIKSAURUS
#include <algorithm>
-
+
using std::sort;
Thesaurus::Thesaurus()
return meanings;
// weird api, but ...
-
+
int prev_meaning = -1;
int cur_meaning;
string meaning;
- // correct, returns "" at the end
+ // correct, returns "" at the end
string ret = aik_->next(cur_meaning);
-
+
while (!ret.empty()) {
if (cur_meaning != prev_meaning) {
meaning = ret;
} else {
if (ret != text) {
meanings[meaning].push_back(ret);
- }
+ }
}
-
+
ret = aik_->next(cur_meaning);
}
it != meanings.end(); ++it) {
sort(it->second.begin(), it->second.end());
}
-
+
return meanings;
}
Thesaurus::Thesaurus()
{
}
-
-
+
+
Thesaurus::~Thesaurus()
{
}
-
+
Thesaurus::Meanings Thesaurus::lookup(string const &)
{
return Meanings();
#endif // HAVE_LIBAIKSAURUS
// Global instance
-Thesaurus thesaurus;
+Thesaurus thesaurus;