moses/TranslationModel/ProbingPT/quering.hh


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

#pragma once

#include <boost/unordered_map.hpp>
#include <sys/stat.h> //For finding size of file
#include "vocabid.hh"
#include <algorithm> //toLower
#include <deque>
#include "probing_hash_utils.hh"
#include "hash.hh" //Includes line splitter
#include "line_splitter.hh"
#include "moses//Util.h"

namespace Moses
{

class QueryEngine
{
  std::map<uint64_t, std::string> source_vocabids;

  typedef std::vector<unsigned char> Alignments;
  std::vector<Alignments> alignColl;

  Table table;
  char *mem; //Memory for the table, necessary so that we can correctly destroy the object

  size_t table_filesize;
  bool is_reordering;

  void read_alignments(const std::string &alignPath);

public:
  int num_scores;
  int num_lex_scores;
  bool logProb;

  QueryEngine(const char *);
  ~QueryEngine();

  std::pair<bool, uint64_t> query(uint64_t key);

  const std::map<uint64_t, std::string> &getSourceVocab() const
  {  return source_vocabids; }

  const std::vector<Alignments> &getAlignments() const
  {  return alignColl; }

  uint64_t getKey(uint64_t source_phrase[], size_t size) const;

  template<typename T>
  inline bool Get(const boost::unordered_map<std::string, std::string> &keyValue, const std::string &sought, T &found) const
  {
    boost::unordered_map<std::string, std::string>::const_iterator iter = keyValue.find(sought);
    if (iter == keyValue.end()) {
      return false;
    }

    const std::string &foundStr = iter->second;
    found = Scan<T>(foundStr);
    return true;
  }

};

}