Re: Param ordering; < and <= felix (22 Jul 2002 18:45 UTC)
Almost OT, < and <= Ben Goetter (in the field) (22 Jul 2002 20:06 UTC)
Re: Almost OT, < and <= David Feuer (22 Jul 2002 22:21 UTC)
RE: Almost OT, < and <= Ben Goetter (in the field) (23 Jul 2002 09:25 UTC)
RE: Almost OT, < and <= David Feuer (23 Jul 2002 14:28 UTC)
Re: Almost OT, < and <= felix (23 Jul 2002 07:30 UTC)
RE: Almost OT, < and <= Ben Goetter (in the field) (23 Jul 2002 08:27 UTC)
Re: Almost OT, < and <= Marc Feeley (25 Jul 2002 23:43 UTC)
RE: Almost OT, < and <= Ben Goetter (26 Jul 2002 02:47 UTC)

Re: Almost OT, < and <= David Feuer 22 Jul 2002 22:21 UTC

> Beyond cycle counting, I see op< as more primitive than op<=: one
> establishes order, while the other allows for equivalence.  I would
> prefer a SORT which lets me use the most primitive predicate possible.
> On many platforms it won't matter; but on some, it may.

I see what you mean, I guess, but I don't see why this "primitiveness" is
a good thing.  Does it make sense to sort sets that are not partially
ordered?

David