Welcome to mirror list, hosted at ThFree Co, Russian Federation.

TargetPhraseCollection.h « src « moses - github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 398fe87a02544aad50569524b1a6aac931162bb9 (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
// $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 <vector>
#include "TargetPhrase.h"
#include "Util.h"

//! a list of target phrases that is trsnalated from the same source phrase
class TargetPhraseCollection
{
protected:
	std::vector<TargetPhrase*> m_collection;
	
public:	
	// iters
	typedef std::vector<TargetPhrase*>::iterator iterator;
	typedef std::vector<TargetPhrase*>::const_iterator const_iterator;
	
	iterator begin() { return m_collection.begin(); }
	iterator end() { return m_collection.end(); }
	const_iterator begin() const { return m_collection.begin(); }
	const_iterator end() const { return m_collection.end(); }
	
	~TargetPhraseCollection()
	{
			RemoveAllInColl(m_collection);
	}

	//! divide collection into 2 buckets using std::nth_element, the top & bottom according to table limit
	void Sort(size_t tableLimit);

	//! number of target phrases in this collection
	size_t GetSize() const
	{
		return m_collection.size();
	}
	//! wether collection has any phrases
	bool IsEmpty() const
	{ 
		return m_collection.empty();
	}	
	//! add a new entry into collection
	void Add(TargetPhrase *targetPhrase)
	{
		m_collection.push_back(targetPhrase);
	}
	
};