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

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

[Tony Gair]

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

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

[Kevin Rigotti]

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
>
>

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

[Ted Dennison]

In article <9sookc$d83$1@neptunium.btinternet.com>, Tony Gair says...
>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

Its probably just a matter of properly defining the stream attributes for your
AVL tree so that the distributed annex can use them. But going through that
process does not sound to me like a task for beginners or the faint-of-heart.

---
T.E.D.    homepage   - http://www.telepath.com/dennison/Ted/TED.html

No trees were killed in the sending of this message. 
However a large number of electrons were terribly inconvenienced.

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

[Jeffrey Carter]

Tony Gair wrote:
> 
> Does anyone know of  reasonably fast data structure to store a large amount
> of records.

It would help if you provided more information about what precisely you
want. PragmARC.Queue_Bounded is fast, non-pointer, and a data structure,
but since you're using an AVL tree I doubt that it does what you want.

Balanced tree structures tend to be slow for insertion and deletion, but
fast [O(log N)] for searching. You might be interested in a skip list.
Skip lists are approximately O(log N) for searching, and O(1) for
insertion and deletion; I do not understand why people continue to use
balanced trees given the existence of skip lists. See
PragmARC.Skip_List_Unbounded for an implementation of a skip list.

It should be reasonably simple to implement a bounded skip list, just as
it is to implement a bounded list.

-- 
Jeffrey Carter