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
|
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2010 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
#ifndef HOLECOLLECTION_H_INCLUDED_
#define HOLECOLLECTION_H_INCLUDED_
#include <set>
#include <vector>
#include "Hole.h"
class HoleCollection
{
protected:
HoleList m_holes;
std::vector<Hole*> m_sortedSourceHoles;
std::set<int> m_sourceHoleStartPoints;
std::set<int> m_sourceHoleEndPoints;
int m_scope;
int m_sourcePhraseStart;
int m_sourcePhraseEnd;
public:
HoleCollection(int sourcePhraseStart, int sourcePhraseEnd)
: m_scope(0)
, m_sourcePhraseStart(sourcePhraseStart)
, m_sourcePhraseEnd(sourcePhraseEnd)
{}
HoleCollection(const HoleCollection ©)
: m_holes(copy.m_holes)
, m_sourceHoleStartPoints(copy.m_sourceHoleStartPoints)
, m_sourceHoleEndPoints(copy.m_sourceHoleEndPoints)
, m_scope(copy.m_scope)
, m_sourcePhraseStart(copy.m_sourcePhraseStart)
, m_sourcePhraseEnd(copy.m_sourcePhraseEnd)
{} // don't copy sorted target holes. messes up sorting fn
const HoleList &GetHoles() const {
return m_holes;
}
HoleList &GetHoles() {
return m_holes;
}
std::vector<Hole*> &GetSortedSourceHoles() {
return m_sortedSourceHoles;
}
void Add(int startT, int endT, int startS, int endS);
bool OverlapSource(const Hole &sourceHole) const {
HoleList::const_iterator iter;
for (iter = m_holes.begin(); iter != m_holes.end(); ++iter) {
const Hole &currHole = *iter;
if (currHole.Overlap(sourceHole, 0))
return true;
}
return false;
}
bool ConsecSource(const Hole &sourceHole) const {
HoleList::const_iterator iter;
for (iter = m_holes.begin(); iter != m_holes.end(); ++iter) {
const Hole &currHole = *iter;
if (currHole.Neighbor(sourceHole, 0))
return true;
}
return false;
}
// Determine the scope that would result from adding the given hole.
int Scope(const Hole &proposedHole) const;
void SortSourceHoles();
};
#endif
|
