kactl

kactl copied to clipboard

We should never use both i and j, for instance - it's easy to slip, and impossible to spot afterwards. Different number of letters is good. In the geometry chapter,...

simonlindholm

simonlindholm

Automata

1

- NFAs, DFAs, conversion - regex parsing - minimization - reversal - products, product minimization

simonlindholm

Extended to hashes, with complexity O(log^2 N)? Or is this made completely redundant by the suffix tree?

simonlindholm

simonlindholm

simonlindholm

The following from e-maxx might work (a bit long, so doesn't fit in KACTL at the moment, and also it seems slower): ```c++ struct SuffixTree { enum { MAXN =...

simonlindholm

Don't work on my version of clang, however. :(

simonlindholm

simonlindholm

Change `string& s` to `const string& s`

1

This makes the hashing code easier to use. For example, I can write `hashString("abc")` directly instead of having to explicitly declare a new string.

huynhtrankhanh