A small, fast implementation of a bitset packing up to 65k Chars into 2k Ints (8k Bytes) but using less if the range of inputs is smaller.
A small, fast implementation of a bitset packing up to 65k Chars into 2k Ints (8k Bytes) but using less if the range of inputs is smaller.
Empirically seems to be a hell of a lot faster than immutable.Bitset, making the resultant parser up to 2x faster!
Type, which when summoned implicitly, provides the name of the nearest enclosing method for your perusal
An trie node for quickly matching multiple strings which share the same prefix, one char at a time.
An trie node for quickly matching multiple strings which share the same prefix, one char at a time.
The LongMap
could be pretty easily replaced by a lookup-table
Array[TrieNode]
, but empirically that doesn't seem to give any
performance improvements.
Convert a string to a C&P-able literal.
Convert a string to a C&P-able literal. Basically copied verbatim from the uPickle source code.
Takes a predicate and pre-generates a base64 encoded bit-set, that evaluates at run-time to create a CharBitSet.
Takes a predicate and pre-generates a base64 encoded bit-set, that evaluates at run-time to create a CharBitSet. Useful for pre-computing Char predicates that are unfeasible at runtime, e.g. because they're too slow or because they don't work in Scala.js