Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
;;; -*- Log: code.log; Package: Lisp -*-
;;;
;;; **********************************************************************
;;; This code was written as part of the Spice Lisp project at
;;; Carnegie-Mellon University, and has been placed in the public domain.
;;; If you want to use this code or any part of Spice Lisp, please contact
;;; Scott Fahlman (FAHLMAN@CMUC).
;;; **********************************************************************
;;;
;;; Functions to implement lists for Spice Lisp.
;;; Written by Joe Ginder and Carl Ebeling.
;;; Rewritten and currently maintained by Skef Wholey.
;;;
;;; Nsublis, things at the beginning broken.
;;;
;;; The list functions are part of the standard Spice Lisp environment.
;;;
;;; **********************************************************************
;;;
(in-package 'lisp)
(export '(car cdr caar
cadr cdar cddr caaar caadr cadar caddr cdaar cdadr
cddar cdddr caaaar caaadr caadar caaddr cadaar cadadr
caddar cadddr cdaaar cdaadr cdadar cdaddr cddaar cddadr
cdddar cddddr cons tree-equal endp list-length nth first
second third fourth fifth sixth seventh eighth
ninth tenth rest nthcdr last list list* make-list
append copy-list copy-alist copy-tree revappend nconc
nreconc butlast nbutlast ldiff rplaca rplacd subst
subst-if subst-if-not nsubst nsubst-if nsubst-if-not sublis nsublis
member member-if member-if-not tailp adjoin union
nunion intersection nintersection set-difference
nset-difference set-exclusive-or nset-exclusive-or subsetp
acons pairlis
assoc assoc-if assoc-if-not
rassoc rassoc-if rassoc-if-not))
(proclaim '(maybe-inline
tree-equal list-length nth %setnth nthcdr last make-list append
copy-list copy-alist copy-tree revappend nconc nreconc butlast
nbutlast ldiff member member-if member-if-not tailp adjoin union
nunion intersection nintersection set-difference nset-difference
set-exclusive-or nset-exclusive-or subsetp acons pairlis assoc
assoc-if assoc-if-not rassoc rassoc-if rassoc-if-not subst subst-if
subst-if-not nsubst nsubst-if nsubst-if-not sublis nsublis))
(in-package "EXTENSIONS")
(export '(assq memq delq))
;; Assq & memq are just interpreter stubs.
(proclaim '(maybe-inline delq))
(in-package 'lisp)
;;; These functions perform basic list operations:
(defun car (list) "Returns the 1st object in a list." (car list))
(defun cdr (list) "Returns all but the first object." (cdr list))
(defun cadr (list) "Returns the 2nd object in a list." (cadr list))
(defun cdar (list) "Returns the cdr of the 1st sublist." (cdar list))
(defun caar (list) "Returns the car of the 1st sublist." (caar list))
(defun cddr (list) "Returns all but the 1st two objects of a list." (cddr list))
(defun caddr (list) "Returns the 1st object in the cddr of a list." (caddr list))
(defun caadr (list) "Returns the 1st object in the cadr of a list." (caadr list))
(defun caaar (list) "Returns the 1st object in the caar of a list." (caaar list))
(defun cdaar (list) "Returns the cdr of the caar of a list." (cdaar list))
(defun cddar (list) "Returns the cdr of the cdar of a list." (cddar list))
(defun cdddr (list) "Returns the cdr of the cddr of a list." (cdddr list))
(defun cadar (list) "Returns the car of the cdar of a list." (cadar list))
(defun cdadr (list) "Returns the cdr of the cadr of a list." (cdadr list))
(defun caaaar (list) "Returns the car of the caaar of a list." (caaaar list))
(defun caaadr (list) "Returns the car of the caadr of a list." (caaadr list))
(defun caaddr (list) "Returns the car of the caddr of a list." (caaddr list))
(defun cadddr (list) "Returns the car of the cdddr of a list." (cadddr list))
(defun cddddr (list) "Returns the cdr of the cdddr of a list." (cddddr list))
(defun cdaaar (list) "Returns the cdr of the caaar of a list." (cdaaar list))
(defun cddaar (list) "Returns the cdr of the cdaar of a list." (cddaar list))
(defun cdddar (list) "Returns the cdr of the cddar of a list." (cdddar list))
(defun caadar (list) "Returns the car of the cadar of a list." (caadar list))
(defun cadaar (list) "Returns the car of the cdaar of a list." (cadaar list))
(defun cadadr (list) "Returns the car of the cdadr of a list." (cadadr list))
(defun caddar (list) "Returns the car of the cddar of a list." (caddar list))
(defun cdaadr (list) "Returns the cdr of the caadr of a list." (cdaadr list))
(defun cdadar (list) "Returns the cdr of the cadar of a list." (cdadar list))
(defun cdaddr (list) "Returns the cdr of the caddr of a list." (cdaddr list))
(defun cddadr (list) "Returns the cdr of the cdadr of a list." (cddadr list))
(defun cons (se1 se2) "Returns a list with se1 as the car and se2 as the cdr."
(cons se1 se2))
(proclaim '(maybe-inline tree-equal-test tree-equal-test-not))
(defun tree-equal-test-not (x y test-not)
(cond ((not (funcall test-not x y)) t)
((consp x)
(and (consp y)
(tree-equal-test-not (car x) (car y) test-not)
(tree-equal-test-not (cdr x) (cdr y) test-not)))
(t ())))
(defun tree-equal-test (x y test)
(cond ((funcall test x y) t)
((consp x)
(and (consp y)
(tree-equal-test (car x) (car y) test)
(tree-equal-test (cdr x) (cdr y) test)))
(t ())))
(defun tree-equal (x y &key (test #'eql) test-not)
"Returns T if X and Y are isomorphic trees with identical leaves."
(if test-not
(tree-equal-test-not x y test-not)
(tree-equal-test x y test)))
(defun endp (object)
"The recommended way to test for the end of a list. True if Object is nil,
false if Object is a cons, and an error for any other types of arguments."
(endp object))
(defun list-length (list)
"Returns the length of the given List, or Nil if the List is circular."
(do ((n 0 (+ n 2))
(y list (cddr y))
(z list (cdr z)))
(())
(when (endp y) (return n))
(when (endp (cdr y)) (return (+ n 1)))
(when (and (eq y z) (> n 0)) (return nil))))
(defun nth (n list)
"Returns the nth object in a list where the car is the zero-th element."
(car (%primitive nthcdr n list)))
(defun first (list)
"Returns the 1st object in a list or NIL if the list is empty."
(car list))
(defun second (list)
"Returns the 2nd object in a list or NIL if there is no 2nd object."
(cadr list))
(defun third (list)
"Returns the 3rd object in a list or NIL if there is no 3rd object."
(caddr list))
(defun fourth (list)
"Returns the 4th object in a list or NIL if there is no 4th object."
(cadddr list))
(defun fifth (list)
"Returns the 5th object in a list or NIL if there is no 5th object."
(car (cddddr list)))
(defun sixth (list)
"Returns the 6th object in a list or NIL if there is no 6th object."
(cadr (cddddr list)))
(defun seventh (list)
"Returns the 7th object in a list or NIL if there is no 7th object."
(caddr (cddddr list)))
(defun eighth (list)
"Returns the 8th object in a list or NIL if there is no 8th object."
(cadddr (cddddr list)))
(defun ninth (list)
"Returns the 9th object in a list or NIL if there is no 9th object."
(car (cddddr (cddddr list))))
(defun tenth (list)
"Returns the 10th object in a list or NIL if there is no 10th object."
(cadr (cddddr (cddddr list))))
(defun rest (list)
"Means the same as the cdr of a list."
(cdr list))
(defun nthcdr (n list)
"Performs the cdr function n times on a list."
(%primitive nthcdr n list))
(defun last (list)
"Returns the last cons (not the last element!) of a list."
(%primitive last list))
(defun list (&rest args)
"Returns constructs and returns a list of its arguments."
args)
;;; List* is done the same as list, except that the last cons is made a
;;; dotted pair
(defun list* (arg &rest others)
"Returns a list of the arguments with last cons a dotted pair"
(cond ((atom others) arg)
((atom (cdr others)) (cons arg (car others)))
(t (do ((x others (cdr x)))
((null (cddr x)) (rplacd x (cadr x))))
(cons arg others))))
(defun make-list (size &key initial-element)
(declare (fixnum size))
"Constructs a list with size elements each set to value"
(if (< size 0) (error "~S is an illegal size for MAKE-LIST." size)
(do ((count size (1- count))
(result '() (cons initial-element result)))
((zerop count) result)
(declare (fixnum count)))))
;;; The outer loop finds the first non-null list and the result is started.
;;; The remaining lists in the arguments are tacked to the end of the result
;;; using splice which cdr's down the end of the new list
(defun append (&rest lists)
"Construct a new list by concatenating the list arguments"
(do ((top lists (cdr top))) ;;Cdr to first non-null list.
((atom top) '())
(cond ((null (car top))) ; Nil -> Keep looping
((not (consp (car top))) ; Non cons
(if (cdr top)
(error "~S is not a list." (car top))
(return (car top))))
(t ; Start appending
(return
(if (atom (cdr top))
(car top) ;;Special case.
(let* ((result (cons (caar top) '()))
(splice result))
(do ((x (cdar top) (cdr x))) ;;Copy first list
((atom x))
(setq splice
(cdr (rplacd splice (cons (car x) ()) ))) )
(do ((y (cdr top) (cdr y))) ;;Copy rest of lists.
((atom (cdr y))
(setq splice (rplacd splice (car y)))
result)
(if (listp (car y))
(do ((x (car y) (cdr x))) ;;Inner copy loop.
((atom x))
(setq
splice
(cdr (rplacd splice (cons (car x) ())))))
(error "~S is not a list." (car y)))))))))))
;;; List Copying Functions
;;; The list is copied correctly even if the list is not terminated by ()
;;; The new list is built by cdr'ing splice which is always at the tail
;;; of the new list
(defun copy-list (list)
"Returns a new list EQUAL but not EQ to list"
(if (atom list)
(if list
(error "~S is not a list." list))
(let ((result (cons (car list) '()) ))
(do ((x (cdr list) (cdr x))
(splice result
(cdr (rplacd splice (cons (car x) '() ))) ))
((atom x) (unless (null x)
(rplacd splice x))
result)))))
(defun copy-alist (alist)
"Returns a new association list equal to alist, constructed in space"
(if (atom alist)
(if alist
(error "~S is not a list." alist))
(let ((result
(cons (if (atom (car alist))
(car alist)
(cons (caar alist) (cdar alist)) )
'() )))
(do ((x (cdr alist) (cdr x))
(splice result
(cdr (rplacd splice
(cons
(if (atom (car x))
(car x)
(cons (caar x) (cdar x)))
'() ))) ))
;;; Non-null terminated alist done here.
((atom x) (unless (null x)
(rplacd splice x))
result)))))
(defun copy-tree (object)
"Copy-Tree recursively copys trees of conses."
(cond ((not (consp object)) object)
(T (cons (copy-tree (car object)) (copy-tree (cdr object)))) ))
;;; More Commonly-used List Functions
(defun revappend (x y)
"Returns (append (reverse x) y)"
(do ((top x (cdr top))
(result y (cons (car top) result)))
((endp top) result)))
;;; NCONC finds the first non-null list, so it can make splice point
;;; to a cons. After finding the first cons element, it holds it in
;;; a result variable while running down successive elements tacking
;;; them together. While tacking lists together, if we encounter a
;;; null list, we set the previous list's last cdr to nil just in case
;;; it wasn't already nil, and it could have been dotted while the null
;;; list was the last argument to NCONC. The manipulation of splice (that
;;; is starting it out on a first cons, setting LAST of splice, and
;;; setting splice to ele) inherently handles (nconc x x), and it avoids
;;; running down the last argument to NCONC which allows the last argument
;;; to be circular.
;;;
(defun nconc (&rest lists)
"Concatenates the lists given as arguments (by changing them)"
(do ((top lists (cdr top)))
((null top) nil)
(typecase (car top)
(cons
(let* ((result (car top))
(splice result))
(dolist (ele (cdr top))
(typecase ele
(cons (rplacd (last splice) ele)
(setf splice ele))
(null (rplacd (last splice) nil))
(t (error "Argument is not a list -- ~S." ele))))
(return result)))
(null)
(t (error "Argument is not a list -- ~S." (car top))))))
(defun nreconc (x y)
"Returns (nconc (nreverse x) y)"
(do ((1st (cdr x) (if (atom 1st) 1st (cdr 1st)))
(2nd x 1st) ;2nd follows first down the list.
(3rd y 2nd)) ;3rd follows 2nd down the list.
((atom 2nd) 3rd)
(rplacd 2nd 3rd)))
(defun butlast (list &optional (n 1))
"Returns a new list the same as List without the N last elements."
(unless (integerp n)
(error "Wrong type argument, ~S, should have been of type INTEGER."))
(if (< n 0) (setq n 0))
(let ((length (1- (length (the list list)))))
(declare (fixnum length))
(if (< length n)
()
(do* ((top (cdr list) (cdr top))
(result (list (car list)))
(splice result)
(count length (1- count)))
((= count n) result)
(setq splice (cdr (rplacd splice (list (car top)))))))))
(defun nbutlast (list &optional (n 1))
"Modifies List to remove the last N elements."
(unless (integerp n)
(error "Wrong type argument, ~S, should have been of type INTEGER."))
(if (< n 0) (setq n 0))
(let ((length (1- (length (the list list)))))
(declare (fixnum length))
(if (< length n) ()
(do ((1st (cdr list) (cdr 1st))
(2nd list 1st)
(count length (1- count)))
((= count n)
(rplacd 2nd ())
list)))))
(defun ldiff (list sublist)
"Returns a new list, whose elements are those of List that appear before
Sublist. If Sublist is not a tail of List, a copy of List is returned."
(do* ((list list (cdr list))
(result (list ()))
(splice result))
((or (null list) (eq list sublist)) (cdr result))
(setq splice (cdr (rplacd splice (list (car list)))))))
;;; Functions to alter list structure
(defun rplaca (x y)
"Changes the car of x to y and returns the new x."
(rplaca x y))
(defun rplacd (x y)
"Changes the cdr of x to y and returns the new x."
(rplacd x y))
;;; The following are for use by SETF.
(defun %rplaca (x val) (rplaca x val) val)
(defun %rplacd (x val) (rplacd x val) val)
(defun %setnth (n list newval)
(declare (fixnum n))
"Sets the Nth element of List (zero based) to Newval."
(if (< n 0)
(error "~S is an illegal N for SETF of NTH." n)
(do ((count n (1- count)))
((zerop count) (rplaca list newval) newval)
(declare (fixnum count))
(if (endp (cdr list))
(error "~S is too large an index for SETF of NTH." n)
(setq list (cdr list))))))
;;;; Macros for (&key (key #'identity) (test #'eql testp) (test-not nil notp)).
;;; Use these with the following keyword args:
;;;
(defmacro with-set-keys (funcall)
`(cond ((and testp notp) (error "Test and test-not both supplied."))
(notp ,(append funcall '(:key key :test-not test-not)))
(t ,(append funcall '(:key key :test test)))))
(defmacro satisfies-the-test (item elt)
`(cond (testp
(funcall test ,item (funcall key ,elt)))
(notp
(not (funcall test-not ,item (funcall key ,elt))))
(t (funcall test ,item (funcall key ,elt)))))
;;; Substitution of expressions
(defun subst (new old tree &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Substitutes new for subtrees matching old."
(labels ((s (subtree)
(cond ((satisfies-the-test old subtree) new)
((atom subtree) subtree)
(t (let ((car (s (car subtree)))
(cdr (s (cdr subtree))))
(if (and (eq car (car subtree))
(eq cdr (cdr subtree)))
subtree
(cons car cdr)))))))
(s tree)))
(defun subst-if (new test tree &key (key #'identity))
"Substitutes new for subtrees for which test is true."
(labels ((s (subtree)
(cond ((funcall test (funcall key subtree)) new)
((atom subtree) subtree)
(t (let ((car (s (car subtree)))
(cdr (s (cdr subtree))))
(if (and (eq car (car subtree))
(eq cdr (cdr subtree)))
subtree
(cons car cdr)))))))
(s tree)))
(defun subst-if-not (new test tree &key (key #'identity))
"Substitutes new for subtrees for which test is false."
(labels ((s (subtree)
(cond ((not (funcall test (funcall key subtree))) new)
((atom subtree) subtree)
(t (let ((car (s (car subtree)))
(cdr (s (cdr subtree))))
(if (and (eq car (car subtree))
(eq cdr (cdr subtree)))
subtree
(cons car cdr)))))))
(s tree)))
(defun nsubst (new old tree &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Substitutes new for subtrees matching old."
(labels ((s (subtree)
(cond ((satisfies-the-test old subtree) new)
((atom subtree) subtree)
(t (do* ((last nil subtree)
(subtree subtree (Cdr subtree)))
((atom subtree)
(if (satisfies-the-test old subtree)
(setf (cdr last) new)))
(if (satisfies-the-test old subtree)
(return (setf (cdr last) new))
(setf (car subtree) (s (car subtree)))))
subtree))))
(s tree)))
(defun nsubst-if (new test tree &key (key #'identity))
"Substitutes new for subtrees of tree for which test is true."
(labels ((s (subtree)
(cond ((funcall test (funcall key subtree)) new)
((atom subtree) subtree)
(t (do* ((last nil subtree)
(subtree subtree (Cdr subtree)))
((atom subtree)
(if (funcall test (funcall key subtree))
(setf (cdr last) new)))
(if (funcall test (funcall key subtree))
(return (setf (cdr last) new))
(setf (car subtree) (s (car subtree)))))
subtree))))
(s tree)))
(defun nsubst-if-not (new test tree &key (key #'identity))
"Substitutes new for subtrees of tree for which test is false."
(labels ((s (subtree)
(cond ((not (funcall test (funcall key subtree))) new)
((atom subtree) subtree)
(t (do* ((last nil subtree)
(subtree subtree (Cdr subtree)))
((atom subtree)
(if (not (funcall test (funcall key subtree)))
(setf (cdr last) new)))
(if (not (funcall test (funcall key subtree)))
(return (setf (cdr last) new))
(setf (car subtree) (s (car subtree)))))
subtree))))
(s tree)))
(defun sublis (alist tree &key (key #'identity)
(test #'eql) (test-not nil notp))
"Substitutes from alist into tree nondestructively."
(labels ((s (subtree)
(let ((assoc
(if notp
(assoc (funcall key subtree) alist :test-not test-not)
(assoc (funcall key subtree) alist :test test))))
(cond (assoc (cdr assoc))
((atom subtree) subtree)
(t (let ((car (s (car subtree)))
(cdr (s (cdr subtree))))
(if (and (eq car (car subtreE))
(eq cdr (cdr subtree)))
subtree
(cons car cdr))))))))
(s tree)))
;;; In run-time env, since can be referenced in line expansions.
(defmacro nsublis-macro ()
'(if notp
(assoc (funcall key subtree) alist :test-not test-not)
(assoc (funcall key subtree) alist :test test)))
(defun nsublis (alist tree &key (key #'identity)
(test #'eql) (test-not nil notp))
"Substitutes new for subtrees matching old."
(let (temp)
(labels ((s (subtree)
(cond ((Setq temp (nsublis-macro))
(cdr temp))
((atom subtree) subtree)
(t (do* ((last nil subtree)
(subtree subtree (Cdr subtree)))
((atom subtree)
(if (setq temp (nsublis-macro))
(setf (cdr last) (cdr temp))))
(if (setq temp (nsublis-macro))
(return (setf (Cdr last) (Cdr temp)))
(setf (car subtree) (s (car subtree)))))
subtree))))
(s tree))))
;;; Functions for using lists as sets
(defun member (item list &key (key #'identity) (test #'eql testp)
(test-not nil notp))
"Returns tail of list beginning with first element satisfying EQLity,
:test, or :test-not with a given item."
(do ((list list (cdr list)))
((null list) nil)
(let ((car (car list)))
(if (satisfies-the-test item car)
(return list)))))
(defun member-if (test list &key (key #'identity))
"Returns tail of list beginning with first element satisfying test(element)"
(unless (listp list)
(error "~S is not a list." list))
(do ((list list (Cdr list)))
((endp list) nil)
(if (funcall test (funcall key (car list)))
(return list))))
(defun member-if-not (test list &key (key #'identity))
"Returns tail of list beginning with first element not satisfying test(el)"
(unless (listp list)
(error "~S is not a list." list))
(do ((list list (cdr list)))
((endp list) ())
(if (not (funcall test (funcall key (car list))))
(return list)))))
(defun tailp (sublist list)
"Returns T if sublist is one of the cons'es in list"
(do ((x list (cdr x)))
((endp x) '())
(if (eq x sublist) (return T))))
(defun adjoin (item list &key (key #'identity) (test #'eql) (test-not nil notp))
"Add item to list unless it is already a member"
(if (if notp (member (funcall key item) list :test-not test-not :key key)
(member (funcall key item) list :test test :key key))
list
(cons item list)))
(defun union (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Returns the union of list1 and list2."
(if (and testp notp)
(error "Test and test-not both supplied."))
(let ((res list1))
(dolist (elt list2)
(if (not (with-set-keys (member (funcall key elt) list1)))
(push elt res)))
res))
;;; Destination and source are setf-able and many-evaluable.
;;; Sets the source to the cdr, and "conses" the 1st elt of source to destination.
(defmacro steve-splice (source destination)
`(let ((temp ,source))
(setf ,source (Cdr ,source)
(cdr temp) ,destination
,destination temp)))
(Defun nunion (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Destructively returns the union list1 and list2."
(if (and testp notp)
(error "Test and test-not both supplied."))
(let ((res list1))
(do () ((endp list2))
(if (not (with-set-keys (member (funcall key (car list2)) list1)))
(steve-splice list2 res)
(Setq list2 (cdr list2))))
res))
(defun intersection (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Returns the intersection of list1 and list2."
(if (and testp notp)
(error "Test and test-not both supplied."))
(let ((res nil))
(dolist (elt list1)
(if (with-set-keys (member (funcall key elt) list2))
(push elt res)))
res))
(Defun nintersection (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Destructively returns the intersection of list1 and list2."
(if (and testp notp)
(error "Test and test-not both supplied."))
(let ((res nil))
(do () ((endp list1))
(if (with-set-keys (member (funcall key (car list1)) list2))
(steve-splice list1 res)
(setq list1 (Cdr list1))))
res))
(Defun set-difference (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Returns the elements of list1 which are not in list2."
(if (and testp notp)
(error "Test and test-not both supplied."))
(if (null list2)
list1
(let ((res nil))
(dolist (elt list1)
(if (not (with-set-keys (member (funcall key elt) list2)))
(push elt res)))
res)))
(Defun nset-difference (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Destructively returns the elements of list1 which are not in list2."
(if (and testp notp)
(error "Test and test-not both supplied."))
(let ((res nil))
(do () ((endp list1))
(if (not (with-set-keys (member (funcall key (car list1)) list2)))
(steve-splice list1 res)
(setq list1 (cdr list1))))
res))
(defun set-exclusive-or (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Returns new list of elements appearing exactly once in list1 and list2."
(let ((result nil))
(dolist (elt list1)
(unless (with-set-keys (member (funcall key elt) list2))
(setq result (cons elt result))))
(dolist (elt list2)
(unless (with-set-keys (member (funcall key elt) list1))
(setq result (cons elt result))))
result))
;;; The outer loop examines list1 while the inner loop examines list2. If an
;;; element is found in list2 "equal" to the element in list1, both are
;;; spliced out. When the end of list1 is reached, what is left of list2 is
;;; tacked onto what is left of list1. The splicing operation ensures that
;;; the correct operation is performed depending on whether splice is at the
;;; top of the list or not
(defun nset-exclusive-or (list1 list2 &key (test #'eql) (test-not nil notp)
(key #'identity))
"Destructively return a list with elements which appear but once in list1
and list2."
(do ((x list1 (cdr x))
(splicex ()))
((endp x)
(if (null splicex)
(setq list1 list2)
(rplacd splicex list2))
list1)
(do ((y list2 (cdr y))
(splicey ()))
((endp y) (setq splicex x))
(cond ((if notp
(not (funcall test-not (funcall key (car x))
(funcall key (Car y))))
(funcall test (funcall key (car x)) (funcall key (Car y))))
(if (null splicex)
(setq list1 (cdr x))
(rplacd splicex (cdr x)))
(if (null splicey)
(setq list2 (cdr y))
(rplacd splicey (cdr y)))
(return ())) ; assume lists are really sets
(t (setq splicey y)))))))
(defun subsetp (list1 list2 &key (key #'identity)
(test #'eql testp) (test-not nil notp))
"Returns T if every element in list1 is also in list2."
(dolist (elt list1)
(unless (with-set-keys (member (funcall key elt) list2))
(return-from subsetp nil)))
T)
;;; Functions that operate on association lists
(defun acons (key datum alist)
"Construct a new alist by adding the pair (key . datum) to alist"
(cons (cons key datum) alist))
(defun pairlis (keys data &optional (alist '()))
"Construct an association list from keys and data (adding to alist)"
(do ((x keys (cdr x))
(y data (cdr y)))
((and (endp x) (endp y)) alist)
(if (or (endp x) (endp y))
(error "The lists of keys and data are of unequal length."))
(setq alist (acons (car x) (car y) alist))))
;;; In run-time environment, since these guys can be inline expanded.
(defmacro assoc-guts (test-guy)
`(do ((alist alist (cdr alist)))
((endp alist))
(if (car alist)
(if ,test-guy (return (car alist))))))
(defun assoc (item alist &key (key #'identity) test test-not)
"Returns the cons in alist whose car is equal (by a given test or EQL) to
the Item."
(cond (test (assoc-guts (funcall test item (funcall key (caar alist)))))
(test-not (assoc-guts (not (funcall test-not item (funcall key (caar alist))))))
(t (assoc-guts (eql item (funcall key (caar alist)))))))
(defun assoc-if (predicate alist)
"Returns the first cons in alist whose car satisfies the Predicate."
(assoc-guts (funcall predicate (caar alist))))
(defun assoc-if-not (predicate alist)
"Returns the first cons in alist whose car does not satisfy the Predicate."
(assoc-guts (not (funcall predicate (caar alist)))))
(defun rassoc (item alist &key (key #'identity) test test-not)
(declare (list alist))
"Returns the cons in alist whose cdr is equal (by a given test or EQL) to
the Item."
(cond (test (assoc-guts (funcall test item (funcall key (cdar alist)))))
(test-not (assoc-guts (not (funcall test-not item (funcall key (cdar alist))))))
(t (assoc-guts (eql item (funcall key (cdar alist)))))))
(defun rassoc-if (predicate alist)
"Returns the cons in alist whose cdr satisfies the Predicate."
(assoc-guts (funcall predicate (cdar alist))))
(defun rassoc-if-not (predicate alist)
"Returns the first cons in alist whose cdr does not satisfy the Predicate."
(assoc-guts (not (funcall predicate (cdar alist)))))
(defun map1 (function original-arglists accumulate take-car)
"This function is called by mapc, mapcar, mapcan, mapl, maplist, and mapcon.
It Maps function over the arglists in the appropriate way. It is done when any
of the arglists runs out. Until then, it CDRs down the arglists calling the
function and accumulating results as desired."
(let* ((arglists (copy-list original-arglists))
(ret-list (list nil))
(temp ret-list))
(do ((res nil)
(args '() '()))
((dolist (x arglists nil) (if (null x) (return t)))
(if accumulate
(cdr ret-list)
(car original-arglists)))
(do ((l arglists (cdr l)))
((null l))
(push (if take-car (caar l) (car l)) args)
(setf (car l) (cdar l)))
(setq res (apply function (nreverse args)))
(case accumulate
(:nconc (setq temp (last (nconc temp res))))
(:list (rplacd temp (list res))
(setq temp (cdr temp)))))))
(defun mapc (function list &rest more-lists)
"Applies fn to successive elements of lists, returns its second argument."
(map1 function (cons list more-lists) nil t))
(defun mapcar (function list &rest more-lists)
"Applies fn to successive elements of list, returns list of results."
(map1 function (cons list more-lists) :list t))
(defun mapcan (function list &rest more-lists)
"Applies fn to successive elements of list, returns NCONC of results."
(map1 function (cons list more-lists) :nconc t))
(defun mapl (function list &rest more-lists)
"Applies fn to successive CDRs of list, returns ()."
(map1 function (cons list more-lists) nil nil))
(defun maplist (function list &rest more-lists)
"Applies fn to successive CDRs of list, returns list of results."
(map1 function (cons list more-lists) :list nil))
(defun mapcon (function list &rest more-lists)
"Applies fn to successive CDRs of lists, returns NCONC of results."
(map1 function (cons list more-lists) :nconc nil))
;;; Functions for compatibility sake:
(defun memq (item list)
"Returns tail of list beginning with first element eq to item"
(memq item list))
(defun assq (item alist)
"Return the first pair of alist where item EQ the key of pair"
(assq item alist))
(defun delq (item list &optional (n 0 np))
(declare (fixnum n))
"Returns list with all (up to n) elements with all elements EQ to ITEM
deleted"
(do ((x list (cdr x))
(splice '()))
((or (endp x)
(and np (zerop n))) list)
(cond ((eq item (car x))
(setq n (1- n))
(if (null splice)
(setq list (cdr x))
(rplacd splice (cdr x))))
(T (setq splice x))))) ; move splice along to include element