Download mosesdecoder/moses2/legacy/Bitmap.cpp from sleepyhead111/vllm_fairseq: direct link, hf CLI and curl.
- Browser
- Download file 2.52 kB
-
https://huggingface.co/sleepyhead111/vllm_fairseq/resolve/main/mosesdecoder/moses2/legacy/Bitmap.cpp
- Command line
-
hf download hf://sleepyhead111/vllm_fairseq/mosesdecoder/moses2/legacy/Bitmap.cpp
-
curl -L -o Bitmap.cpp https://huggingface.co/sleepyhead111/vllm_fairseq/resolve/main/mosesdecoder/moses2/legacy/Bitmap.cpp
2.52 kB
| // $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 | |
| ***********************************************************************/ | |
| namespace Moses2 | |
| { | |
| Bitmap::Bitmap(MemPool &pool, size_t size) : | |
| m_bitmap(pool, size) | |
| { | |
| } | |
| void Bitmap::Init(const std::vector<bool>& initializer) | |
| { | |
| for (size_t i = 0; i < initializer.size(); ++i) { | |
| m_bitmap[i] = initializer[i]; | |
| } | |
| // The initializer may not be of the same length. Change to the desired | |
| // length. If we need to add any elements, initialize them to false. | |
| for (size_t i = initializer.size(); i < m_bitmap.size(); ++i) { | |
| m_bitmap[i] = false; | |
| } | |
| m_numWordsCovered = std::count(m_bitmap.begin(), m_bitmap.end(), true); | |
| // Find the first gap, and cache it. | |
| Array<char>::const_iterator first_gap = std::find(m_bitmap.begin(), | |
| m_bitmap.end(), false); | |
| m_firstGap = ((first_gap == m_bitmap.end()) ? | |
| NOT_FOUND: first_gap - m_bitmap.begin()); | |
| } | |
| void Bitmap::Init(const Bitmap ©, const Range &range) | |
| { | |
| m_firstGap = copy.m_firstGap; | |
| m_numWordsCovered = copy.m_numWordsCovered; | |
| for (size_t i = 0; i < m_bitmap.size(); ++i) { | |
| m_bitmap[i] = copy.m_bitmap[i]; | |
| } | |
| SetValueNonOverlap(range); | |
| } | |
| // for unordered_set in stack | |
| size_t Bitmap::hash() const | |
| { | |
| size_t ret = m_bitmap.hash(); | |
| return ret; | |
| } | |
| bool Bitmap::operator==(const Bitmap& other) const | |
| { | |
| return m_bitmap == other.m_bitmap; | |
| } | |
| // friend | |
| std::ostream& operator<<(std::ostream& out, const Bitmap& bitmap) | |
| { | |
| for (size_t i = 0; i < bitmap.m_bitmap.size(); i++) { | |
| out << int(bitmap.GetValue(i)); | |
| } | |
| return out; | |
| } | |
| } | |