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
|
// $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 "WordsBitmap.h"
TO_STRING_BODY(WordsBitmap);
int WordsBitmap::GetFutureCosts(int lastPos) const
{
// std::cerr<<" for lastpos "<<lastPos<<" and cov: "<<*this<<" got costs ";
int sum=0;
bool aim1=0,ai=0,aip1=m_bitmap[0];
for(size_t i=0;i<m_size;++i) {
aim1 = ai;
ai = aip1;
aip1 = (i+1==m_size || m_bitmap[i+1]);
#ifndef NDEBUG
if( i>0 ) assert( aim1==(i==0||m_bitmap[i-1]==1));
//assert( ai==a[i] );
if( i+1<m_size ) assert( aip1==m_bitmap[i+1]);
#endif
if((i==0||aim1)&&ai==0) {
sum+=abs(lastPos-static_cast<int>(i)+1);
// sum+=getJumpCosts(lastPos,i,maxJumpWidth);
}
// if(sum>1e5) return sum;
if(i>0 && ai==0 && (i+1==m_size||aip1) ) lastPos=i+1;
}
// sum+=getJumpCosts(lastPos,as,maxJumpWidth);
sum+=abs(lastPos-static_cast<int>(m_size)+1); //getCosts(lastPos,as);
assert(sum>=0);
// std::cerr<<sum<<"\n";
return sum;
}
std::vector<size_t> WordsBitmap::GetCompressedReprentation() const
{
std::vector<size_t> res(1 + (m_size >> (sizeof(int) + 3)), 0);
size_t c=0; size_t x=0; size_t ci=0;
for(size_t i=0;i<m_size;++i) {
x |= (size_t)m_bitmap[i];
x <<= 1;
c++;
if (c == sizeof(int)*8) {
res[ci++] = x; x = 0;
}
}
return res;
}
|
