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
|
// $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
***********************************************************************/
#include <boost/functional/hash.hpp>
#include "Bitmap.h"
namespace Moses2
{
Bitmap::Bitmap(MemPool &pool, size_t size) :
m_bitmap(pool, size)
{
}
void Bitmap::Init(const std::vector<bool>& initializer)
{
for (size_t i = 0; i < initializer.size(); ++i) {
m_bitmap[i] = initializer[i];
}
// The initializer may not be of the same length. Change to the desired
// length. If we need to add any elements, initialize them to false.
for (size_t i = initializer.size(); i < m_bitmap.size(); ++i) {
m_bitmap[i] = false;
}
m_numWordsCovered = std::count(m_bitmap.begin(), m_bitmap.end(), true);
// Find the first gap, and cache it.
Array<char>::const_iterator first_gap = std::find(m_bitmap.begin(),
m_bitmap.end(), false);
m_firstGap = ((first_gap == m_bitmap.end()) ?
NOT_FOUND: first_gap - m_bitmap.begin());
}
void Bitmap::Init(const Bitmap ©, const Range &range)
{
m_firstGap = copy.m_firstGap;
m_numWordsCovered = copy.m_numWordsCovered;
for (size_t i = 0; i < m_bitmap.size(); ++i) {
m_bitmap[i] = copy.m_bitmap[i];
}
SetValueNonOverlap(range);
}
// for unordered_set in stack
size_t Bitmap::hash() const
{
size_t ret = m_bitmap.hash();
return ret;
}
bool Bitmap::operator==(const Bitmap& other) const
{
return m_bitmap == other.m_bitmap;
}
// friend
std::ostream& operator<<(std::ostream& out, const Bitmap& bitmap)
{
for (size_t i = 0; i < bitmap.m_bitmap.size(); i++) {
out << int(bitmap.GetValue(i));
}
return out;
}
}
|
