Re: Efficient Vector Comparison

Jon Harrop <jon@xxxxxxxxxxxxxxxxx> writes:

Yao Qi wrote:
Pascal Bourguignon <pjb@xxxxxxxxxxxxxxxxx> writes:
Is (0 1 1) bigger or smaller than (2 0 0)?

In this case, the result should be uncomparable.

Then you do not have a total order and cannot sort.

Yeah, I do not have a total order, but I do not need such total order.
They are in a partial order, I think.

How to get the relation(greater/less/equal/uncomparable) of two vectors
if this vector set is partial ordered?

Best Regards

--
Yao Qi <qiyaoltc@xxxxxxxxx> GNU/Linux Developer
http://duewayqi.googlepages.com/

For the next hour, WE will control all that you see and hear.
.

Relevant Pages

  • Re: about nonreflexivity of order relation
    ... irreflexive iff not for all x; ... A weak partial order is a relation that is reflexive, antisymmetric, and transitive. ... A strict partial order is a relation that is irreflexive and transitive. ... A strict total order is a dichotomous strict partial order. ...
    (sci.math)
  • Re: Data structures for checking consistency of a partial order?
    ... datastructure for checking the consistency of a partial order. ... A multi-dimensional array would be one possibility. ... equivalent to computing the transitive closure, ... that is inconsistent with the total order, ...
    (comp.programming)
  • Re: Data structures for checking consistency of a partial order?
    ... datastructure for checking the consistency of a partial order. ... thereby forming a "temporary" total ordering: ... that is inconsistent with the total order, ... find dogs that are bigger than horses), ...
    (comp.programming)
  • Re: Details about pythons set implementation
    ... isn't this the normal definition? ... Mathematically speaking, it is an order, and a very useful one. ... it's a partial order, which means that if a!= b then they are not ... What you need is a total order, where any two distinct elements are ...
    (comp.lang.python)