blob: 9ead1053af27a94cbcd494773893f6fc483f2306 (
plain)
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
|
// $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 "FactorTypeSet.h"
using namespace std;
namespace Moses
{
FactorMask::FactorMask(const vector<FactorType> &factors)
{
vector<FactorType>::const_iterator iter;
for (iter = factors.begin() ; iter != factors.end() ; ++iter) {
this->set(*iter);
}
}
bool FactorMask::IsUseable(const FactorMask &other) const
{
for (size_t i = 0; i < other.size(); ++i) {
if (other[i]) {
if (!this->operator[](i) ) {
return false;
}
}
}
return true;
}
TO_STRING_BODY(FactorMask);
// friend
std::ostream& operator<<(std::ostream& out, const FactorMask& fm)
{
out << "FactorMask<";
bool first = true;
for (size_t currFactor = 0 ; currFactor < MAX_NUM_FACTORS ; currFactor++) {
if (fm[currFactor]) {
if (first) {
first = false;
} else {
out << ",";
}
out << currFactor;
}
}
out << ">";
return out;
}
}
|
