[issue32338] Save OrderedDict import in re

[INADA Naoki]

INADA Naoki <songofacandy at gmail.com> added the comment:

> We are talking about a dictionary of 512 items in the worst case. On such very tiny collection, benchmarking matters more than O(...) complexity ;-)

You're right. Rob Pike said:

"Fancy algorithms are slow when n is small, and n is usually small."
http://users.ece.utexas.edu/~adnan/pike.html

----------

_______________________________________
Python tracker <report at bugs.python.org>
<https://bugs.python.org/issue32338>
_______________________________________