From ea2252b079c793ea2b08a466c0b30ad66fb58f3b Mon Sep 17 00:00:00 2001 From: Kyryl Melekhin Date: Sun, 18 Jul 2021 15:06:52 +0000 Subject: [PATCH] update readme --- README | 7 +------ 1 file changed, 1 insertion(+), 6 deletions(-) diff --git a/README b/README index e575ae4..24a9e53 100644 --- a/README +++ b/README @@ -16,12 +16,7 @@ Why? ==== Pikevm guarantees that any input regex will scale O(n) with the size of the string, thus making it the fastest regex implementation. There is no backtracking -that usually expodes to O(n^2). My goals were to explore this code and try -to use in my text editor, but after closer analysis pike performs roughly -3 times slower on small strings than traditional well optimized backtrack -engine. The cost of addthread is not exactly O(1) so it results in many -extra operations since every character is processed in lockstep. There is -also a problem of submatch tracking that grows memory usage. +that usually expodes to O(n^k) time and space where k is some constant. Features ========