Bill Guindon
3/8/2005 7:47:00 PM
On Wed, 9 Mar 2005 04:39:11 +0900, Jason Bailey <azrael@demonlords.net> wrote:
>
> to clarify.. would you say the realtions are as follows:
>
> ==
> >=
> <=
> !=
> <
> >
>
> or are you thinking of just a specifc subset?
It's essentially a sort with grouping on equals. Which seemed to me
to limit the relations to < or =
some further examples:
minimum < current < hidden = incoming < reserve
hidden = incoming = reserve < minimum = current
incoming = hidden < minimum = current < reserve
> > -------- Original Message --------
> > Subject: A puzzle
> > From: "Bill Guindon" <agorilla@gmail.com>
> > Date: Tue, March 08, 2005 2:27 pm
> > To: "ruby-talk ML" <ruby-talk@ruby-lang.org>
> >
> > given 5 variables... incoming, minimium, current, maximum, reserve
> >
> > produce a text file that shows every possible map of the variable relations.
> >
> > Something along the lines of this:
> >
> > minimum < current < hidden = incoming = reserve
> >
> > For cases such as the above that have two or more equal variables, the
> > names should be sorted alphabetically, and duplicates removed:
> >
> > keep: minimum < current < hidden = incoming = reserve
> >
> > drop: minimum < current < incoming = hidden = reserve
> > drop: minimum < current < incoming = reserve = hidden
> > etc.
> >
> > btw, if you think this is quiz worthy, don't post possible answers --
> > but feel free to send "solutions" or suggestions to me off list.
> >
> > --
> > Bill Guindon (aka aGorilla)
>
>
--
Bill Guindon (aka aGorilla)