1. , . :
1) make-queue() , ;
2) endqueue(item q) item q;
3) decqueue(q) q;
( pop )
,
>(setf L '(1 2 3))
(1 2 3)
>(pop L)
>L
(2 3)
4) queue-contents(q) q;
5) front(q) q.
: car , cdr , .
:
>(setf queue (make-queue)); queue
#l=(#l#)
>(endqueue 'a queue); 'a
(#l=(A). #l#)
>(endqueue 'b queue); 'b
(#l=(B) A. #l#)
>(front queue);
A
>(decqueue queue);
(#l=(A). #l#)
>(queue-contents queue)
(B); queue
, , .
2. each1(p l), , , p l.
:
>(each1 'atom '(a b c))
T
>(each1 'numberp '(1 2 a 3))
NIL
3. (count-if p l), l, , p.
:
>(count-if 'numberp '(1 2 a 3 b c))
4. (1, 1, 2, 3, 5,...).
5. , . ( ). .
:
>(transpose '((a b c) (d e f) (g h i)))
((A D G) (B E H) (C F I))
mapcar. .
6. , IF : (FIF ).
:
>(setq x 3)
>(fif x (print 'negative)
(print 'zero)
(print 'positive))
POSITIVE
1. :
a) (apply list (a b))
b) (funcall list (a b))
c) (funcall apply list (a b))
d) (funcall list apply (a b))
e) (funcall funcall funcall list list (a b))
2. FUNCALL APPLY.
3. my-find, , , . , , NIL.
:
>(my-find numberp (a b 2 C))
4. subsets, . .
:
>(subsets nil)
(NIL)
>(subsets (A B C))
(NIL (A) (B) (C) (A B) (A C) (B C) (A B C))
5. (MAPLIST fn ) .
6. , : (A), (B A), (A B A), (B A B A)
7. (REPEAT e UNTIL p), REPEAT .
7
