From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,703c4f68db81387d
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news1.google.com!newsread.com!news-xfer.newsread.com!newspeer.monmouth.com!newsfeed.icl.net!newsfeed.fjserv.net!newsfeed.freenet.de!feed.news.tiscali.de!news.belwue.de!newsfeed.arcor.de!news.arcor.de!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Magic ordering
Newsgroups: comp.lang.ada
User-Agent: 40tude_Dialog/2.0.14.1
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Reply-To: mailbox@dmitry-kazakov.de
Organization: cbb software GmbH
References: <4229bad9$0$1019$afc38c87@news.optusnet.com.au>
 <1110032222.447846.167060@g14g2000cwa.googlegroups.com>
 <871xau9nlh.fsf@insalien.org>
 <3SjWd.103128$Vf.3969241@news000.worldonline.dk>
 <87r7iu85lf.fsf@insalien.org> <1110052142.832650@athnrd02>
 <42309456$1@news.broadpark.no> <ow2Yd.21162$7U5.4617@fe04.lga>
 <opsnfw9nx75afhvo@localhost> <d0qiah$ep71@cui1.lmms.lmco.com>
 <pan.2005.03.11.18.01.45.684764@linuxchip.demon.co.uk.uk.uk>
 <d0sob3$3t5$1@s1.news.oleane.net>
 <4232ab3a$0$26547$9b4e6d93@newsread4.arcor-online.net>
 <pan.2005.03.14.14.41.47.813082@linuxchip.demon.co.uk.uk.uk>
 <d14co1$ca4$1@s1.news.oleane.net>
 <pan.2005.03.14.17.16.34.592520@linuxchip.demon.co.uk.uk.uk>
 <tnpZd.3116$qN3.2240@trndny01>
 <pan.2005.03.15.00.10.18.647492@linuxchip.demon.co.uk.uk.uk>
 <1110888090.283361.113590@z14g2000cwz.googlegroups.com>
 <mailman.27.1110891298.23655.comp.lang.ada@ada-france.org>
Date: Tue, 15 Mar 2005 14:16:20 +0100
Message-ID: <s5jb9vd0ui1d$.1n7b4eip83n1x.dlg@40tude.net>
NNTP-Posting-Date: 15 Mar 2005 14:12:52 MET
NNTP-Posting-Host: ecfb7356.newsread2.arcor-online.net
X-Trace: 
 DXC=YMgMcHeGiS;LL2:TY8[@n6Q5U85hF6f;4jW\KbG]kaM8liQbn6H@_E930dM_jH6Se4WRXZ37ga[7:n919Q4_`Vj9B8=X\UUgbk4
X-Complaints-To: abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:9438
Date: 2005-03-15T14:12:52+01:00
List-Id: <comp.lang.ada>

On Tue, 15 Mar 2005 12:54:30 +0000, Marius Amado Alves wrote:

> (Sorry I changed the subject. I'm just that kind of guy :-)
> 
> On 15 Mar 2005, at 12:01, Hans Malherbe wrote:
> 
>> I have to ask myself though: If I am denied access to information that
>> lets me  implement a < operator, am I supposed to be able to sort it?
> 
> This is one of my favourites. There's always a way. Bit by bit 
> comparison, an arbitrary index, 'Address comparison...

All of which might appear wrong. The objects might be non-contiguous, have
replicas etc.

Comparison should reflect the semantics of compared things. There is no
universal way to do it.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de