1
0
Fork 0
cl-sites/HyperSpec-7-0/HyperSpec/Body/f_pairli.htm

79 lines
4.7 KiB
HTML
Raw Permalink Normal View History

2024-04-01 10:24:07 +02:00
<!-- Common Lisp HyperSpec (TM), version 7.0 generated by Kent M. Pitman on Mon, 11-Apr-2005 2:31am EDT -->
<HTML>
<HEAD>
<TITLE>CLHS: Function PAIRLIS</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="f_cp_ali.htm">
<LINK REL=UP HREF="c_conses.htm">
<LINK REL=NEXT HREF="f_rassoc.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="f_cp_ali.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Previous]" SRC="../Graphics/Prev.gif" ALIGN=Bottom></A><A REL=UP HREF="c_conses.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Up]" SRC="../Graphics/Up.gif" ALIGN=Bottom></A><A REL=NEXT HREF="f_rassoc.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Next]" SRC="../Graphics/Next.gif" ALIGN=Bottom></A></H1>
<HR>
<A NAME="pairlis"><I>Function</I> <B>PAIRLIS</B></A> <P>
<P><B>Syntax:</B><P>
<P>
<B>pairlis</B> <I>keys data <TT>&amp;optional</TT> alist</I> =&gt; <I>new-alist</I><P>
<P>
<P><B>Arguments and Values:</B><P>
<P>
<I>keys</I>---a <A REL=DEFINITION HREF="26_glo_p.htm#proper_list"><I>proper list</I></A>. <P>
<I>data</I>---a <A REL=DEFINITION HREF="26_glo_p.htm#proper_list"><I>proper list</I></A>. <P>
<I>alist</I>---an <A REL=DEFINITION HREF="26_glo_a.htm#association_list"><I>association list</I></A>. The default is the <A REL=DEFINITION HREF="26_glo_e.htm#empty_list"><I>empty list</I></A>. <P>
<I>new-alist</I>---an <A REL=DEFINITION HREF="26_glo_a.htm#association_list"><I>association list</I></A>. <P>
<P><B>Description:</B><P>
<P>
Returns an <A REL=DEFINITION HREF="26_glo_a.htm#association_list"><I>association list</I></A> that associates elements of <I>keys</I> to corresponding elements of <I>data</I>. The consequences are undefined if <I>keys</I> and <I>data</I> are not of the same <A REL=DEFINITION HREF="26_glo_l.htm#length"><I>length</I></A>. <P>
If <I>alist</I> is supplied, <A REL=DEFINITION HREF="#pairlis"><B>pairlis</B></A> returns a modified <I>alist</I> with the new pairs prepended to it. The new pairs may appear in the resulting <A REL=DEFINITION HREF="26_glo_a.htm#association_list"><I>association list</I></A> in either forward or backward order. The result of <P>
<PRE>
(pairlis '(one two) '(1 2) '((three . 3) (four . 19)))
</PRE>
</TT> might be <P>
<PRE>
((one . 1) (two . 2) (three . 3) (four . 19))
</PRE>
</TT> or <P>
<PRE>
((two . 2) (one . 1) (three . 3) (four . 19))
</PRE>
</TT> <P>
<P><B>Examples:</B><P>
<PRE>
(setq keys '(1 2 3)
data '(&quot;one&quot; &quot;two&quot; &quot;three&quot;)
alist '((4 . &quot;four&quot;))) =&gt; ((4 . &quot;four&quot;))
(pairlis keys data) =&gt; ((3 . &quot;three&quot;) (2 . &quot;two&quot;) (1 . &quot;one&quot;))
(pairlis keys data alist)
=&gt; ((3 . &quot;three&quot;) (2 . &quot;two&quot;) (1 . &quot;one&quot;) (4 . &quot;four&quot;))
alist =&gt; ((4 . &quot;four&quot;))
</PRE>
</TT> <P>
<P><B>Side Effects:</B> None.
<P>
<P><B>Affected By:</B> None.
<P>
<P><B>Exceptional Situations:</B><P>
<P>
Should be prepared to signal an error of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="e_tp_err.htm#type-error"><B>type-error</B></A> if <I>keys</I> and <I>data</I> are not <A REL=DEFINITION HREF="26_glo_p.htm#proper_list"><I>proper lists</I></A>. <P>
<P><B>See Also:</B><P>
<P>
<A REL=DEFINITION HREF="f_acons.htm#acons"><B>acons</B></A> <P>
<P><B>Notes:</B> None.
<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>