I think it's been shown that, for small lookup tables, an array/vector with linear search is fastest. In any case, it's simpler and any difference in speed will be small for a small lookup table.
[ Full content available at: https://github.com/apache/trafficserver/pull/4222 ] This message was relayed via gitbox.apache.org for [email protected]
