If we adopt decision to honer the order of the components in the resource name/pattern while matching a resource name with a pattern, then the attached picture is a diagram of the algorithm for matching a resource name against a pattern. If nobody is opposes the contents of picture before Monday 10AM Eastern time, I'll include it as a description of the algortihm in the erata for the response. I suspect, that if we specify that we ignore the order of the components during matching, the algorithm and the picture will become much more complex in terms of computational complexity and in terms of understanding them. Your thoughts? Konstantin
matching-algorithm-diagram.gif
matching-algorithm-diagram.png
