The important thing with this approach is the order of the tests. Searching for the longest match first is the only way to be successful here, a bit like looking for a routing table match using binary arithmetic (the longest prefix match wins).