regcomp.c: Handle more cases of tricky fold chars
authorKarl Williamson <public@khwilliamson.com>
Wed, 9 Feb 2011 17:56:59 +0000 (10:56 -0700)
committerKarl Williamson <public@khwilliamson.com>
Mon, 14 Feb 2011 15:41:37 +0000 (08:41 -0700)
commit6e326e848ae0c6b25007720a8b57c1be32b1316b
tree64a169f7a1d6b5c5fcd76611224021a65c87e312
parent7e2509c1602d8aa746e63f571f9b46e8b2dca105
regcomp.c: Handle more cases of tricky fold chars

Certain characters are not placed in EXACTish nodes because of problems
mostly with the optimizer.  However, not all notations that generated
those characters were caught.  This catches all but those in \N{}
constructs; which is coming later.

This does not use FOLDCHAR, which doesn't know the difference between
/d and /u; instead it uses ANYOFV, which does handle those cases already,
at the expense of larger (in storage) regexes for these few characters.
If this were deemed a problem, there would be some work involved in
adding FOLDCHARU, and fixing the code where it doesn't work properly now.
regcomp.c