From: "Aleksi Niemelä" <aleksi.niemela@...>
Date: 2000-12-03T01:37:04+09:00
Subject: [ruby-talk:6747] Re: Array Intersect (&) question

Matz:
> Using a hash makes it pretty fast, but it does not preserve the
> original order.  If no one requests order preservation, I will use
> hashes in &, |, and uniq.  What's your opinion?

I've been in need of "ordered hash" quite often. I've always hacked around,
not created anything reusable, but I wonder if something along lines of
linear lookup time and ordered iteration could be introduced in standard
Ruby.

	- Aleksi