I believe we tested the speed of different implementation when moses 1st
started and the current implementation seemed like the fastest. We
haven't tested it since.
If there's faster/cleaner implementation, please let us know and do a
git pull request and we'll gladly pull it
On 02/07/14 10:57, Adam Teichert wrote:
This is probably a very naive question, but I go for it anyway? Does
anyone have any comments about why WordsBitmap doesn't use the stl or
boost bit-vector / bit-set datastructures (for example
std::vector<bool>, std::bitset or the boost dynamically sized version)?
This is just coming up because I'm interested in doing some bit-vector
operations with the coverage vector and I'd like them to look more
like constant time operations than linear time operations in the size
of the source sentence.
Any comments?
https://github.com/moses-smt/mosesdecoder/blob/73513c182dd3e12abf4a1df82a7e7808e3dfab83/moses/WordsBitmap.h
Thanks!
--Adam
_______________________________________________
Moses-support mailing list
[email protected]
http://mailman.mit.edu/mailman/listinfo/moses-support
_______________________________________________
Moses-support mailing list
[email protected]
http://mailman.mit.edu/mailman/listinfo/moses-support
