3 * This file is part of LyX, the document processor.
4 * Licence details can be found in the file COPYING.
6 * \author Stefan Schimanski
8 * Full author contact details are available in file CREDITS.
17 #include "support/convert.h"
18 #include "support/debug.h"
19 #include "support/docstring.h"
20 #include "support/weighted_btree.h"
22 #include "support/lassert.h"
31 map<Language, WordList *> theGlobalWordList;
34 WordList * theWordList(Language const & lang)
36 map<Language, WordList *>::iterator it = theGlobalWordList.find(lang);
37 if (it != theGlobalWordList.end())
40 theGlobalWordList[lang] = new WordList;
41 return theGlobalWordList[lang];
45 void WordList::cleanupWordLists()
47 map<Language, WordList *>::const_iterator it = theGlobalWordList.begin();
48 for (; it != theGlobalWordList.end(); ++it)
50 theGlobalWordList.clear();
55 struct WordList::Impl {
59 typedef stx::weighted_btree<docstring, size_t, int> Words;
71 for (size_t i = 1000000; i > 0; --i) {
72 d->words_.insert("a" + convert<docstring>(i), size_t(1), stx::Void());
84 docstring const & WordList::word(size_t idx) const
86 Impl::Words::const_iterator it = d->words_.find_summed_weight(idx);
87 LASSERT(it != d->words_.end(), { static docstring dummy; return dummy; });
89 // We use the key() method here, and not something like it->first
90 // because the btree only returns (iterator-) temporary value pairs.
91 // If we returned the first component of those here, we get an
92 // invalid reference and therefore strange crashes.
97 size_t WordList::size() const
99 return d->words_.summed_weight();
103 void WordList::insert(docstring const & w)
105 Impl::Words::iterator it = d->words_.find(w);
106 if (it == d->words_.end())
107 d->words_.insert(w, size_t(1), 1);
110 d->words_.change_weight(it, 1);
115 void WordList::remove(docstring const & w)
117 Impl::Words::iterator it = d->words_.find(w);
118 if (it != d->words_.end()) {
120 d->words_.change_weight(it, 0);
121 // We will not erase here, but instead we just leave it
122 // in the btree with weight 0. This avoid too much
123 // reorganisation of the tree all the time.
124 //if (it.data() == 0)
125 // d->words_.erase(w);