From: Robert Klemme <bob.news@...>
Date: 2003-11-20T18:02:14+09:00
Subject: Re: Multi-dimensioned sparse array ?


"Charles Hixson" <charleshixsn@earthlink.net> schrieb im Newsbeitrag
news:3FBBD914.7050602@earthlink.net...
> Simon Strandgaard wrote:
>
> >>>On Wed, 19 Nov 2003 14:21:19 +0900, Charles Hixson wrote:
> >>>
> >>>
> >>>
> >>>
> >>>>Does anyone have an implementation of a multi-dimensioned sparse
> >>>>array?
> >>>>
> >>>>
> >>>>
> >[snip]
> >
> >
> >>numerous times.  Ugh!  The list mesh looks faster, even though it
> >>absorbe 2*n+1 units of memory for each cell used  (two pointers for
each
> >>dimension.), and is itself quite slow.
> >>
> >>
> >
> >I am curious to how many dimension you need?  3, 7, 50 ?
> >
> >Which kind of algorithm are you implementing?
> >
> >--
> >Simon Strandgaard
> >
> It's actually basically a lookup algorithm at this point,

Then I'd really consider the "Hash with Arrays as keys" approach (see my
other post).  Lookups should be quite fast.

Regards

    robert