On 24 Oct 2010, at 3:50 PM, Stefan Fritsch wrote:
I am probably missing the obvious, but how do you intend to do the hash lookup? Given that <Location /app> also matches the dir / application, you may have to do N lookups for an url of length N.
Each location is parsed per whole directory, so the idea was to create a tree of directories, so we're proportional to the depth of the tree, not the numbers of locations.
Have you considered using a trie or a binary search tree?
Not yet, but I will definitely take a look. Regards, Graham --
