mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2025-01-06 19:49:41 +03:00
72 lines
1.4 KiB
C++
72 lines
1.4 KiB
C++
#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;
|
|
}
|
|
|
|
}
|
|
|