1 /* Copyright (C) 1995,1996,1997,2000,2001,2003,2004,2008,2009,2010,2011
2 * Free Software Foundation, Inc.
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public License
6 * as published by the Free Software Foundation; either version 3 of
7 * the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
26 #include "libguile/_scm.h"
27 #include "libguile/eq.h"
29 #include "libguile/validate.h"
30 #include "libguile/list.h"
31 #include "libguile/eval.h"
38 #define SCM_I_CONS(cell, x, y) \
40 cell = scm_cell (SCM_UNPACK (x), SCM_UNPACK (y)); \
47 SCM_I_CONS (c1
, e1
, SCM_EOL
);
52 scm_list_2 (SCM e1
, SCM e2
)
55 SCM_I_CONS (c2
, e2
, SCM_EOL
);
56 SCM_I_CONS (c1
, e1
, c2
);
61 scm_list_3 (SCM e1
, SCM e2
, SCM e3
)
64 SCM_I_CONS (c3
, e3
, SCM_EOL
);
65 SCM_I_CONS (c2
, e2
, c3
);
66 SCM_I_CONS (c1
, e1
, c2
);
71 scm_list_4 (SCM e1
, SCM e2
, SCM e3
, SCM e4
)
73 return scm_cons2 (e1
, e2
, scm_list_2 (e3
, e4
));
77 scm_list_5 (SCM e1
, SCM e2
, SCM e3
, SCM e4
, SCM e5
)
79 return scm_cons2 (e1
, e2
, scm_list_3 (e3
, e4
, e5
));
83 scm_list_n (SCM elt
, ...)
90 while (! SCM_UNBNDP (elt
))
92 #if (SCM_DEBUG_CELL_ACCESSES == 1)
93 if (SCM_HEAP_OBJECT_P (elt
))
94 SCM_VALIDATE_CELL(elt
, 0);
96 *pos
= scm_cons (elt
, SCM_EOL
);
97 pos
= SCM_CDRLOC (*pos
);
98 elt
= va_arg (foo
, SCM
);
105 SCM_DEFINE (scm_make_list
, "make-list", 1, 1, 0,
107 "Create a list containing of @var{n} elements, where each\n"
108 "element is initialized to @var{init}. @var{init} defaults to\n"
109 "the empty list @code{()} if not given.")
110 #define FUNC_NAME s_scm_make_list
112 unsigned nn
= scm_to_uint (n
);
116 if (SCM_UNBNDP (init
))
119 for (i
= 0; i
< nn
; i
++)
120 ret
= scm_cons (init
, ret
);
126 SCM_DEFINE (scm_cons_star
, "cons*", 1, 0, 1,
128 "Like @code{list}, but the last arg provides the tail of the\n"
129 "constructed list, returning @code{(cons @var{arg1} (cons\n"
130 "@var{arg2} (cons @dots{} @var{argn})))}. Requires at least one\n"
131 "argument. If given one argument, that argument is returned as\n"
132 "result. This function is called @code{list*} in some other\n"
133 "Schemes and in Common LISP.")
134 #define FUNC_NAME s_scm_cons_star
139 SCM_VALIDATE_REST_ARGUMENT (rest
);
141 for ( ; scm_is_pair (rest
); rest
= SCM_CDR (rest
))
143 *p
= scm_cons (arg
, SCM_EOL
);
145 arg
= SCM_CAR (rest
);
155 /* general questions about lists --- null?, list?, length, etc. */
157 SCM_DEFINE (scm_null_p
, "null?", 1, 0, 0,
159 "Return @code{#t} iff @var{x} is the empty list, else @code{#f}.")
160 #define FUNC_NAME s_scm_null_p
162 return scm_from_bool (SCM_NULL_OR_NIL_P (x
));
167 SCM_DEFINE (scm_list_p
, "list?", 1, 0, 0,
169 "Return @code{#t} iff @var{x} is a proper list, else @code{#f}.")
170 #define FUNC_NAME s_scm_list_p
172 return scm_from_bool (scm_ilength (x
) >= 0);
177 /* Return the length of SX, or -1 if it's not a proper list.
178 This uses the "tortoise and hare" algorithm to detect "infinitely
179 long" lists (i.e. lists with cycles in their cdrs), and returns -1
180 if it does find one. */
189 if (SCM_NULL_OR_NIL_P(hare
)) return i
;
190 if (!scm_is_pair (hare
)) return -1;
191 hare
= SCM_CDR(hare
);
193 if (SCM_NULL_OR_NIL_P(hare
)) return i
;
194 if (!scm_is_pair (hare
)) return -1;
195 hare
= SCM_CDR(hare
);
197 /* For every two steps the hare takes, the tortoise takes one. */
198 tortoise
= SCM_CDR(tortoise
);
200 while (!scm_is_eq (hare
, tortoise
));
202 /* If the tortoise ever catches the hare, then the list must contain
208 SCM_DEFINE (scm_length
, "length", 1, 0, 0,
210 "Return the number of elements in list @var{lst}.")
211 #define FUNC_NAME s_scm_length
214 SCM_VALIDATE_LIST_COPYLEN (1, lst
, i
);
215 return scm_from_long (i
);
221 /* appending lists */
223 SCM_DEFINE (scm_append
, "append", 0, 0, 1,
225 "Return a list consisting of the elements the lists passed as\n"
228 "(append '(x) '(y)) @result{} (x y)\n"
229 "(append '(a) '(b c d)) @result{} (a b c d)\n"
230 "(append '(a (b)) '((c))) @result{} (a (b) (c))\n"
232 "The resulting list is always newly allocated, except that it\n"
233 "shares structure with the last list argument. The last\n"
234 "argument may actually be any object; an improper list results\n"
235 "if the last argument is not a proper list.\n"
237 "(append '(a b) '(c . d)) @result{} (a b c . d)\n"
238 "(append '() 'a) @result{} a\n"
240 #define FUNC_NAME s_scm_append
242 SCM_VALIDATE_REST_ARGUMENT (args
);
243 if (scm_is_null (args
)) {
248 SCM arg
= SCM_CAR (args
);
250 args
= SCM_CDR (args
);
251 while (!scm_is_null (args
)) {
252 while (scm_is_pair (arg
)) {
253 *lloc
= scm_cons (SCM_CAR (arg
), SCM_EOL
);
254 lloc
= SCM_CDRLOC (*lloc
);
257 SCM_VALIDATE_NULL_OR_NIL (argnum
, arg
);
258 arg
= SCM_CAR (args
);
259 args
= SCM_CDR (args
);
269 SCM_DEFINE (scm_append_x
, "append!", 0, 0, 1,
271 "A destructive version of @code{append} (@pxref{Pairs and\n"
272 "Lists,,,r5rs, The Revised^5 Report on Scheme}). The cdr field\n"
273 "of each list's final pair is changed to point to the head of\n"
274 "the next list, so no consing is performed. Return\n"
276 #define FUNC_NAME s_scm_append_x
280 SCM_VALIDATE_REST_ARGUMENT (args
);
282 if (scm_is_null (args
))
288 SCM arg
= SCM_CAR (args
);
291 args
= SCM_CDR (args
);
292 if (scm_is_null (args
))
295 if (!SCM_NULL_OR_NIL_P (arg
))
297 SCM_VALIDATE_CONS (argnum
, arg
);
298 loc
= SCM_CDRLOC (scm_last_pair (arg
));
299 SCM_VALIDATE_NULL_OR_NIL (argnum
, *loc
);
307 SCM_DEFINE (scm_last_pair
, "last-pair", 1, 0, 0,
309 "Return the last pair in @var{lst}, signalling an error if\n"
310 "@var{lst} is circular.")
311 #define FUNC_NAME s_scm_last_pair
316 if (SCM_NULL_OR_NIL_P (lst
))
319 SCM_VALIDATE_CONS (SCM_ARG1
, lst
);
321 SCM ahead
= SCM_CDR(hare
);
322 if (!scm_is_pair (ahead
)) return hare
;
324 ahead
= SCM_CDR(hare
);
325 if (!scm_is_pair (ahead
)) return hare
;
327 tortoise
= SCM_CDR(tortoise
);
329 while (!scm_is_eq (hare
, tortoise
));
330 SCM_MISC_ERROR ("Circular structure in position 1: ~S", scm_list_1 (lst
));
335 /* reversing lists */
337 SCM_DEFINE (scm_reverse
, "reverse", 1, 0, 0,
339 "Return a new list that contains the elements of @var{lst} but\n"
341 #define FUNC_NAME s_scm_reverse
343 SCM result
= SCM_EOL
;
348 if (SCM_NULL_OR_NIL_P(hare
)) return result
;
349 SCM_ASSERT(scm_is_pair(hare
), lst
, 1, FUNC_NAME
);
350 result
= scm_cons (SCM_CAR (hare
), result
);
351 hare
= SCM_CDR (hare
);
352 if (SCM_NULL_OR_NIL_P(hare
)) return result
;
353 SCM_ASSERT(scm_is_pair(hare
), lst
, 1, FUNC_NAME
);
354 result
= scm_cons (SCM_CAR (hare
), result
);
355 hare
= SCM_CDR (hare
);
356 tortoise
= SCM_CDR (tortoise
);
358 while (!scm_is_eq (hare
, tortoise
));
359 SCM_MISC_ERROR ("Circular structure in position 1: ~S", scm_list_1 (lst
));
363 SCM_DEFINE (scm_reverse_x
, "reverse!", 1, 1, 0,
364 (SCM lst
, SCM new_tail
),
365 "A destructive version of @code{reverse} (@pxref{Pairs and Lists,,,r5rs,\n"
366 "The Revised^5 Report on Scheme}). The cdr of each cell in @var{lst} is\n"
367 "modified to point to the previous list element. Return the\n"
369 "Caveat: because the list is modified in place, the tail of the original\n"
370 "list now becomes its head, and the head of the original list now becomes\n"
371 "the tail. Therefore, the @var{lst} symbol to which the head of the\n"
372 "original list was bound now points to the tail. To ensure that the head\n"
373 "of the modified list is not lost, it is wise to save the return value of\n"
375 #define FUNC_NAME s_scm_reverse_x
377 SCM_VALIDATE_LIST (1, lst
);
378 if (SCM_UNBNDP (new_tail
))
381 while (!SCM_NULL_OR_NIL_P (lst
))
383 SCM old_tail
= SCM_CDR (lst
);
384 SCM_SETCDR (lst
, new_tail
);
394 /* indexing lists by element number */
396 SCM_DEFINE (scm_list_ref
, "list-ref", 2, 0, 0,
398 "Return the @var{k}th element from @var{list}.")
399 #define FUNC_NAME s_scm_list_ref
403 i
= scm_to_ulong (k
);
404 while (scm_is_pair (lst
)) {
406 return SCM_CAR (lst
);
412 if (SCM_NULL_OR_NIL_P (lst
))
413 SCM_OUT_OF_RANGE (2, k
);
415 SCM_WRONG_TYPE_ARG (1, list
);
420 SCM_DEFINE (scm_list_set_x
, "list-set!", 3, 0, 0,
421 (SCM list
, SCM k
, SCM val
),
422 "Set the @var{k}th element of @var{list} to @var{val}.")
423 #define FUNC_NAME s_scm_list_set_x
426 unsigned long int i
= scm_to_ulong (k
);
427 while (scm_is_pair (lst
)) {
429 SCM_SETCAR (lst
, val
);
436 if (SCM_NULL_OR_NIL_P (lst
))
437 SCM_OUT_OF_RANGE (2, k
);
439 SCM_WRONG_TYPE_ARG (1, list
);
444 SCM_REGISTER_PROC(s_list_cdr_ref
, "list-cdr-ref", 2, 0, 0, scm_list_tail
);
446 SCM_DEFINE (scm_list_tail
, "list-tail", 2, 0, 0,
448 "@deffnx {Scheme Procedure} list-cdr-ref lst k\n"
449 "Return the \"tail\" of @var{lst} beginning with its @var{k}th element.\n"
450 "The first element of the list is considered to be element 0.\n\n"
451 "@code{list-tail} and @code{list-cdr-ref} are identical. It may help to\n"
452 "think of @code{list-cdr-ref} as accessing the @var{k}th cdr of the list,\n"
453 "or returning the results of cdring @var{k} times down @var{lst}.")
454 #define FUNC_NAME s_scm_list_tail
456 size_t i
= scm_to_size_t (k
);
458 SCM_VALIDATE_CONS (1, lst
);
466 SCM_DEFINE (scm_list_cdr_set_x
, "list-cdr-set!", 3, 0, 0,
467 (SCM list
, SCM k
, SCM val
),
468 "Set the @var{k}th cdr of @var{list} to @var{val}.")
469 #define FUNC_NAME s_scm_list_cdr_set_x
472 size_t i
= scm_to_size_t (k
);
473 while (scm_is_pair (lst
)) {
475 SCM_SETCDR (lst
, val
);
482 if (SCM_NULL_OR_NIL_P (lst
))
483 SCM_OUT_OF_RANGE (2, k
);
485 SCM_WRONG_TYPE_ARG (1, list
);
491 /* copying lists, perhaps partially */
493 SCM_DEFINE (scm_list_head
, "list-head", 2, 0, 0,
495 "Copy the first @var{k} elements from @var{lst} into a new list, and\n"
497 #define FUNC_NAME s_scm_list_head
501 size_t i
= scm_to_size_t (k
);
507 SCM_VALIDATE_CONS (1, lst
);
508 *pos
= scm_cons (SCM_CAR (lst
), SCM_EOL
);
509 pos
= SCM_CDRLOC (*pos
);
517 /* Copy a list which is known to be finite. The last pair may or may not have
518 * a '() in its cdr. That is, improper lists are accepted. */
520 scm_i_finite_list_copy (SCM list
)
522 if (!scm_is_pair (list
))
529 const SCM result
= tail
= scm_list_1 (SCM_CAR (list
));
530 list
= SCM_CDR (list
);
531 while (scm_is_pair (list
))
533 const SCM new_tail
= scm_list_1 (SCM_CAR (list
));
534 SCM_SETCDR (tail
, new_tail
);
536 list
= SCM_CDR (list
);
538 SCM_SETCDR (tail
, list
);
545 SCM_DEFINE (scm_list_copy
, "list-copy", 1, 0, 0,
547 "Return a (newly-created) copy of @var{lst}.")
548 #define FUNC_NAME s_scm_list_copy
554 SCM_VALIDATE_LIST (1, lst
);
560 while (scm_is_pair (from_here
))
563 c
= scm_cons (SCM_CAR (from_here
), SCM_CDR (from_here
));
565 fill_here
= SCM_CDRLOC (c
);
566 from_here
= SCM_CDR (from_here
);
573 SCM_PROC (s_list
, "list", 0, 0, 1, scm_list_copy
);
574 SCM_SNARF_DOCS (primitive
, scm_list_copy
, "list", (SCM objs
), 0, 0, 1,
575 "Return a list containing @var{objs}, the arguments to\n"
578 /* This used to be the code for "list", but it's wrong when used via apply
579 (it should copy the list). It seems pretty unlikely anyone would have
580 been using this from C code, since it's a no-op, but keep it for strict
581 binary compatibility. */
590 /* membership tests (memq, memv, etc.) */
592 /* The function scm_c_memq returns the first sublist of list whose car is
593 * 'eq?' obj, where the sublists of list are the non-empty lists returned by
594 * (list-tail list k) for k less than the length of list. If obj does not
595 * occur in list, then #f (not the empty list) is returned.
596 * List must be a proper list, otherwise scm_c_memq may crash or loop
600 scm_c_memq (SCM obj
, SCM list
)
602 for (; !SCM_NULL_OR_NIL_P (list
); list
= SCM_CDR (list
))
604 if (scm_is_eq (SCM_CAR (list
), obj
))
611 SCM_DEFINE (scm_memq
, "memq", 2, 0, 0,
613 "Return the first sublist of @var{lst} whose car is @code{eq?}\n"
614 "to @var{x} where the sublists of @var{lst} are the non-empty\n"
615 "lists returned by @code{(list-tail @var{lst} @var{k})} for\n"
616 "@var{k} less than the length of @var{lst}. If @var{x} does not\n"
617 "occur in @var{lst}, then @code{#f} (not the empty list) is\n"
619 #define FUNC_NAME s_scm_memq
621 SCM hare
= lst
, tortoise
= lst
;
623 while (scm_is_pair (hare
))
625 if (scm_is_eq (SCM_CAR (hare
), x
))
628 hare
= SCM_CDR (hare
);
630 if (!scm_is_pair (hare
))
633 if (scm_is_eq (SCM_CAR (hare
), x
))
636 hare
= SCM_CDR (hare
);
638 tortoise
= SCM_CDR (tortoise
);
639 if (SCM_UNLIKELY (scm_is_eq (hare
, tortoise
)))
643 if (SCM_LIKELY (scm_is_null (hare
)))
646 scm_wrong_type_arg_msg (FUNC_NAME
, 2, lst
, "list");
651 SCM_DEFINE (scm_memv
, "memv", 2, 0, 0,
653 "Return the first sublist of @var{lst} whose car is @code{eqv?}\n"
654 "to @var{x} where the sublists of @var{lst} are the non-empty\n"
655 "lists returned by @code{(list-tail @var{lst} @var{k})} for\n"
656 "@var{k} less than the length of @var{lst}. If @var{x} does not\n"
657 "occur in @var{lst}, then @code{#f} (not the empty list) is\n"
659 #define FUNC_NAME s_scm_memv
661 SCM hare
= lst
, tortoise
= lst
;
663 while (scm_is_pair (hare
))
665 if (scm_is_true (scm_eqv_p (SCM_CAR (hare
), x
)))
668 hare
= SCM_CDR (hare
);
670 if (!scm_is_pair (hare
))
673 if (scm_is_true (scm_eqv_p (SCM_CAR (hare
), x
)))
676 hare
= SCM_CDR (hare
);
678 tortoise
= SCM_CDR (tortoise
);
679 if (SCM_UNLIKELY (scm_is_eq (hare
, tortoise
)))
683 if (SCM_LIKELY (scm_is_null (hare
)))
686 scm_wrong_type_arg_msg (FUNC_NAME
, 2, lst
, "list");
691 SCM_DEFINE (scm_member
, "member", 2, 0, 0,
693 "Return the first sublist of @var{lst} whose car is\n"
694 "@code{equal?} to @var{x} where the sublists of @var{lst} are\n"
695 "the non-empty lists returned by @code{(list-tail @var{lst}\n"
696 "@var{k})} for @var{k} less than the length of @var{lst}. If\n"
697 "@var{x} does not occur in @var{lst}, then @code{#f} (not the\n"
698 "empty list) is returned.")
699 #define FUNC_NAME s_scm_member
701 SCM_VALIDATE_LIST (2, lst
);
702 for (; !SCM_NULL_OR_NIL_P (lst
); lst
= SCM_CDR (lst
))
704 if (! scm_is_false (scm_equal_p (SCM_CAR (lst
), x
)))
712 /* deleting elements from a list (delq, etc.) */
714 SCM_DEFINE (scm_delq_x
, "delq!", 2, 0, 0,
716 "@deffnx {Scheme Procedure} delv! item lst\n"
717 "@deffnx {Scheme Procedure} delete! item lst\n"
718 "These procedures are destructive versions of @code{delq}, @code{delv}\n"
719 "and @code{delete}: they modify the existing @var{lst}\n"
720 "rather than creating a new list. Caveat evaluator: Like other\n"
721 "destructive list functions, these functions cannot modify the binding of\n"
722 "@var{lst}, and so cannot be used to delete the first element of\n"
723 "@var{lst} destructively.")
724 #define FUNC_NAME s_scm_delq_x
729 for (prev
= &lst
, walk
= lst
;
731 walk
= SCM_CDR (walk
))
733 if (scm_is_eq (SCM_CAR (walk
), item
))
734 *prev
= SCM_CDR (walk
);
736 prev
= SCM_CDRLOC (walk
);
744 SCM_DEFINE (scm_delv_x
, "delv!", 2, 0, 0,
746 "Destructively remove all elements from @var{lst} that are\n"
747 "@code{eqv?} to @var{item}.")
748 #define FUNC_NAME s_scm_delv_x
753 for (prev
= &lst
, walk
= lst
;
755 walk
= SCM_CDR (walk
))
757 if (! scm_is_false (scm_eqv_p (SCM_CAR (walk
), item
)))
758 *prev
= SCM_CDR (walk
);
760 prev
= SCM_CDRLOC (walk
);
769 SCM_DEFINE (scm_delete_x
, "delete!", 2, 0, 0,
771 "Destructively remove all elements from @var{lst} that are\n"
772 "@code{equal?} to @var{item}.")
773 #define FUNC_NAME s_scm_delete_x
778 for (prev
= &lst
, walk
= lst
;
780 walk
= SCM_CDR (walk
))
782 if (! scm_is_false (scm_equal_p (SCM_CAR (walk
), item
)))
783 *prev
= SCM_CDR (walk
);
785 prev
= SCM_CDRLOC (walk
);
796 SCM_DEFINE (scm_delq
, "delq", 2, 0, 0,
798 "Return a newly-created copy of @var{lst} with elements\n"
799 "@code{eq?} to @var{item} removed. This procedure mirrors\n"
800 "@code{memq}: @code{delq} compares elements of @var{lst} against\n"
801 "@var{item} with @code{eq?}.")
802 #define FUNC_NAME s_scm_delq
804 SCM copy
= scm_list_copy (lst
);
805 return scm_delq_x (item
, copy
);
809 SCM_DEFINE (scm_delv
, "delv", 2, 0, 0,
811 "Return a newly-created copy of @var{lst} with elements\n"
812 "@code{eqv?} to @var{item} removed. This procedure mirrors\n"
813 "@code{memv}: @code{delv} compares elements of @var{lst} against\n"
814 "@var{item} with @code{eqv?}.")
815 #define FUNC_NAME s_scm_delv
817 SCM copy
= scm_list_copy (lst
);
818 return scm_delv_x (item
, copy
);
822 SCM_DEFINE (scm_delete
, "delete", 2, 0, 0,
824 "Return a newly-created copy of @var{lst} with elements\n"
825 "@code{equal?} to @var{item} removed. This procedure mirrors\n"
826 "@code{member}: @code{delete} compares elements of @var{lst}\n"
827 "against @var{item} with @code{equal?}.")
828 #define FUNC_NAME s_scm_delete
830 SCM copy
= scm_list_copy (lst
);
831 return scm_delete_x (item
, copy
);
836 SCM_DEFINE (scm_delq1_x
, "delq1!", 2, 0, 0,
838 "Like @code{delq!}, but only deletes the first occurrence of\n"
839 "@var{item} from @var{lst}. Tests for equality using\n"
840 "@code{eq?}. See also @code{delv1!} and @code{delete1!}.")
841 #define FUNC_NAME s_scm_delq1_x
846 for (prev
= &lst
, walk
= lst
;
848 walk
= SCM_CDR (walk
))
850 if (scm_is_eq (SCM_CAR (walk
), item
))
852 *prev
= SCM_CDR (walk
);
856 prev
= SCM_CDRLOC (walk
);
864 SCM_DEFINE (scm_delv1_x
, "delv1!", 2, 0, 0,
866 "Like @code{delv!}, but only deletes the first occurrence of\n"
867 "@var{item} from @var{lst}. Tests for equality using\n"
868 "@code{eqv?}. See also @code{delq1!} and @code{delete1!}.")
869 #define FUNC_NAME s_scm_delv1_x
874 for (prev
= &lst
, walk
= lst
;
876 walk
= SCM_CDR (walk
))
878 if (! scm_is_false (scm_eqv_p (SCM_CAR (walk
), item
)))
880 *prev
= SCM_CDR (walk
);
884 prev
= SCM_CDRLOC (walk
);
892 SCM_DEFINE (scm_delete1_x
, "delete1!", 2, 0, 0,
894 "Like @code{delete!}, but only deletes the first occurrence of\n"
895 "@var{item} from @var{lst}. Tests for equality using\n"
896 "@code{equal?}. See also @code{delq1!} and @code{delv1!}.")
897 #define FUNC_NAME s_scm_delete1_x
902 for (prev
= &lst
, walk
= lst
;
904 walk
= SCM_CDR (walk
))
906 if (! scm_is_false (scm_equal_p (SCM_CAR (walk
), item
)))
908 *prev
= SCM_CDR (walk
);
912 prev
= SCM_CDRLOC (walk
);
919 SCM_DEFINE (scm_filter
, "filter", 2, 0, 0,
920 (SCM pred
, SCM list
),
921 "Return all the elements of 2nd arg @var{list} that satisfy predicate @var{pred}.\n"
922 "The list is not disordered -- elements that appear in the result list occur\n"
923 "in the same order as they occur in the argument list. The returned list may\n"
924 "share a common tail with the argument list. The dynamic order in which the\n"
925 "various applications of pred are made is not specified.\n\n"
927 "(filter even? '(0 7 8 8 43 -4)) => (0 8 8 -4)\n"
929 #define FUNC_NAME s_scm_filter
934 SCM_ASSERT (scm_is_true (scm_procedure_p (pred
)), pred
, 1, FUNC_NAME
);
935 SCM_VALIDATE_LIST (2, list
);
937 for (prev
= &res
, walk
= list
;
939 walk
= SCM_CDR (walk
))
941 if (scm_is_true (scm_call_1 (pred
, SCM_CAR (walk
))))
943 *prev
= scm_cons (SCM_CAR (walk
), SCM_EOL
);
944 prev
= SCM_CDRLOC (*prev
);
952 SCM_DEFINE (scm_filter_x
, "filter!", 2, 0, 0,
953 (SCM pred
, SCM list
),
954 "Linear-update variant of @code{filter}.")
955 #define FUNC_NAME s_scm_filter_x
959 SCM_ASSERT (scm_is_true (scm_procedure_p (pred
)), pred
, 1, FUNC_NAME
);
960 SCM_VALIDATE_LIST (2, list
);
962 for (prev
= &list
, walk
= list
;
964 walk
= SCM_CDR (walk
))
966 if (scm_is_true (scm_call_1 (pred
, SCM_CAR (walk
))))
967 prev
= SCM_CDRLOC (walk
);
969 *prev
= SCM_CDR (walk
);
980 #include "libguile/list.x"