From: "Bartosz Dziewoński" <matma.rex@...>
Date: 2012-05-23T23:20:47+09:00
Subject: Re: Memory-efficient set of Fixnums

Well, how about using binary search on a sorted array? That's the simplest way.

2012/5/23, George Dupre <lists@ruby-forum.com>:
> Thanks, but Hash has an even bigger memory imprint, so that won't do
> either.
>
> --
> Posted via http://www.ruby-forum.com/.
>
>

-- 
Wysłane z mojego urządzenia przenośnego

-- Matma Rex