[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

MAPing Sequences

To: primerd!DOUG@ENX.Prime.PDN
Subject: MAPing Sequences
From: Guy Steele <gls@Think.COM>
Date: Tue, 31 Mar 87 11:51 EST
Cc: COMMON-LISP@sail.stanford.edu

    Date: 30 Mar 87 09:35:33 EST
    From: primerd!DOUG@ENX.Prime.PDN

    How can one handle circular lists indescriminately in sequence
    functions? It seems to me that at minimum the function must record or
    mark each cons to avoid a recursive loop.   Am I missing an obvious point?

The technique is described in the form of a piece of code for
LIST-LENGTH on page 265 of CLTL.
--Guy

Prev by Date: Computed goto's
Next by Date: "computed goto"
Previous by thread: Discussion of computed GO and CASE
Next by thread: "computed goto"
Index(es):
- Date
- Thread