comp.lang.ada
 help / color / mirror / Atom feed
From: Keean Schupke <keean.schupke@googlemail.com>
Subject: Re: Efficient Sequential Access to Arrays
Date: Sat, 21 Jul 2012 10:09:36 -0700 (PDT)
Date: 2012-07-21T10:09:36-07:00	[thread overview]
Message-ID: <f803228d-a1f0-4f43-8809-52c83996129b@googlegroups.com> (raw)
In-Reply-To: <37aca7fe-e367-4a37-8d8b-babd75f264d1@googlegroups.com>

On Saturday, 21 July 2012 17:14:11 UTC+1, Keean Schupke  wrote:
> On Saturday, 21 July 2012 12:52:48 UTC+1, Georg Bauhaus  wrote:
> &gt; On 21.07.12 10:24, Keean Schupke wrote:
> &gt; &amp;gt; Ignoring performance which is the best way to structure this? Is there another way I have missed?
> &gt; 
> &gt; If returning had meant a copy anyway, a copying procedure
> &gt; seems another option.
> 
> Okay, but not suitable for large values if we care about performance.
> 
> &gt; 
> &gt; Also, are there cases where some callback style interface would do?
> &gt; That is, pass an &amp;quot;algorithm&amp;quot; to the containing structure for
> &gt; computation much like the Process parameter of Query_Element,
> &gt; or like when GUI classes expect programmers to write a concrete
> &gt; implementation of some abstract type that specifies the protocol.
> 
> Here are my results:
> 
> 24 byte nodes (all integers) : 42k sims per second
> 16 byte nodes (all short_ints) : 40k sims per second
> 32 byte nodes (all integers + padding) : 42k sims per second.
> 
> So 32bit integers seem faster than 16bit integers, and as the whole data set fits in the cache (its less than 10kbytes) the size of the nodes does not really affect performance.
> 
> I try something like query element next and see how that performs.
> 
> 
> Cheers,
> Keean.
> 
> 
> On Saturday, 21 July 2012 12:52:48 UTC+1, Georg Bauhaus  wrote:
> &gt; On 21.07.12 10:24, Keean Schupke wrote:
> &gt; &amp;gt; Ignoring performance which is the best way to structure this? Is there another way I have missed?
> &gt; 
> &gt; If returning had meant a copy anyway, a copying procedure
> &gt; seems another option.
> &gt; 
> &gt; Also, are there cases where some callback style interface would do?
> &gt; That is, pass an &amp;quot;algorithm&amp;quot; to the containing structure for
> &gt; computation much like the Process parameter of Query_Element,
> &gt; or like when GUI classes expect programmers to write a concrete
> &gt; implementation of some abstract type that specifies the protocol.

With Query_Element, why is passing an anonymous access to a function considered better than returning an access type? I guess the best way to do this is with generics to avoid the function access?

Cheers,
Keean.



  reply	other threads:[~2012-07-26 15:27 UTC|newest]

Thread overview: 88+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2012-07-15 18:40 Efficient Sequential Access to Arrays Keean Schupke
2012-07-15 19:48 ` Dmitry A. Kazakov
2012-07-15 20:03   ` Keean Schupke
2012-07-15 20:56     ` Keean Schupke
2012-07-16 11:34       ` Jacob Sparre Andersen
2012-07-15 21:05     ` tmoran
2012-07-15 21:08       ` Keean Schupke
2012-07-16  1:19         ` tmoran
2012-07-15 21:44     ` Georg Bauhaus
2012-07-16  7:47     ` Dmitry A. Kazakov
2012-07-16 10:16       ` Keean Schupke
2012-07-16 14:57         ` Dmitry A. Kazakov
2012-07-16 16:39           ` Keean Schupke
2012-07-16 17:02             ` Georg Bauhaus
2012-07-16 18:48             ` Dmitry A. Kazakov
2012-07-16 19:12               ` Keean Schupke
2012-07-17  6:31                 ` Dmitry A. Kazakov
2012-07-17  6:50                   ` Georg Bauhaus
2012-07-17  8:42                     ` Dmitry A. Kazakov
2012-07-17  7:24                   ` Keean Schupke
2012-07-16 19:43             ` John B. Matthews
2012-07-16 20:44               ` Keean Schupke
2012-07-16 22:23             ` tmoran
2012-07-17  6:40               ` Keean Schupke
2012-07-17  9:01                 ` Dmitry A. Kazakov
2012-07-18  8:10                   ` Keean Schupke
2012-07-18 18:11                     ` tmoran
2012-07-19 10:41                       ` Keean Schupke
2012-07-19 11:18                         ` Georg Bauhaus
2012-07-19 19:58                           ` Keean Schupke
2012-07-21  8:24                             ` Keean Schupke
2012-07-21 11:52                               ` Georg Bauhaus
2012-07-21 16:14                                 ` Keean Schupke
2012-07-21 17:09                                   ` Keean Schupke [this message]
     [not found]                                   ` <i78m081tccmp078spmsei1l5vnj3k0kbkj@invalid.netcom.com>
2012-07-22 15:50                                     ` Keean Schupke
2012-07-22  5:13                               ` Shark8
2012-07-15 21:35   ` J-P. Rosen
2012-07-15 19:52 ` Shark8
2012-07-15 20:16   ` Keean Schupke
2012-07-15 21:33     ` Georg Bauhaus
2012-07-17 18:16 ` Florian Weimer
2012-07-22 10:01 ` robin.vowels
2012-07-30  6:31   ` Jacob Sparre Andersen
2012-07-30  7:16     ` Keean Schupke
2012-07-30  9:20     ` Georg Bauhaus
2012-07-30 14:04       ` Keean Schupke
2012-07-22 10:09 ` robin.vowels
2012-07-22 16:02   ` Keean Schupke
2012-07-22 16:21 ` Florian Weimer
2012-07-22 16:46   ` Keean Schupke
2012-07-22 18:41     ` Florian Weimer
2012-07-24  8:21       ` Keean Schupke
2012-07-22 17:34   ` Niklas Holsti
2012-07-22 18:21     ` Keean Schupke
2012-07-30 14:18       ` Jacob Sparre Andersen
2012-07-24 16:00     ` robin.vowels
2012-07-25  7:09       ` Niklas Holsti
2012-07-25  9:03         ` Keean Schupke
2012-07-26  0:15           ` Randy Brukardt
2012-07-26  8:38             ` Keean Schupke
2012-07-26 10:10               ` Brian Drummond
2012-07-26 12:32                 ` Keean Schupke
2012-07-26 13:46                   ` Dmitry A. Kazakov
2012-07-26 17:40                     ` Shark8
2012-07-26 18:56                       ` Dmitry A. Kazakov
2012-07-27  5:25                         ` Shark8
2012-07-27  6:28                           ` Dmitry A. Kazakov
2012-07-27  7:01                             ` Vasiliy Molostov
2012-07-27  8:48                               ` Dmitry A. Kazakov
2012-07-27 12:01                                 ` Georg Bauhaus
2012-07-27 16:49                                 ` Vasiliy Molostov
2012-07-27 19:38                                   ` Dmitry A. Kazakov
2012-07-28  5:32                             ` Shark8
2012-07-28  7:37                               ` Dmitry A. Kazakov
2012-07-28 18:32                                 ` Shark8
     [not found]                     ` <6ov218tnkbqu3vpkuo4t77rd7de0a3aesf@invalid.netcom.com>
2012-07-26 18:49                       ` Dmitry A. Kazakov
     [not found]                         ` <86d31898ne39maimbl24knds7rf38qg7vc@invalid.netcom.com>
2012-07-27  6:45                           ` Dmitry A. Kazakov
2012-07-27  8:21                   ` Keean Schupke
2012-07-27  8:50                     ` Dmitry A. Kazakov
2012-07-27  9:17                       ` Keean Schupke
2013-02-25 21:18                     ` Eryndlia Mavourneen
2012-07-26 13:08               ` Georg Bauhaus
2012-07-26 19:37                 ` stefan-lucks
2012-07-26 19:21               ` stefan-lucks
2012-07-31  3:12               ` Randy Brukardt
2012-07-26  7:11           ` Markus Schöpflin
2012-07-26 14:47         ` Robin Vowels
2012-07-26 15:18           ` Martin
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox