• Hans-Peter Deifel's avatar
    Speed up polynomial functor for large products · effbdc54
    Hans-Peter Deifel authored
    This speeds up the polynomial functor by a factor of 4-5 for some of
    my tests and also reduces memory usage considerably by using much more
    efficient data structures for `H1 Polynomial`, `Weight Polynomial` and
    `H3 Polynomial` (e.g bit-arrays instead of a recursive data structure
    filled with `Bool`s).
    This is most noticeable for DFAs which are essentially `X^A`, where A
    is the input alphabet and can be large.