From: "J. Radcliffe" <j.radcliffe@...>
Date: 2001-02-11T14:53:29+09:00
Subject: [ruby-talk:10702] algorithm module(s)

I have been giving some thought to writing modules that define some common
algorithms. If there is some consistent methodology, they could be
reused effectively in a number of ways. Various trees (b-trees,
red-black-trees) and graphs come to my mind right away, but there are
probably more. I've talked with matju about using these in his ArrayMixin,
which would allow someone to, say, use a btree data structure with an
array interface.

Any thoughts as to how this could be done most effectively?

Cheers,
Jeffrey