Re: Rational for not making cursor tagged in Containers

["Randy Brukardt" <randy@rrsoftware.com>]

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message
news:zp8f8yxaqal5.xmxbdrzopa73$.dlg@40tude.net...
> On Fri, 27 Apr 2007 13:37:34 +0200, Markus E Leypold wrote:
...
> > We just have to assume that anybody knows when two
> > values are equal.
>
> And this is supposed to be the definition of?

It's not quite that bad, but it is close; see 4.5.2(10):

"For discrete types, the predefined relational operators are defined in
terms of corresponding mathematical operations on the position numbers of
the values of the operations."

It surely has nothing to do with bit patterns, but rather the mathematical
meaning of those bit patterns. The RM hands off "mathematical meaning" to
another reference.

In any case, Dmitry seems to be using his own terminology again; that can be
a issue when others of us are using the terminology defined in the RM.
Without a common terminology, it's very hard to have a reasonable discourse.
Even if we're talking about an Ada-like language rather than Ada itself, it
helps to stick to the terminology of the RM.

"Value" is one of the concepts that the RM does not try to define (which
doesn't help this discussion), although it uses the term a lot. In such a
case, it is supposed to have the conventional meaning associated with the
term in English - so I don't think it is possible to completely settle
this... ;-)

                                   Randy.