On Tue, Nov 12, 2013 at 7:50 AM, Joshua Landau <jos...@landau.ws> wrote: > The obvious way to me is a binary search:
Which makes an O(log n) search where I have an O(1) lookup. The startup cost of denormalization doesn't scale, so when the server keeps running for two years or more, it's definitely worth processing it that way. ChrisA -- https://mail.python.org/mailman/listinfo/python-list
