Skip navigation.
 
mlRe: binary search trees & binning
FROM : Scott Ribe
DATE : Wed Apr 16 21:35:40 2008

> Hmm, set<double> sounds a lot easier than this to me.


That's one way. Personally, I would try map<double, set<double>> with the
map key being the lower bound of the "bucket".

--
Scott Ribe
<email_removed>
http://www.killerbytes.com/
(303) 722-0567 voice

Related mailsAuthorDate
mlbinary search trees & binning Boyd Collier Apr 15, 21:02
mlRe: binary search trees & binning Jean-Daniel Dupas Apr 15, 23:38
mlRe: binary search trees & binning Jens Alfke Apr 15, 23:56
mlRe: binary search trees & binning John Stiles Apr 16, 00:07
mlRe: binary search trees & binning Michael Ash Apr 16, 04:14
mlRe: binary search trees & binning Jean-Daniel Dupas Apr 16, 09:56
mlRe: binary search trees & binning Jean-Daniel Dupas Apr 16, 09:59
mlRe: binary search trees & binning Army Research Lab Apr 16, 13:31
mlRe: binary search trees & binning John Stiles Apr 16, 18:25
mlRe: binary search trees & binning John Stiles Apr 16, 19:20
mlRe: binary search trees & binning Boyd Collier Apr 16, 19:37
mlRe: binary search trees & binning Scott Ribe Apr 16, 21:35
mlRe: binary search trees & binning Michael Ash Apr 16, 22:35
mlRe: binary search trees & binning John Stiles Apr 16, 23:34
mlRe: binary search trees & binning Mike Abdullah Apr 17, 00:27
mlRe: binary search trees & binning Michael Ash Apr 17, 00:58
mlRe: binary search trees & binning Army Research Lab Apr 17, 13:00