Re: Fwd: Re: [Libclc-developers] Introducing the double linked list interface
Status: Planning
Brought to you by:
augestad
|
From: Michael B.A. <mb...@io...> - 2003-03-19 09:43:42
|
On Wed, 19 Mar 2003 06:59:32 +0100 Bj=F8rn Augestad <bo...@me...> wrote: > # Sequences > 1. vector > 2. deque > 3. list > 4. slist > 5. bit_vector >=20 > # Associative Containers > 1. set > 2. map > 3. multiset > 4. multimap > 5. hash_set > 6. hash_map > 7. hash_multiset > 8. hash_multimap > 9. hash >=20 > Need more containers? :-) I think we should start with something simple, perfect it, debate it, and let it stew a little. Then we can move on and think about transcendent ideas that facilitate exotic functionality. The linked list is a good start. >=20 > void* is OK for data, I guess. The hard part will be to find a *good*=20 > way to represent keys. Does anyone have a good concept for keys? I'm not sure what you mean. What is a key? How about void *. Mike --=20 A program should be written to model the concepts of the task it performs rather than the physical world or a process because this maximizes the potential for it to be applied to tasks that are conceptually similar and, more important, to tasks that have not yet been conceived.=20 |