From: Cyrus Hall <hallc@...>
Date: 2006-08-02T23:36:41+09:00
Subject: Re: A left-exclusive Range class

On Wed, 2006-08-02 at 23:24 +0900, Nuralanur@aol.com wrote:
> > The current Range class in ruby is quite useful, however, I was  recently
> > trying to capture a simple algorithm and ended up needing to  express
> > left-exclusion.
>  
> Can you tell me what that algorithm was ? It may be blindness, but
> at the moment, I do not understand in what circumstances one might
> need such a feature, whereas applications for right-exclusion are  obvious
> to me ...

Sure thing.  I'm working on a simulation environment for various
Distribute Hash Table (DHT) algorithms.  It is common for such
algorithms to define the key-space a node is responsible for as 

(n, n.successor]

While it is often okay to just use [n, n.successor] (which is what I'm
currently doing), it would be nice to feel the implementation followed
from theory.

I don't mean to make this sound like a critical issue, just a general
query. :-)

ciao,
Cyrus