X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=src%2FWordList.cpp;h=96b7c35ea798c91a7a2726a0d28c1f61a82b694e;hb=90f7007a2e6c78ffd031e4636ff909ab1bc2ddec;hp=1423f83c9d145a64eab67177ab80b9728aee5284;hpb=9a5aba0877d2baa5aeb9c419a2e0c880b24cb4ef;p=lyx.git

diff --git a/src/WordList.cpp b/src/WordList.cpp
index 1423f83c9d..96b7c35ea7 100644
--- a/src/WordList.cpp
+++ b/src/WordList.cpp
@@ -10,28 +10,53 @@
 
 #include <config.h>
 
-#include <boost/assert.hpp>
+#include "WordList.h"
 
-#include <support/convert.h>
-#include <support/debug.h>
-#include <support/docstring.h>
-#include <support/weighted_btree.h>
+#include "Language.h"
 
-#include <WordList.h>
+#include "support/convert.h"
+#include "support/debug.h"
+#include "support/docstring.h"
+#include "support/weighted_btree.h"
+
+#include "support/lassert.h"
 
-#include <algorithm>
 #include <map>
-#include <iostream>
-#include <set>
+
+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];
+}
+
+
+void WordList::cleanupWordLists()
+{
+	map<Language, WordList *>::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<docstring, size_t> Words;
+	typedef stx::weighted_btree<docstring, size_t, int> Words;
 	///
 	Words words_;
 };
@@ -58,23 +83,47 @@ 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;
+	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_.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);
+	}
 }
 
-	
-} // namespace lyx
\ No newline at end of file
+
+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