Re: looking for a fast re-usable non-pointer data structure ....

["Kevin Rigotti" <rigotti@atc.dera.gov.uk>]

What doesn't it like?

Are you trying to return a limited type from a remotely dispatched function,
or some other thing that would need T'Read and T'Write but cannot have them.

If the tree is reasonably complete you wouldn't lose much by mapping the AVL
tree onto an array and just marking the unused nodes in some way.

Kevin
--
ATC Systems Group, DERA, St Andrews Road, Malvern, Worcestershire WR14 3PS,
UK
Phone +44 (0)1684 89 69 11, fax +44(0)1684 89 41 09
DERA disclaimers and restrictions apply, details on request

Tony Gair <tonygair@donot.spam.btinternet.com> wrote in message
news:9sookc$d83$1@neptunium.btinternet.com...
> Does anyone know of  reasonably fast data structure to store a large
amount
> of records.
>
> The reason I want this is that I have a protected object which uses an avl
> tree from the booch components which I want to use with the distributed
> annex, which currently does not like my avl tree at all.
>
> Any ideas, has anyone used an avl tree as  a remote protected objected
> object with the distributed annex,
> Should I dump the annex...or the avl tree
>
>