From 97d0ff2a4340a96be3753ed1fefec20b452fada0 Mon Sep 17 00:00:00 2001 From: Drahflow Date: Tue, 10 Sep 2013 10:54:13 +0200 Subject: Towards faster regexes But keeping the old code for a while to faciliate further general performance improvements. --- notes | 20 ++++++++++++++++++-- 1 file changed, 18 insertions(+), 2 deletions(-) diff --git a/notes b/notes index 72d9f25..3d499a8 100644 --- a/notes +++ b/notes @@ -275,14 +275,14 @@ Co-iterability is decided by type-match and * integers: co-iterated type is bitwise and, if zero, no co-iteration * strings: co-iterated type is longest common substring, if epsilon, no co-iteration -== Musings about function composition operator == += Musings about function composition operator = Maybe ; should act differently when getting a string, or use another single char for category operations Uses: Categorical operators over Set Anyway: This should be handled by a library, use escape mechanism for ; -== Musings about the API == += Musings about the API = sys .file sys .net @@ -321,3 +321,19 @@ bin math [ 1 2 3 ] 16 unbase -> 1+2*16+3*16*16 12345 10 base -> [ 5 4 3 2 1 ] + += Musing about asm regex engine = + +Pseudocode: x86 assembly. +Program counter: Instruction offset relative to start of pseudocode. +Thread: Instruction counter + capture data +Threadlist: +[ + + + + [ # thread data + + + ]* +] -- cgit v1.2.3