3 ms·
Search is pretty fundamental to text editors. Getting fast insertion with slow search is not always a desirable trade-off.
by celeritascelery 5y ago
Search is pretty fundamental to text editors. Getting fast insertion with slow search is not always a desirable trade-off.
- a1369209993 5y agoIf the regex engine doesn't support indexing into a arbitrary (indexable) data structure, that's a deficiency in the regex engine, not in one particular such data structure. You can tell this isn't a deficiency of ropes, because the exact same thing would happen if you used[0] hash tables or b-trees. Search might be slower with a more complicated lookup (versus a probably-inlined-and-otherwise-optimized pointer-plus-index addition), but that wasn't the problem described; the problem decribed was that non-array lookups weren't supported at all, and search required copying the data over to a array before the regex engine would deign to touch it. 0: for a example, not a suggestion that they would be a good fit for a text editor