I know from experience that accessing individual bits in Perl ... is far slower than unpacking integers from a packed array.
Using bitvectors in pure Perl can be fast. See Tuning Algorithm::Diff and LCS::BV. LCS::BV is a little faster than Algorithm::Diff::XS in some cases.
Returning AoA is the most convenient for further processing. Will see, how bitmaps or packed perform on e.g. a Center Star Alignment using the LCS as input.
In reply to Re^6: Faster creation of Arrays in XS?
by wollmers
in thread Faster creation of Arrays in XS?
by wollmers
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |