blob: 879ad9d71b641b8b66f75288293339b8bb8ce3b5 (
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
74
|
#include <boost/foreach.hpp>
#include "Bitmaps.h"
#include "Util2.h"
using namespace std;
namespace Moses2
{
Bitmaps::Bitmaps(MemPool &pool) :
m_pool(pool)
{
}
Bitmaps::~Bitmaps()
{
}
void Bitmaps::Init(size_t inputSize,
const std::vector<bool> &initSourceCompleted)
{
m_initBitmap = new (m_pool.Allocate<Bitmap>()) Bitmap(m_pool, inputSize);
m_initBitmap->Init(initSourceCompleted);
m_coll[m_initBitmap];
}
const Bitmap &Bitmaps::GetNextBitmap(const Bitmap &bm, const Range &range)
{
Bitmap *newBM;
if (m_recycler.empty()) {
newBM = new (m_pool.Allocate<Bitmap>()) Bitmap(m_pool, bm.GetSize());
}
else {
newBM = m_recycler.top();
m_recycler.pop();
}
newBM->Init(bm, range);
Coll::const_iterator iter = m_coll.find(newBM);
if (iter == m_coll.end()) {
m_coll[newBM] = NextBitmaps();
return *newBM;
}
else {
m_recycler.push(newBM);
return *iter->first;
}
}
const Bitmap &Bitmaps::GetBitmap(const Bitmap &bm, const Range &range)
{
Coll::iterator iter = m_coll.find(&bm);
assert(iter != m_coll.end());
const Bitmap *newBM;
NextBitmaps &next = iter->second;
NextBitmaps::const_iterator iterNext = next.find(&range);
if (iterNext == next.end()) {
// not seen the link yet.
newBM = &GetNextBitmap(bm, range);
next[&range] = newBM;
}
else {
// link exist
//std::cerr << "link exists" << endl;
newBM = iterNext->second;
}
return *newBM;
}
}
|