src/WordList.cpp

   1 /**
   2  * \file WordList.cpp
   3  * This file is part of LyX, the document processor.
   4  * Licence details can be found in the file COPYING.
   5  *
   6  * \author Stefan Schimanski
   7  *
   8  * Full author contact details are available in file CREDITS.
   9  */
  10
  11 #include <config.h>
  12
  13 #include "WordList.h"
  14
  15 #include "Language.h"
  16
  17 #include "support/convert.h"
  18 #include "support/debug.h"
  19 #include "support/docstring.h"
  20 #include "support/weighted_btree.h"
  21
  22 #include "support/lassert.h"
  23
  24 #include <map>
  25
  26 using namespace std;
  27
  28 namespace lyx {
  29
  30 ///
  31 map<Language, WordList *> theGlobalWordList;
  32
  33
  34 WordList * theWordList(Language const & lang)
  35 {
  36         map<Language, WordList *>::iterator it = theGlobalWordList.find(lang);
  37         if (it != theGlobalWordList.end())
  38                 return it->second;
  39         else
  40                 theGlobalWordList[lang] = new WordList();
  41         return theGlobalWordList[lang];
  42 }
  43
  44
  45 void WordList::cleanupWordLists() {
  46         map<Language, WordList *>::const_iterator it = theGlobalWordList.begin();
  47         for (; it != theGlobalWordList.end(); ++it)
  48                 delete it->second;
  49         theGlobalWordList.clear();
  50 }
  51
  52
  53 ///
  54 struct WordList::Impl {
  55         ///
  56         size_t c_;
  57         ///
  58         typedef stx::weighted_btree<docstring, size_t, int> Words;
  59         ///
  60         Words words_;
  61 };
  62
  63
  64 WordList::WordList()
  65 {
  66         d = new Impl;
  67         d->c_ = 0;
  68
  69 #if 0
  70         for (size_t i = 1000000; i > 0; --i) {
  71                 d->words_.insert("a" + convert<docstring>(i), size_t(1), stx::Void());
  72         }
  73 #endif
  74 }
  75
  76
  77 WordList::~WordList()
  78 {
  79         delete d;
  80 }
  81
  82
  83 docstring const & WordList::word(size_t idx) const
  84 {
  85         Impl::Words::const_iterator it = d->words_.find_summed_weight(idx);
  86         LASSERT(it != d->words_.end(), /**/);
  87
  88         // We use the key() method here, and not something like it->first
  89         // because the btree only returns (iterator-) temporary value pairs.
  90         // If we returned the first component of those here, we get an
  91         // invalid reference and therefore strange crashes.
  92         return it.key();
  93 }
  94
  95
  96 size_t WordList::size() const
  97 {
  98         return d->words_.summed_weight();
  99 }
 100
 101
 102 void WordList::insert(docstring const & w)
 103 {
 104         Impl::Words::iterator it = d->words_.find(w);
 105         if (it == d->words_.end())
 106                 d->words_.insert(w, size_t(1), 1);
 107         else {
 108                 it.data()++;
 109                 d->words_.change_weight(it, 1);
 110         }
 111 }
 112
 113
 114 void WordList::remove(docstring const & w)
 115 {
 116         Impl::Words::iterator it = d->words_.find(w);
 117         if (it != d->words_.end()) {
 118                 it.data()--;
 119                 d->words_.change_weight(it, 0);
 120                 // We will not erase here, but instead we just leave it
 121                 // in the btree with weight 0. This avoid too much
 122                 // reorganisation of the tree all the time.
 123                 //if (it.data() == 0)
 124                 //      d->words_.erase(w);
 125         }
 126 }
 127
 128 } // namespace lyx