Noel Yap <[EMAIL PROTECTED]> writes: > > I am planning to implement a "shortest stem" matching for equally > > applicable implicit rules. Do you think that would be good definition > > of a "better-matching"? > > How is "shortest stem" defined?
Literally. Here is the algorithm I have in mind: 1. For each otherwise equally applicable implicit rule extract the stem (i.e. what % matched). 2. Find the shortest stem and use corresponding rule. This would mean that the most "specialized" or "restricted" rule will be used which is what you usually want. For example: /foo/%: /foo/bar/%: When you try to match "/foo/bar/baz" against those rules the second one is chosen. hth, -boris _______________________________________________ Help-make mailing list [EMAIL PROTECTED] http://mail.gnu.org/mailman/listinfo/help-make
