> A regular expression comparison only retusn equal, or not-equal.
>
>You could sort them by match frequency, No? The most frequently matching
>patterns are then near the root of the tree.
I don't think so.
The way the tree searching works is that if a comparison at one
node returns "less than", then we know the match, if any, must
be down one side of the tree, and cannot be down the other side.
Duane W.
Received on Tue Sep 08 1998 - 10:20:58 MDT
This archive was generated by hypermail pre-2.1.9 : Tue Dec 09 2003 - 16:41:53 MST