Re: lists/unions/intersections:
Oleg,
Your example suggests, that the lists are lexicographically ordered. I
assume, the final list would have the same requirement?
1. Feed each list's elements into a tree, e.g. an AVL tree.
2. If the Insertion procedure complains with "Key already exists" do
nothing for that element.
3. When done for all lists, access the result list by traversing the
tree in-order.
Regards
//Herbert
.
Relevant Pages
- Re: eval in bash vs macro in lisp
... The first element is the symbol "defun", ... The last two elements are nil, ... is used to end lists. ... The whole thing is a tree formed from pairs. ...
(comp.lang.lisp) - Re: Lisp at sexps length
... A tree doesn't look. ... tokens or characters but it's not *the* stream. ... >> parens for grouping and something else for lists. ... it means to construct a syntax object which means addition. ...
(comp.lang.lisp) - Trees
... Trees are another way to organize data for rapid lookups. ... a sort in the usual sense, a tree can be mechanically transformed into ... The advantage of dynamic lists over ... entry 'tree-insert' using root. ...
(comp.lang.cobol) - www.CeBeans.com - new program listings - Feb 4 2008
... This program is database of 25 categories of recipes on the cmu.edu website. ... This program allows you build custom play lists of Mp3 and WMA files on your ... hitting a tree. ... Free man every round after five. ...
(microsoft.public.pocketpc) - Re: Do people dislike parentheses or the conceptual mismatch with trees?
... the real life cases where you actually /have/ tree-like structures, ... difference between a list and a tree a is that the tree is ... Lists are more primitive. ... SCRAWL> h ...
(comp.lang.lisp) |
|
