lyx_mirror/src/WordList.cpp

119 lines
2.3 KiB
C++
Raw Normal View History

/**
* \file WordList.cpp
* This file is part of LyX, the document processor.
* Licence details can be found in the file COPYING.
*
* \author Stefan Schimanski
*
* Full author contact details are available in file CREDITS.
*/
#include <config.h>
#include "WordList.h"
#include "Language.h"
#include "support/convert.h"
#include "support/debug.h"
#include "support/docstring.h"
#include "support/weighted_btree.h"
#include "support/lassert.h"
#include <map>
using namespace std;
namespace lyx {
///
map<Language, WordList *> theGlobalWordList;
WordList * theWordList(Language const & lang)
{
map<Language, WordList *>::iterator it = theGlobalWordList.find(lang);
if (it != theGlobalWordList.end())
return it->second;
else
theGlobalWordList[lang] = new WordList();
return theGlobalWordList[lang];
}
///
struct WordList::Impl {
///
size_t c_;
///
typedef stx::weighted_btree<docstring, size_t, int> Words;
///
Words words_;
};
WordList::WordList()
{
d = new Impl;
d->c_ = 0;
#if 0
for (size_t i = 1000000; i > 0; --i) {
d->words_.insert("a" + convert<docstring>(i), size_t(1), stx::Void());
}
#endif
}
WordList::~WordList()
{
delete d;
}
docstring const & WordList::word(size_t idx) const
{
Impl::Words::const_iterator it = d->words_.find_summed_weight(idx);
LASSERT(it != d->words_.end(), /**/);
// We use the key() method here, and not something like it->first
// because the btree only returns (iterator-) temporary value pairs.
// If we returned the first component of those here, we get an
// invalid reference and therefore strange crashes.
return it.key();
}
size_t WordList::size() const
{
return d->words_.summed_weight();
}
void WordList::insert(docstring const & w)
{
Impl::Words::iterator it = d->words_.find(w);
if (it == d->words_.end())
d->words_.insert(w, size_t(1), 1);
else {
it.data()++;
d->words_.change_weight(it, 1);
}
}
void WordList::remove(docstring const & w)
{
Impl::Words::iterator it = d->words_.find(w);
if (it != d->words_.end()) {
it.data()--;
d->words_.change_weight(it, 0);
// We will not erase here, but instead we just leave it
// in the btree with weight 0. This avoid too much
// reorganisation of the tree all the time.
//if (it.data() == 0)
// d->words_.erase(w);
}
}
} // namespace lyx