Design pessimal checkRangeRead benchmark #27

New Issue

andrew · 2024-06-26T02:32:43Z

andrew commented

2024-06-26 02:32:43 +00:00

If we're checking range [b, e), and b and e have no common prefix, it should be possible to get maxBetweenExclusive to need to take the max of 255 * (len(b) + len(e)) versions, which is probably the worst case scenario for checking ranges. Let's benchmark that.

If we're checking range `[b, e)`, and `b` and `e` have no common prefix, it should be possible to get `maxBetweenExclusive` to need to take the max of `255 * (len(b) + len(e))` versions, which is probably the worst case scenario for checking ranges. Let's benchmark that.

andrew added the

enhancement

investigation

labels 2024-06-26 02:32:43 +00:00

andrew referenced this issue from a commit

2024-06-26 04:48:33 +00:00

Add worst-case benchmark for radix tree

andrew closed this issue

2024-06-26 04:48:33 +00:00

Sign in to join this conversation.