Happy Happy Joy Joy (was: On to Hydro)
Tyler Close
tjclose@yahoo.com
Mon, 21 Aug 2000 17:50:01 -0400
Markm wrote:
> At 01:32 PM 8/21/00 , Tyler Close wrote:
> >? define m := RedBlackTree new(LesserDouble INSTANCE) asSet
> ># value: [ ]
> >
> >? define NaN := 0.0 / 0.0
> ># value: NaN
> >
> >? m := m with(NaN)
> ># value: [ NaN ]
>
> Since RedBlackTrees are supposed to only hold fully ordered
> sets, I propose
> that this operation should be an error. I hereby define ;)
> a singleton set
> of an irreflexive element to be a non fully ordered set.
> Makes for a
> different sort of weird sense.
Since you admit that both are weird, why do you want to add special
case handling to my code?
How on earth can you justify saying that a space of one element is not
fully ordered? Show me an alternate ordering.
> A case that's weird in the other direction:
>
> ? m := m with(0.0)
> # value: [0.0]
>
> ? m contains(-0.0)
> # value: true
>
> Whereas a non ordering container would say false.
Yes, the new version has this behaviour as well.
Tyler
_________________________________________________________
Do You Yahoo!?
Get your free @yahoo.com address at http://mail.yahoo.com