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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
// $Id$
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#pragma once
#include <limits>
#include <vector>
#include <iostream>
#include <cstring>
#include <cmath>
#include "TypeDef.h"
#include "WordsRange.h"
/** vector of boolean used to represent whether a word has been translated or not
*/
class WordsBitmap
{
friend std::ostream& operator<<(std::ostream& out, const WordsBitmap& wordsBitmap);
protected:
const size_t m_size; /**< number of words in sentence */
bool *m_bitmap; /**< ticks of words that have been done */
WordsBitmap(); // not implemented
//! set all elements to false
void Initialize()
{
for (size_t pos = 0 ; pos < m_size ; pos++)
{
m_bitmap[pos] = false;
}
}
public:
//! create WordsBitmap of length size and initialise
WordsBitmap(size_t size)
:m_size (size)
{
m_bitmap = (bool*) malloc(sizeof(bool) * size);
Initialize();
}
//! deep copy
WordsBitmap(const WordsBitmap ©)
:m_size (copy.m_size)
{
m_bitmap = (bool*) malloc(sizeof(bool) * m_size);
for (size_t pos = 0 ; pos < m_size ; pos++)
{
m_bitmap[pos] = copy.GetValue(pos);
}
}
~WordsBitmap()
{
free(m_bitmap);
}
//! count of words translated
size_t GetNumWordsCovered() const
{
size_t count = 0;
for (size_t pos = 0 ; pos < m_size ; pos++)
{
if (m_bitmap[pos])
count++;
}
return count;
}
//! position of 1st word not yet translated, or NOT_FOUND if everything already translated
size_t GetFirstGapPos() const
{
for (size_t pos = 0 ; pos < m_size ; pos++)
{
if (!m_bitmap[pos])
{
return pos;
}
}
// no starting pos
return NOT_FOUND;
}
//! position of last translated word
size_t GetLastPos() const
{
for (int pos = (int) m_size - 1 ; pos >= 0 ; pos--)
{
if (m_bitmap[pos])
{
return pos;
}
}
// no starting pos
return NOT_FOUND;
}
//! whether a word has been translated at a particular position
bool GetValue(size_t pos) const
{
return m_bitmap[pos];
}
//! set value at a particular position
void SetValue( size_t pos, bool value )
{
m_bitmap[pos] = value;
}
//! set value between 2 positions, inclusive
void SetValue( size_t startPos, size_t endPos, bool value )
{
for(size_t pos = startPos ; pos <= endPos ; pos++)
{
m_bitmap[pos] = value;
}
}
//! whether every word has been translated
bool IsComplete() const
{
return GetSize() == GetNumWordsCovered();
}
//! whether the wordrange overlaps with any translated word in this bitmap
bool Overlap(const WordsRange &compare) const
{
for (size_t pos = compare.GetStartPos() ; pos <= compare.GetEndPos() ; pos++)
{
if (m_bitmap[pos])
return true;
}
return false;
}
//! number of elements
size_t GetSize() const
{
return m_size;
}
//! transitive comparison of WordsBitmap
inline int Compare (const WordsBitmap &compare) const
{
// -1 = less than
// +1 = more than
// 0 = same
size_t thisSize = GetSize()
,compareSize = compare.GetSize();
if (thisSize != compareSize)
{
return (thisSize < compareSize) ? -1 : 1;
}
return std::memcmp(m_bitmap, compare.m_bitmap, thisSize);
}
inline size_t GetEdgeToTheLeftOf(size_t l) const
{
if (l == 0) return l;
while (l && !m_bitmap[l-1]) { --l; }
return l;
}
inline size_t GetEdgeToTheRightOf(size_t r) const
{
if (r+1 == m_size) return r;
while (r < m_size && !m_bitmap[r+1]) { ++r; }
return r;
}
//! TODO - ??? no idea
int GetFutureCosts(int lastPos) const ;
TO_STRING();
};
// friend
inline std::ostream& operator<<(std::ostream& out, const WordsBitmap& wordsBitmap)
{
for (size_t i = 0 ; i < wordsBitmap.m_size ; i++)
{
out << (wordsBitmap.GetValue(i) ? 1 : 0);
}
return out;
}
|
