the original implementation use identical logic for both ‘high’ & ‘low’, which will cause ‘high’ & ‘low’ end up at same RB-tree node, instead of an expected interval. and finally, break ‘for’ loop logic
luckily all these conditions never meet in practice. On Feb 17, 2014, at 5:14 PM, Mike Larkin <mlar...@azathoth.net> wrote: > > Probably get a better response if you explained what this diff does > and/or fixes… i just think this bug is a little too obvious
