mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-25 21:03:22 +03:00
48 lines
1.3 KiB
C++
48 lines
1.3 KiB
C++
// $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"
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
TO_STRING_BODY(WordsBitmap);
|
|
|
|
bool WordsBitmap::IsAdjacent(size_t startPos, size_t endPos) const
|
|
{
|
|
if (GetNumWordsCovered() == 0) {
|
|
return true;
|
|
}
|
|
|
|
size_t first = GetFirstGapPos();
|
|
size_t last = GetLastGapPos();
|
|
|
|
if (startPos == last || endPos == first) {
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
}
|
|
|