home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.lang.lisp:2940 comp.lang.lisp.mcl:1661
- Newsgroups: comp.lang.lisp,comp.lang.lisp.mcl
- Path: sparky!uunet!newsstand.cit.cornell.edu!news
- From: Tim Larkin <tsl1@cornell.edu>
- Subject: Re: remove
- Message-ID: <1992Nov23.161022.20210@mail.cornell.edu>
- X-Xxdate: Mon, 23 Nov 92 16: 14:46 GMT
- Sender: news@mail.cornell.edu
- Nntp-Posting-Host: 128.253.27.134
- Nntp-Posting-User: tsl1@cornell.edu
- Organization: Cornell University
- X-Useragent: Nuntius v1.1.1d7
- References: <HALTRAET.92Nov20091121@monsun.si.no>
- Date: Mon, 23 Nov 1992 16:10:22 GMT
- Lines: 18
-
- In article <HALTRAET.92Nov20091121@monsun.si.no> Hallvard Tr{tteberg,
- haltraet@monsun.si.no writes:
- >It shouldn't be difficult to write one that kept the biggest unchanged
- >tail of the original list, returning the whole unmodified list if it
- >didn't contain the first argument.
-
- On the other hand, Common Lisp, the Manual, states that "the result [of
- remove] is a copy of the input sequence." If you return part of the
- original list, then you change the contract of the function. Sometimes
- one uses remove and requires a totally new list. One must be careful
- about "efficiency".
-
- Tim Larkin
- Federal Nutrition Laboratory
- Tower Road
- Ithaca, New York
- tsl1@cornell.edu
- 607-255-7008
-