X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FWordList.cpp;h=191dc33b83ebc365a166ead16bd0dffa47091bde;hb=f1f63fcad0a5512dc277fd8e401ac6cd5736c699;hp=a5a8f4a78f583f82c9ecb618d12c3a2b152b91fa;hpb=477366d8eefa624d9e866a042f0e8ef3b9dbd38f;p=lyx.git diff --git a/src/WordList.cpp b/src/WordList.cpp index a5a8f4a78f..191dc33b83 100644 --- a/src/WordList.cpp +++ b/src/WordList.cpp @@ -12,21 +12,50 @@ #include "WordList.h" +#include "Language.h" + #include "support/convert.h" #include "support/debug.h" #include "support/docstring.h" #include "support/weighted_btree.h" -#include +#include "support/lassert.h" + +#include + +using namespace std; namespace lyx { +/// +map theGlobalWordList; + + +WordList * theWordList(Language const & lang) +{ + map::iterator it = theGlobalWordList.find(lang); + if (it != theGlobalWordList.end()) + return it->second; + else + theGlobalWordList[lang] = new WordList(); + return theGlobalWordList[lang]; +} + + +void WordList::cleanupWordLists() { + map::const_iterator it = theGlobalWordList.begin(); + for (; it != theGlobalWordList.end(); ++it) + delete it->second; + theGlobalWordList.clear(); +} + + /// struct WordList::Impl { /// size_t c_; /// - typedef stx::weighted_btree Words; + typedef stx::weighted_btree Words; /// Words words_; }; @@ -54,21 +83,46 @@ WordList::~WordList() docstring const & WordList::word(size_t idx) const { Impl::Words::const_iterator it = d->words_.find_summed_weight(idx); - BOOST_ASSERT(it != d->words_.end()); - return it->first; + 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_.size(); + return d->words_.summed_weight(); } void WordList::insert(docstring const & w) { - d->words_.insert(w, size_t(1), stx::Void()); + 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