The Boyer-Moore string search in prelude.ml had a performance bug.
The search token preprocessing was taking quadratic time.
After fixing that, I special-cased n=1..4 with a per-char search for n=1 and PCRE for n=2..4.
Now it is nice and fast.
art with code
2009-01-27
Subscribe to:
Post Comments (Atom)
Blog Archive
-
▼
2009
(84)
-
▼
January
(15)
- Two things to make Ubuntu 8.10 less nerve-wrecking
- Performance debugging with R
- Programming books that I've liked
- Revised quickcheck.ml syntax
- Low-boilerplate testing in OCaml
- QuickCheck in make_suite.rb
- PreString tests done
- PreArray testing stats
- Prelude.ml: first pass of array tests complete
- Multi-threaded qsort in C
- Test generation / measuring code
- And even more testing
- Current testing stats
- Random thought on automated testing
- Prelude.ml testing
-
▼
January
(15)
No comments:
Post a Comment