M.-A. Lemburg wrote: > You mean: a compressed shift table for Unicode patterns ? > I'll have a look. It's a lossy compression: the entire delta1 table is represented as two 32-bit values, independent of the size of the source alphabet. Works amazingly well, at least when combined with the BM-variant it was designed for... (I suppose it's too late for 2.4, but it would probably be a good idea to switch to this algorithm in 2.5) </F>
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4