From ... From: Erik Naggum Subject: Re: Learning LISP? Date: 1998/12/02 Message-ID: <3121553476188261@naggum.no>#1/1 X-Deja-AN: 417690687 References: <3661a1ac.5025747@news.tct.net> <36630492.628726@news.tct.net> <7405qj$rr7@pravda.cc.gatech.edu> <36646cc4.7330620@news.tct.net> mail-copies-to: never Organization: Naggum Software; +47 8800 8879; http://www.naggum.no Newsgroups: comp.lang.lisp * daveva#earthling.net (Dave Vandervies) | Can you imagine typing (first (first (rest (first (rest (first foo)))))) | 50 times? how about (first (second (second (first foo))))? in case you're referring to a tree, how about (tree-node foo 0 1 1 0)? note that the order of the arguments is reversed from the above code. the location in a tree is specified with the number of CDRs before a CAR. other location specifications may be more useful in a given case. | Of course, code that does something like that would have to be documented | well enough for the average programmer to easily understand what it's | doing and why, since at the moment I'm more interested in maintainability | than job security. >:] funny how that actually improves job security... :) #:Erik -- The Microsoft Dating Program -- where do you want to crash tonight?