Text complexity explorer — retired in parot 0.3.0

This demo combined unique_fragment_count (still supported), a retired single-shot helper (removed in 0.3.0), and a legacy list-of-objects shape of find_duplicates_normalized that was superseded by the columnar Arrow-shape dict. Rebuilding it against the new API is a larger task than the 0.3.0 rename cascade covers, so the demo is temporarily retired.

Replacements for each feature

• Distinct substrings → still available as unique_fragment_count(text) (top-level JS export).
• Longest repeated substring → derive from Index queries: build const idx = new Index(text, 0) and inspect the high-count results of idx.batchFindAll([...]), or use find_duplicates_normalized and pick the longest phrase with count > 1.
• Duplicate phrases → still available as find_duplicates_normalized. In 0.3.0 it returns an Arrow-shape columnar object: {phraseBytes, phraseOffsets, count, occurrenceStarts, occurrenceEnds, occurrenceParentOffsets, ...}. See the JS API reference for the full key list and a decoding snippet.

Other demos still live here

• browser-search.html — full-text search over a large corpus using Index
• lcs.html — longest common substring between two texts