Re: Multiple linked data structure

[Matthew Heaney <matthewjheaney@earthlink.net>]

fjloma@andaluciajunta.es (Francisco Javier Loma Daza) writes:

> Have you faced a similar question? are there a design pattern that
> encapsulates and solves efficiently this kind of problems?

It sounds like most of your problems can be solved with lists.

The Charles library has both single and double-linked lists.  When you
insert an item in the list, an iterator is returned that designates the
new list item.

You can then put the list iterator into any other kind of container,
such as a queue or even another list.

If you need to perform lookups that have better then O(n) time
complexity you can use the sets or maps.

Charles is available at my home page.

http://home.earthlink.net/~matthewjheaney/charles/