From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Container for access values.
Date: Thu, 3 May 2012 09:56:26 +0200
Date: 2012-05-03T09:56:26+02:00 [thread overview]
Message-ID: <1jcixvrl3xzx3.sq8hyo061vab$.dlg@40tude.net> (raw)
In-Reply-To: 3000608.845.1336028922599.JavaMail.geo-discussion-forums@vbvx4
On Thu, 3 May 2012 00:08:42 -0700 (PDT), David Pettersson wrote:
> If I try Ordered_Sets there is no "<" defined for access and I have to
> define it myself in the same manner as hash value.
Why? If the set does not use hash table, you don't need to worry about how
"<" is implemented, if the axiomatic properties of the order relation are
respected. If the machine memory is flat, you can compare addresses. I have
a small generic package to generate access comparisons from addresses:
http://www.dmitry-kazakov.de/ada/components.htm#15.1
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
next prev parent reply other threads:[~2012-05-03 7:57 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2012-05-03 7:08 Container for access values David Pettersson
2012-05-03 7:56 ` Dmitry A. Kazakov [this message]
2012-05-03 8:26 ` David Pettersson
2012-05-03 8:40 ` Dmitry A. Kazakov
2012-05-03 14:18 ` Robert A Duff
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox