regex: Fix some tricky fold problems
authorKarl Williamson <public@khwilliamson.com>
Sat, 24 Dec 2011 03:11:22 +0000 (20:11 -0700)
committerKarl Williamson <public@khwilliamson.com>
Thu, 19 Jan 2012 18:58:19 +0000 (11:58 -0700)
commitbb9144850c8033592c0187ea712691a97703385e
tree52c1796d71c7ec32663a02436927ce9d8a05e90f
parent86d6fcadb912bd04e5bb511a8188871eb12e4274
regex: Fix some tricky fold problems

As described in the comments, this changes the design of handling the
Unicode tricky fold characters to not generate a node for each possible
sequence but to get them to work within EXACTFish nodes.

The previous design(s) all used a node to handle these, which suffers
from the downfall that it precludes legitimate matches that would cross
the node boundary.

The new design is described in the comments.
regcomp.c
regcomp.h
t/re/re_tests