> Really the requirement should be less than 1/10th or so (decrease at > roughly log(N) rate) but I put in 1/2 because it's just a rough rubric > to catch the worst offenders.
Actually, the really real requirement I think should be 1/values.length because there can be weird cases in the btree reductions. I never tracked them down, but I ran into it when doing the Top-N-Tags examples. HTH, Paul Davis
