I also checked. Not a banal linked list? Of course it is! I got out my old copy of "Data Types and Structures", Gotleib & Gotleib, 1978, ISBN 0-13-197095-X. See pp 97. And the up-coming "in thing" was B-Trees.
What's the big deal in maintaining more than one link chain, whether single or doubly linked? It happens to be poor design. You are better off maintaining two (single or double) linked lists of pointers to a single heap. Asked anyone who has had to build a database circa 1979 onwards from the ground up using ... you guessed right, B-Trees. And ... while we're about it, I'm no kernel hacker, but doesn't the Linux kernel & file system use these things, for example linking a file's sectors from the parent inode and such? Maybe this particular patent issue is not as silly as it looks - it can become plain dangerous if it is allowed to drift along by default. Oron Peled wrote: > On Tuesday, 20 בMarch 2007 13:05, Ilya Konstantinov wrote: > >> This isn't a banal linked list >> > > ROTFL..... > > Ok, you made me go to my old bookshelf: > "Data Structures and Algorithms, by Aho Hopcroft and Ullman" > ISBN 0-201-00023-7 (my copy was printed on January, 1983) > > Starting on page 147: > "Multilist Structures > In general, a multilist structure is any collection of cells some of > which have more than one pointer and can therefore be on more than > one list simultaneously." > > To remove any doubt, this is one of the basic "data-structures 101" books > and the most "advanced" stuff there is maybe AVL trees. > > >> In any case, this is wildly off-topic. >> > > Yes sure. Companies that can power-grab your FOSS work from > under your feet with some lawyer baked slingshot. > Very off topic indeed... > >
begin:vcard fn:Daniel Feiglin n:Feiglin;Daniel email;internet:[EMAIL PROTECTED] tel;work:972 9 8616204 tel;fax:972 9 8621052 tel;cell:927 52 3869986 version:2.1 end:vcard
