File size: 25,579 Bytes
3dcad1f |
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 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 |
/* Copyright 1995-1997,2000-2001,2003-2004,2008-2011,2014,2018
Free Software Foundation, Inc.
This file is part of Guile.
Guile is free software: you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Guile is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public
License along with Guile. If not, see
<https://www.gnu.org/licenses/>. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdarg.h>
#include "boolean.h"
#include "eq.h"
#include "eval.h"
#include "gsubr.h"
#include "numbers.h"
#include "pairs.h"
#include "procs.h"
#include "list.h"
/* creating lists */
#define SCM_I_CONS(cell, x, y) \
do { \
cell = scm_cell (SCM_UNPACK (x), SCM_UNPACK (y)); \
} while (0)
SCM
scm_list_1 (SCM e1)
{
SCM c1;
SCM_I_CONS (c1, e1, SCM_EOL);
return c1;
}
SCM
scm_list_2 (SCM e1, SCM e2)
{
SCM c1, c2;
SCM_I_CONS (c2, e2, SCM_EOL);
SCM_I_CONS (c1, e1, c2);
return c1;
}
SCM
scm_list_3 (SCM e1, SCM e2, SCM e3)
{
SCM c1, c2, c3;
SCM_I_CONS (c3, e3, SCM_EOL);
SCM_I_CONS (c2, e2, c3);
SCM_I_CONS (c1, e1, c2);
return c1;
}
SCM
scm_list_4 (SCM e1, SCM e2, SCM e3, SCM e4)
{
return scm_cons2 (e1, e2, scm_list_2 (e3, e4));
}
SCM
scm_list_5 (SCM e1, SCM e2, SCM e3, SCM e4, SCM e5)
{
return scm_cons2 (e1, e2, scm_list_3 (e3, e4, e5));
}
SCM
scm_list_n (SCM elt, ...)
{
va_list foo;
SCM answer = SCM_EOL;
SCM *pos = &answer;
va_start (foo, elt);
while (! SCM_UNBNDP (elt))
{
*pos = scm_cons (elt, SCM_EOL);
pos = SCM_CDRLOC (*pos);
elt = va_arg (foo, SCM);
}
va_end (foo);
return answer;
}
SCM_DEFINE (scm_make_list, "make-list", 1, 1, 0,
(SCM n, SCM init),
"Create a list containing of @var{n} elements, where each\n"
"element is initialized to @var{init}. @var{init} defaults to\n"
"the empty list @code{()} if not given.")
#define FUNC_NAME s_scm_make_list
{
unsigned nn = scm_to_uint (n);
unsigned i;
SCM ret = SCM_EOL;
if (SCM_UNBNDP (init))
init = SCM_EOL;
for (i = 0; i < nn; i++)
ret = scm_cons (init, ret);
return ret;
}
#undef FUNC_NAME
SCM_DEFINE (scm_cons_star, "cons*", 1, 0, 1,
(SCM arg, SCM rest),
"Like @code{list}, but the last arg provides the tail of the\n"
"constructed list, returning @code{(cons @var{arg1} (cons\n"
"@var{arg2} (cons @dots{} @var{argn})))}. Requires at least one\n"
"argument. If given one argument, that argument is returned as\n"
"result. This function is called @code{list*} in some other\n"
"Schemes and in Common LISP.")
#define FUNC_NAME s_scm_cons_star
{
SCM ret = SCM_EOL;
SCM *p = &ret;
SCM_VALIDATE_REST_ARGUMENT (rest);
for ( ; scm_is_pair (rest); rest = SCM_CDR (rest))
{
*p = scm_cons (arg, SCM_EOL);
p = SCM_CDRLOC (*p);
arg = SCM_CAR (rest);
}
*p = arg;
return ret;
}
#undef FUNC_NAME
/* general questions about lists --- null?, list?, length, etc. */
SCM_DEFINE (scm_null_p, "null?", 1, 0, 0,
(SCM x),
"Return @code{#t} iff @var{x} is the empty list, else @code{#f}.")
#define FUNC_NAME s_scm_null_p
{
return scm_from_bool (SCM_NULL_OR_NIL_P (x));
}
#undef FUNC_NAME
SCM_DEFINE (scm_list_p, "list?", 1, 0, 0,
(SCM x),
"Return @code{#t} iff @var{x} is a proper list, else @code{#f}.")
#define FUNC_NAME s_scm_list_p
{
return scm_from_bool (scm_ilength (x) >= 0);
}
#undef FUNC_NAME
/* Return the length of SX, or -1 if it's not a proper list.
This uses the "tortoise and hare" algorithm to detect "infinitely
long" lists (i.e. lists with cycles in their cdrs), and returns -1
if it does find one. */
long
scm_ilength (SCM sx)
{
long i = 0;
SCM tortoise = sx;
SCM hare = sx;
do
{
if (!scm_is_pair (hare))
return SCM_NULL_OR_NIL_P (hare) ? i : -1;
hare = SCM_CDR (hare);
i++;
if (!scm_is_pair (hare))
return SCM_NULL_OR_NIL_P (hare) ? i : -1;
hare = SCM_CDR (hare);
i++;
/* For every two steps the hare takes, the tortoise takes one. */
tortoise = SCM_CDR (tortoise);
}
while (!scm_is_eq (hare, tortoise));
/* If the tortoise ever catches the hare, then the list must contain
a cycle. */
return -1;
}
SCM_DEFINE (scm_length, "length", 1, 0, 0,
(SCM lst),
"Return the number of elements in list @var{lst}.")
#define FUNC_NAME s_scm_length
{
long i;
SCM_VALIDATE_LIST_COPYLEN (1, lst, i);
return scm_from_long (i);
}
#undef FUNC_NAME
/* appending lists */
SCM_DEFINE (scm_append, "append", 0, 0, 1,
(SCM args),
"Return a list consisting of the elements of the lists passed as\n"
"arguments.\n"
"@lisp\n"
"(append '(x) '(y)) @result{} (x y)\n"
"(append '(a) '(b c d)) @result{} (a b c d)\n"
"(append '(a (b)) '((c))) @result{} (a (b) (c))\n"
"@end lisp\n"
"The resulting list is always newly allocated, except that it\n"
"shares structure with the last list argument. The last\n"
"argument may actually be any object; an improper list results\n"
"if the last argument is not a proper list.\n"
"@lisp\n"
"(append '(a b) '(c . d)) @result{} (a b c . d)\n"
"(append '() 'a) @result{} a\n"
"@end lisp")
#define FUNC_NAME s_scm_append
{
SCM_VALIDATE_REST_ARGUMENT (args);
if (scm_is_null (args)) {
return SCM_EOL;
} else {
SCM res = SCM_EOL;
SCM *lloc = &res;
SCM arg = SCM_CAR (args);
int argnum = 1;
args = SCM_CDR (args);
while (!scm_is_null (args)) {
while (scm_is_pair (arg)) {
*lloc = scm_cons (SCM_CAR (arg), SCM_EOL);
lloc = SCM_CDRLOC (*lloc);
arg = SCM_CDR (arg);
}
SCM_VALIDATE_NULL_OR_NIL (argnum, arg);
arg = SCM_CAR (args);
args = SCM_CDR (args);
argnum++;
};
*lloc = arg;
return res;
}
}
#undef FUNC_NAME
SCM_DEFINE (scm_append_x, "append!", 0, 0, 1,
(SCM args),
"A destructive version of @code{append} (@pxref{Pairs and\n"
"Lists,,,r5rs, The Revised^5 Report on Scheme}). The cdr field\n"
"of each list's final pair is changed to point to the head of\n"
"the next list, so no consing is performed. Return\n"
"the mutated list.")
#define FUNC_NAME s_scm_append_x
{
SCM ret, *loc;
int argnum = 1;
SCM_VALIDATE_REST_ARGUMENT (args);
if (scm_is_null (args))
return SCM_EOL;
loc = &ret;
for (;;)
{
SCM arg = SCM_CAR (args);
*loc = arg;
args = SCM_CDR (args);
if (scm_is_null (args))
return ret;
if (!SCM_NULL_OR_NIL_P (arg))
{
SCM_VALIDATE_CONS (argnum, arg);
loc = SCM_CDRLOC (scm_last_pair (arg));
SCM_VALIDATE_NULL_OR_NIL (argnum, *loc);
}
argnum++;
}
}
#undef FUNC_NAME
SCM_DEFINE (scm_last_pair, "last-pair", 1, 0, 0,
(SCM lst),
"Return the last pair in @var{lst}, signaling an error if\n"
"@var{lst} is circular.")
#define FUNC_NAME s_scm_last_pair
{
SCM tortoise = lst;
SCM hare = lst;
if (SCM_NULL_OR_NIL_P (lst))
return lst;
SCM_VALIDATE_CONS (SCM_ARG1, lst);
do {
SCM ahead = SCM_CDR(hare);
if (!scm_is_pair (ahead)) return hare;
hare = ahead;
ahead = SCM_CDR(hare);
if (!scm_is_pair (ahead)) return hare;
hare = ahead;
tortoise = SCM_CDR(tortoise);
}
while (!scm_is_eq (hare, tortoise));
SCM_MISC_ERROR ("Circular structure in position 1: ~S", scm_list_1 (lst));
}
#undef FUNC_NAME
/* reversing lists */
SCM_DEFINE (scm_reverse, "reverse", 1, 0, 0,
(SCM lst),
"Return a new list that contains the elements of @var{lst} but\n"
"in reverse order.")
#define FUNC_NAME s_scm_reverse
{
SCM result = SCM_EOL;
SCM tortoise = lst;
SCM hare = lst;
do {
if (SCM_NULL_OR_NIL_P(hare)) return result;
SCM_ASSERT(scm_is_pair(hare), lst, 1, FUNC_NAME);
result = scm_cons (SCM_CAR (hare), result);
hare = SCM_CDR (hare);
if (SCM_NULL_OR_NIL_P(hare)) return result;
SCM_ASSERT(scm_is_pair(hare), lst, 1, FUNC_NAME);
result = scm_cons (SCM_CAR (hare), result);
hare = SCM_CDR (hare);
tortoise = SCM_CDR (tortoise);
}
while (!scm_is_eq (hare, tortoise));
SCM_MISC_ERROR ("Circular structure in position 1: ~S", scm_list_1 (lst));
}
#undef FUNC_NAME
SCM_DEFINE (scm_reverse_x, "reverse!", 1, 1, 0,
(SCM lst, SCM new_tail),
"A destructive version of @code{reverse} (@pxref{Pairs and Lists,,,r5rs,\n"
"The Revised^5 Report on Scheme}). The cdr of each cell in @var{lst} is\n"
"modified to point to the previous list element. Return the\n"
"reversed list.\n\n"
"Caveat: because the list is modified in place, the tail of the original\n"
"list now becomes its head, and the head of the original list now becomes\n"
"the tail. Therefore, the @var{lst} symbol to which the head of the\n"
"original list was bound now points to the tail. To ensure that the head\n"
"of the modified list is not lost, it is wise to save the return value of\n"
"@code{reverse!}")
#define FUNC_NAME s_scm_reverse_x
{
SCM old_lst = lst;
SCM tail = SCM_BOOL_F;
if (SCM_UNBNDP (new_tail))
new_tail = SCM_EOL;
if (SCM_NULL_OR_NIL_P (lst))
return new_tail;
/* SCM_VALIDATE_LIST would run through the whole list to make sure it
is not eventually circular. In contrast to most list operations,
reverse! cannot get stuck in an infinite loop but arrives back at
the start when given an eventually or fully circular list. Because
of that, we can save the cost of an upfront proper list check at
the price of having to do a double reversal in the error case.
*/
while (scm_is_pair (lst))
{
SCM old_tail = SCM_CDR (lst);
scm_set_cdr_x (lst, tail);
tail = lst;
lst = old_tail;
}
if (SCM_LIKELY (SCM_NULL_OR_NIL_P (lst)))
{
scm_set_cdr_x (old_lst, new_tail);
return tail;
}
/* We did not start with a proper list. Undo the reversal. */
while (scm_is_pair (tail))
{
SCM old_tail = SCM_CDR (tail);
SCM_SETCDR (tail, lst);
lst = tail;
tail = old_tail;
}
SCM_WRONG_TYPE_ARG (1, lst);
return lst;
}
#undef FUNC_NAME
/* indexing lists by element number */
SCM_DEFINE (scm_list_ref, "list-ref", 2, 0, 0,
(SCM list, SCM k),
"Return the @var{k}th element from @var{list}.")
#define FUNC_NAME s_scm_list_ref
{
SCM lst = list;
unsigned long int i;
i = scm_to_ulong (k);
while (scm_is_pair (lst)) {
if (i == 0)
return SCM_CAR (lst);
else {
--i;
lst = SCM_CDR (lst);
}
};
if (SCM_NULL_OR_NIL_P (lst))
SCM_OUT_OF_RANGE (2, k);
else
SCM_WRONG_TYPE_ARG (1, list);
}
#undef FUNC_NAME
SCM_DEFINE (scm_list_set_x, "list-set!", 3, 0, 0,
(SCM list, SCM k, SCM val),
"Set the @var{k}th element of @var{list} to @var{val}.")
#define FUNC_NAME s_scm_list_set_x
{
SCM lst = list;
unsigned long int i = scm_to_ulong (k);
while (scm_is_pair (lst)) {
if (i == 0) {
scm_set_car_x (lst, val);
return val;
} else {
--i;
lst = SCM_CDR (lst);
}
};
if (SCM_NULL_OR_NIL_P (lst))
SCM_OUT_OF_RANGE (2, k);
else
SCM_WRONG_TYPE_ARG (1, list);
}
#undef FUNC_NAME
SCM_REGISTER_PROC(s_list_cdr_ref, "list-cdr-ref", 2, 0, 0, scm_list_tail);
SCM_DEFINE (scm_list_tail, "list-tail", 2, 0, 0,
(SCM lst, SCM k),
"@deffnx {Scheme Procedure} list-cdr-ref lst k\n"
"Return the \"tail\" of @var{lst} beginning with its @var{k}th element.\n"
"The first element of the list is considered to be element 0.\n\n"
"@code{list-tail} and @code{list-cdr-ref} are identical. It may help to\n"
"think of @code{list-cdr-ref} as accessing the @var{k}th cdr of the list,\n"
"or returning the results of cdring @var{k} times down @var{lst}.")
#define FUNC_NAME s_scm_list_tail
{
size_t i = scm_to_size_t (k);
while (i-- > 0) {
SCM_VALIDATE_CONS (1, lst);
lst = SCM_CDR(lst);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_list_cdr_set_x, "list-cdr-set!", 3, 0, 0,
(SCM list, SCM k, SCM val),
"Set the @var{k}th cdr of @var{list} to @var{val}.")
#define FUNC_NAME s_scm_list_cdr_set_x
{
SCM lst = list;
size_t i = scm_to_size_t (k);
while (scm_is_pair (lst)) {
if (i == 0) {
scm_set_cdr_x (lst, val);
return val;
} else {
--i;
lst = SCM_CDR (lst);
}
};
if (SCM_NULL_OR_NIL_P (lst))
SCM_OUT_OF_RANGE (2, k);
else
SCM_WRONG_TYPE_ARG (1, list);
}
#undef FUNC_NAME
/* copying lists, perhaps partially */
SCM_DEFINE (scm_list_head, "list-head", 2, 0, 0,
(SCM lst, SCM k),
"Copy the first @var{k} elements from @var{lst} into a new list, and\n"
"return it.")
#define FUNC_NAME s_scm_list_head
{
SCM answer;
SCM * pos;
size_t i = scm_to_size_t (k);
answer = SCM_EOL;
pos = &answer;
while (i-- > 0)
{
SCM_VALIDATE_CONS (1, lst);
*pos = scm_cons (SCM_CAR (lst), SCM_EOL);
pos = SCM_CDRLOC (*pos);
lst = SCM_CDR(lst);
}
return answer;
}
#undef FUNC_NAME
/* Copy a list which is known to be finite. The last pair may or may not have
* a '() in its cdr. That is, improper lists are accepted. */
SCM
scm_i_finite_list_copy (SCM list)
{
if (!scm_is_pair (list))
{
return list;
}
else
{
SCM tail;
const SCM result = tail = scm_list_1 (SCM_CAR (list));
list = SCM_CDR (list);
while (scm_is_pair (list))
{
const SCM new_tail = scm_list_1 (SCM_CAR (list));
SCM_SETCDR (tail, new_tail);
tail = new_tail;
list = SCM_CDR (list);
}
SCM_SETCDR (tail, list);
return result;
}
}
SCM_DEFINE (scm_list_copy, "list-copy", 1, 0, 0,
(SCM lst),
"Return a (newly-created) copy of @var{lst}.")
#define FUNC_NAME s_scm_list_copy
{
SCM newlst;
SCM * fill_here;
SCM from_here;
SCM_VALIDATE_LIST (1, lst);
newlst = SCM_EOL;
fill_here = &newlst;
from_here = lst;
while (scm_is_pair (from_here))
{
SCM c;
c = scm_cons (SCM_CAR (from_here), SCM_CDR (from_here));
*fill_here = c;
fill_here = SCM_CDRLOC (c);
from_here = SCM_CDR (from_here);
}
return newlst;
}
#undef FUNC_NAME
SCM_PROC (s_list, "list", 0, 0, 1, scm_list_copy);
SCM_SNARF_DOCS (primitive, scm_list_copy, "list", (SCM objs), 0, 0, 1,
"Return a list containing @var{objs}, the arguments to\n"
"@code{list}.")
/* This used to be the code for "list", but it's wrong when used via apply
(it should copy the list). It seems pretty unlikely anyone would have
been using this from C code, since it's a no-op, but keep it for strict
binary compatibility. */
SCM
scm_list (SCM objs)
{
return objs;
}
/* membership tests (memq, memv, etc.) */
/* The function scm_c_memq returns the first sublist of list whose car is
* 'eq?' obj, where the sublists of list are the non-empty lists returned by
* (list-tail list k) for k less than the length of list. If obj does not
* occur in list, then #f (not the empty list) is returned.
* List must be a proper list, otherwise scm_c_memq may crash or loop
* endlessly.
*/
SCM
scm_c_memq (SCM obj, SCM list)
{
for (; !SCM_NULL_OR_NIL_P (list); list = SCM_CDR (list))
{
if (scm_is_eq (SCM_CAR (list), obj))
return list;
}
return SCM_BOOL_F;
}
SCM_DEFINE (scm_memq, "memq", 2, 0, 0,
(SCM x, SCM lst),
"Return the first sublist of @var{lst} whose car is @code{eq?}\n"
"to @var{x} where the sublists of @var{lst} are the non-empty\n"
"lists returned by @code{(list-tail @var{lst} @var{k})} for\n"
"@var{k} less than the length of @var{lst}. If @var{x} does not\n"
"occur in @var{lst}, then @code{#f} (not the empty list) is\n"
"returned.")
#define FUNC_NAME s_scm_memq
{
SCM hare = lst, tortoise = lst;
while (scm_is_pair (hare))
{
if (scm_is_eq (SCM_CAR (hare), x))
return hare;
else
hare = SCM_CDR (hare);
if (!scm_is_pair (hare))
break;
if (scm_is_eq (SCM_CAR (hare), x))
return hare;
else
hare = SCM_CDR (hare);
tortoise = SCM_CDR (tortoise);
if (SCM_UNLIKELY (scm_is_eq (hare, tortoise)))
break;
}
if (SCM_LIKELY (scm_is_null (hare)))
return SCM_BOOL_F;
else
scm_wrong_type_arg_msg (FUNC_NAME, 2, lst, "list");
}
#undef FUNC_NAME
SCM_DEFINE (scm_memv, "memv", 2, 0, 0,
(SCM x, SCM lst),
"Return the first sublist of @var{lst} whose car is @code{eqv?}\n"
"to @var{x} where the sublists of @var{lst} are the non-empty\n"
"lists returned by @code{(list-tail @var{lst} @var{k})} for\n"
"@var{k} less than the length of @var{lst}. If @var{x} does not\n"
"occur in @var{lst}, then @code{#f} (not the empty list) is\n"
"returned.")
#define FUNC_NAME s_scm_memv
{
SCM hare = lst, tortoise = lst;
while (scm_is_pair (hare))
{
if (scm_is_true (scm_eqv_p (SCM_CAR (hare), x)))
return hare;
else
hare = SCM_CDR (hare);
if (!scm_is_pair (hare))
break;
if (scm_is_true (scm_eqv_p (SCM_CAR (hare), x)))
return hare;
else
hare = SCM_CDR (hare);
tortoise = SCM_CDR (tortoise);
if (SCM_UNLIKELY (scm_is_eq (hare, tortoise)))
break;
}
if (SCM_LIKELY (scm_is_null (hare)))
return SCM_BOOL_F;
else
scm_wrong_type_arg_msg (FUNC_NAME, 2, lst, "list");
}
#undef FUNC_NAME
SCM_DEFINE (scm_member, "member", 2, 0, 0,
(SCM x, SCM lst),
"Return the first sublist of @var{lst} whose car is\n"
"@code{equal?} to @var{x} where the sublists of @var{lst} are\n"
"the non-empty lists returned by @code{(list-tail @var{lst}\n"
"@var{k})} for @var{k} less than the length of @var{lst}. If\n"
"@var{x} does not occur in @var{lst}, then @code{#f} (not the\n"
"empty list) is returned.")
#define FUNC_NAME s_scm_member
{
SCM_VALIDATE_LIST (2, lst);
for (; !SCM_NULL_OR_NIL_P (lst); lst = SCM_CDR (lst))
{
if (! scm_is_false (scm_equal_p (SCM_CAR (lst), x)))
return lst;
}
return SCM_BOOL_F;
}
#undef FUNC_NAME
/* deleting elements from a list (delq, etc.) */
SCM_DEFINE (scm_delq_x, "delq!", 2, 0, 0,
(SCM item, SCM lst),
"@deffnx {Scheme Procedure} delv! item lst\n"
"@deffnx {Scheme Procedure} delete! item lst\n"
"These procedures are destructive versions of @code{delq}, @code{delv}\n"
"and @code{delete}: they modify the existing @var{lst}\n"
"rather than creating a new list. Caveat evaluator: Like other\n"
"destructive list functions, these functions cannot modify the binding of\n"
"@var{lst}, and so cannot be used to delete the first element of\n"
"@var{lst} destructively.")
#define FUNC_NAME s_scm_delq_x
{
SCM walk;
SCM *prev;
for (prev = &lst, walk = lst;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (scm_is_eq (SCM_CAR (walk), item))
*prev = SCM_CDR (walk);
else
prev = SCM_CDRLOC (walk);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_delv_x, "delv!", 2, 0, 0,
(SCM item, SCM lst),
"Destructively remove all elements from @var{lst} that are\n"
"@code{eqv?} to @var{item}.")
#define FUNC_NAME s_scm_delv_x
{
SCM walk;
SCM *prev;
for (prev = &lst, walk = lst;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (! scm_is_false (scm_eqv_p (SCM_CAR (walk), item)))
*prev = SCM_CDR (walk);
else
prev = SCM_CDRLOC (walk);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_delete_x, "delete!", 2, 0, 0,
(SCM item, SCM lst),
"Destructively remove all elements from @var{lst} that are\n"
"@code{equal?} to @var{item}.")
#define FUNC_NAME s_scm_delete_x
{
SCM walk;
SCM *prev;
for (prev = &lst, walk = lst;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (! scm_is_false (scm_equal_p (SCM_CAR (walk), item)))
*prev = SCM_CDR (walk);
else
prev = SCM_CDRLOC (walk);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_delq, "delq", 2, 0, 0,
(SCM item, SCM lst),
"Return a newly-created copy of @var{lst} with elements\n"
"@code{eq?} to @var{item} removed. This procedure mirrors\n"
"@code{memq}: @code{delq} compares elements of @var{lst} against\n"
"@var{item} with @code{eq?}.")
#define FUNC_NAME s_scm_delq
{
SCM copy = scm_list_copy (lst);
return scm_delq_x (item, copy);
}
#undef FUNC_NAME
SCM_DEFINE (scm_delv, "delv", 2, 0, 0,
(SCM item, SCM lst),
"Return a newly-created copy of @var{lst} with elements\n"
"@code{eqv?} to @var{item} removed. This procedure mirrors\n"
"@code{memv}: @code{delv} compares elements of @var{lst} against\n"
"@var{item} with @code{eqv?}.")
#define FUNC_NAME s_scm_delv
{
SCM copy = scm_list_copy (lst);
return scm_delv_x (item, copy);
}
#undef FUNC_NAME
SCM_DEFINE (scm_delete, "delete", 2, 0, 0,
(SCM item, SCM lst),
"Return a newly-created copy of @var{lst} with elements\n"
"@code{equal?} to @var{item} removed. This procedure mirrors\n"
"@code{member}: @code{delete} compares elements of @var{lst}\n"
"against @var{item} with @code{equal?}.")
#define FUNC_NAME s_scm_delete
{
SCM copy = scm_list_copy (lst);
return scm_delete_x (item, copy);
}
#undef FUNC_NAME
SCM_DEFINE (scm_delq1_x, "delq1!", 2, 0, 0,
(SCM item, SCM lst),
"Like @code{delq!}, but only deletes the first occurrence of\n"
"@var{item} from @var{lst}. Tests for equality using\n"
"@code{eq?}. See also @code{delv1!} and @code{delete1!}.")
#define FUNC_NAME s_scm_delq1_x
{
SCM walk;
SCM *prev;
for (prev = &lst, walk = lst;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (scm_is_eq (SCM_CAR (walk), item))
{
*prev = SCM_CDR (walk);
break;
}
else
prev = SCM_CDRLOC (walk);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_delv1_x, "delv1!", 2, 0, 0,
(SCM item, SCM lst),
"Like @code{delv!}, but only deletes the first occurrence of\n"
"@var{item} from @var{lst}. Tests for equality using\n"
"@code{eqv?}. See also @code{delq1!} and @code{delete1!}.")
#define FUNC_NAME s_scm_delv1_x
{
SCM walk;
SCM *prev;
for (prev = &lst, walk = lst;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (! scm_is_false (scm_eqv_p (SCM_CAR (walk), item)))
{
*prev = SCM_CDR (walk);
break;
}
else
prev = SCM_CDRLOC (walk);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_delete1_x, "delete1!", 2, 0, 0,
(SCM item, SCM lst),
"Like @code{delete!}, but only deletes the first occurrence of\n"
"@var{item} from @var{lst}. Tests for equality using\n"
"@code{equal?}. See also @code{delq1!} and @code{delv1!}.")
#define FUNC_NAME s_scm_delete1_x
{
SCM walk;
SCM *prev;
for (prev = &lst, walk = lst;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (! scm_is_false (scm_equal_p (SCM_CAR (walk), item)))
{
*prev = SCM_CDR (walk);
break;
}
else
prev = SCM_CDRLOC (walk);
}
return lst;
}
#undef FUNC_NAME
SCM_DEFINE (scm_filter, "filter", 2, 0, 0,
(SCM pred, SCM list),
"Return all the elements of 2nd arg @var{list} that satisfy predicate @var{pred}.\n"
"The list is not disordered -- elements that appear in the result list occur\n"
"in the same order as they occur in the argument list. The returned list may\n"
"share a common tail with the argument list. The dynamic order in which the\n"
"various applications of pred are made is not specified.\n\n"
"@lisp\n"
"(filter even? '(0 7 8 8 43 -4)) => (0 8 8 -4)\n"
"@end lisp")
#define FUNC_NAME s_scm_filter
{
SCM walk;
SCM *prev;
SCM res = SCM_EOL;
SCM_ASSERT (scm_is_true (scm_procedure_p (pred)), pred, 1, FUNC_NAME);
SCM_VALIDATE_LIST (2, list);
for (prev = &res, walk = list;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (scm_is_true (scm_call_1 (pred, SCM_CAR (walk))))
{
*prev = scm_cons (SCM_CAR (walk), SCM_EOL);
prev = SCM_CDRLOC (*prev);
}
}
return res;
}
#undef FUNC_NAME
SCM_DEFINE (scm_filter_x, "filter!", 2, 0, 0,
(SCM pred, SCM list),
"Linear-update variant of @code{filter}.")
#define FUNC_NAME s_scm_filter_x
{
SCM walk;
SCM *prev;
SCM_ASSERT (scm_is_true (scm_procedure_p (pred)), pred, 1, FUNC_NAME);
SCM_VALIDATE_LIST (2, list);
for (prev = &list, walk = list;
scm_is_pair (walk);
walk = SCM_CDR (walk))
{
if (scm_is_true (scm_call_1 (pred, SCM_CAR (walk))))
prev = SCM_CDRLOC (walk);
else
*prev = SCM_CDR (walk);
}
return list;
}
#undef FUNC_NAME
void
scm_init_list ()
{
#include "list.x"
}
|