45 lines
5.3 KiB
HTML
45 lines
5.3 KiB
HTML
<!-- Common Lisp HyperSpec (TM), version 7.0 generated by Kent M. Pitman on Mon, 11-Apr-2005 2:31am EDT -->
|
|
<HTML>
|
|
<HEAD>
|
|
<TITLE>CLHS: Section 14.1.1</TITLE>
|
|
<LINK HREF="../Data/clhs.css" REL="stylesheet" TYPE="text/css" />
|
|
<META HTTP-EQUIV="Author" CONTENT="Kent M. Pitman">
|
|
<META HTTP-EQUIV="Organization" CONTENT="LispWorks Ltd.">
|
|
<LINK REL=TOP HREF="../Front/index.htm">
|
|
<LINK REL=COPYRIGHT HREF="../Front/Help.htm#Legal">
|
|
<LINK REL=DISCLAIMER HREF="../Front/Help.htm#Disclaimer">
|
|
<LINK REL=PREV HREF="14_a.htm">
|
|
<LINK REL=UP HREF="14_a.htm">
|
|
<LINK REL=NEXT HREF="14_aaa.htm">
|
|
</HEAD>
|
|
<BODY>
|
|
<H1><A REV=MADE HREF="http://www.lispworks.com/"><IMG WIDTH=80 HEIGHT=65 ALT="[LISPWORKS]" SRC="../Graphics/LWSmall.gif" ALIGN=Bottom></A><A REL=TOP HREF="../Front/index.htm"><IMG WIDTH=237 HEIGHT=65 ALT="[Common Lisp HyperSpec (TM)]" SRC="../Graphics/CLHS_Sm.gif" ALIGN=Bottom></A> <A REL=PREV HREF="14_a.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Previous]" SRC="../Graphics/Prev.gif" ALIGN=Bottom></A><A REL=UP HREF="14_a.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Up]" SRC="../Graphics/Up.gif" ALIGN=Bottom></A><A REL=NEXT HREF="14_aaa.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Next]" SRC="../Graphics/Next.gif" ALIGN=Bottom></A></H1>
|
|
|
|
<HR>
|
|
|
|
<H2>
|
|
14.1.1 Conses as Trees</H2> <P>
|
|
A <A REL=DEFINITION HREF="26_glo_t.htm#tree"><I>tree</I></A> is a binary recursive data structure made up of <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> and <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atoms</I></A>: the <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> are themselves also <A REL=DEFINITION HREF="26_glo_t.htm#tree"><I>trees</I></A> (sometimes called ``subtrees'' or ``branches''), and the <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atoms</I></A> are terminal nodes (sometimes called <A REL=DEFINITION HREF="26_glo_l.htm#leaf"><I>leaves</I></A>). Typically, the <A REL=DEFINITION HREF="26_glo_l.htm#leaf"><I>leaves</I></A> represent data while the branches establish some relationship among that data. <P>
|
|
<PRE>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caaaar">caaaar</A> <A REL=DEFINITION HREF="f_car_c.htm#caddar">caddar</A> <A REL=DEFINITION HREF="f_car_c.htm#cdar">cdar</A> <A REL=DEFINITION HREF="f_substc.htm#nsubst">nsubst</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caaadr">caaadr</A> <A REL=DEFINITION HREF="f_car_c.htm#cadddr">cadddr</A> <A REL=DEFINITION HREF="f_car_c.htm#cddaar">cddaar</A> <A REL=DEFINITION HREF="f_substc.htm#nsubst-if">nsubst-if</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caaar">caaar</A> <A REL=DEFINITION HREF="f_car_c.htm#caddr">caddr</A> <A REL=DEFINITION HREF="f_car_c.htm#cddadr">cddadr</A> <A REL=DEFINITION HREF="f_substc.htm#nsubst-if-not">nsubst-if-not</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caadar">caadar</A> <A REL=DEFINITION HREF="f_car_c.htm#cadr">cadr</A> <A REL=DEFINITION HREF="f_car_c.htm#cddar">cddar</A> <A REL=DEFINITION HREF="f_nthcdr.htm#nthcdr">nthcdr</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caaddr">caaddr</A> <A REL=DEFINITION HREF="f_car_c.htm#cdaaar">cdaaar</A> <A REL=DEFINITION HREF="f_car_c.htm#cdddar">cdddar</A> <A REL=DEFINITION HREF="f_sublis.htm#sublis">sublis</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caadr">caadr</A> <A REL=DEFINITION HREF="f_car_c.htm#cdaadr">cdaadr</A> <A REL=DEFINITION HREF="f_car_c.htm#cddddr">cddddr</A> <A REL=DEFINITION HREF="f_substc.htm#subst">subst</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#caar">caar</A> <A REL=DEFINITION HREF="f_car_c.htm#cdaar">cdaar</A> <A REL=DEFINITION HREF="f_car_c.htm#cdddr">cdddr</A> <A REL=DEFINITION HREF="f_substc.htm#subst-if">subst-if</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#cadaar">cadaar</A> <A REL=DEFINITION HREF="f_car_c.htm#cdadar">cdadar</A> <A REL=DEFINITION HREF="f_car_c.htm#cddr">cddr</A> <A REL=DEFINITION HREF="f_substc.htm#subst-if-not">subst-if-not</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#cadadr">cadadr</A> <A REL=DEFINITION HREF="f_car_c.htm#cdaddr">cdaddr</A> <A REL=DEFINITION HREF="f_cp_tre.htm#copy-tree">copy-tree</A> <A REL=DEFINITION HREF="f_tree_e.htm#tree-equal">tree-equal</A>
|
|
<A REL=DEFINITION HREF="f_car_c.htm#cadar">cadar</A> <A REL=DEFINITION HREF="f_car_c.htm#cdadr">cdadr</A> <A REL=DEFINITION HREF="f_sublis.htm#nsublis">nsublis</A>
|
|
</PRE>
|
|
<P><B>Figure 14-2. Some defined names relating to trees.</B> <P>
|
|
|
|
|
|
<A REL=CHILD HREF="14_aaa.htm"><H2>
|
|
14.1.1.1 General Restrictions on Parameters that must be Trees</H2></A><P><HR>
|
|
|
|
<A REL=NAVIGATOR HREF="../Front/StartPts.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Starting Points]" SRC="../Graphics/StartPts.gif" ALIGN=Bottom></A><A REL=TOC HREF="../Front/Contents.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Contents]" SRC="../Graphics/Contents.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Master.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Index]" SRC="../Graphics/Index.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Symbol.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Symbols]" SRC="../Graphics/Symbols.gif" ALIGN=Bottom></A><A REL=GLOSSARY HREF="../Body/26_a.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Glossary]" SRC="../Graphics/Glossary.gif" ALIGN=Bottom></A><A HREF="../Front/X3J13Iss.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Issues]" SRC="../Graphics/Issues.gif" ALIGN=Bottom></A><BR>
|
|
|
|
<A REL=COPYRIGHT HREF="../Front/Help.htm#Legal"><I>Copyright 1996-2005, LispWorks Ltd. All rights reserved.</I></A><P>
|
|
</BODY>
|
|
</HTML>
|