#ifndef DICT_H_ #define DICT_H_ #include "config.h" #include #include #ifdef HAVE_SPARSEHASH # include #else # include #endif #include #include #include #include "wordid.h" class Dict { typedef #ifdef HAVE_SPARSEHASH google::dense_hash_map #else std::tr1::unordered_map #endif > Map; public: Dict() : b0_("") { #ifdef HAVE_SPARSEHASH d_.set_empty_key(""); d_.set_deleted_key(""); #endif words_.reserve(1000); } inline int max() const { return words_.size(); } inline WordID Convert(const std::string& word, bool frozen = false) { Map::iterator i = d_.find(word); if (i == d_.end()) { if (frozen) return 0; words_.push_back(word); d_[word] = words_.size(); return words_.size(); } else { return i->second; } } inline WordID Convert(const std::vector& words, bool frozen = false) { return Convert(toString(words), frozen); } static inline std::string toString(const std::vector& words) { std::string word= ""; for (std::vector::const_iterator it=words.begin(); it != words.end(); ++it) { if (it != words.begin()) word += " ||| "; word += *it; } return word; } inline const std::string& Convert(const WordID& id) const { if (id == 0) return b0_; assert(id <= (int)words_.size()); return words_[id-1]; } void AsVector(const WordID& id, std::vector* results) const; void clear() { words_.clear(); d_.clear(); } private: const std::string b0_; std::vector words_; Map d_; }; #endif