aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarc André Tanner <mat@brain-dump.org>2017-02-09 09:59:17 +0100
committerMarc André Tanner <mat@brain-dump.org>2017-02-09 10:33:21 +0100
commit5a422abac1aff44c92ea6664d074321eaca4542c (patch)
tree33def1db3d95f81c042fb103f9eeae7ce19ba7af
parent57fadb3de52b3ddcf0a8a4343cc9d2234d3ffc31 (diff)
downloadvis-5a422abac1aff44c92ea6664d074321eaca4542c.tar.gz
vis-5a422abac1aff44c92ea6664d074321eaca4542c.tar.xz
Remove regex section from README
By now we have efficient forward searches using the TRE regex backend. Further improvements can be discussed in #488. Close #260
-rw-r--r--README.md22
1 files changed, 0 insertions, 22 deletions
diff --git a/README.md b/README.md
index ca8206a..4879ee9 100644
--- a/README.md
+++ b/README.md
@@ -288,28 +288,6 @@ etc.
This would also enable a language agnostic plugin system.
-Efficient Search and Replace
-----------------------------
-
-Currently the editor copies the whole text to a contiguous memory block
-and then uses the standard regex functions from libc. Clearly this is not
-a satisfactory solution for large files.
-
-The long term solution is to write our own regular expression engine or
-modify an existing one to make use of the iterator API. This would allow
-efficient search without having to double memory consumption.
-
-The used regex engine should use a non-backtracking algorithm. Useful
-resources include:
-
- - [Russ Cox's regex page](http://swtch.com/~rsc/regexp/)
- - [TRE](https://github.com/laurikari/tre) as
- [used by musl](http://git.musl-libc.org/cgit/musl/tree/src/regex)
- which uses a parallel [TNFA matcher](http://laurikari.net/ville/spire2000-tnfa.ps)
- - [Plan9's regex library](http://plan9.bell-labs.com/sources/plan9/sys/src/libregexp/)
- which has its root in Rob Pike's sam text editor
- - [RE2](https://github.com/google/re2) C++ regex library
-
Developer Overview
==================