| 1 | /* Copyright (C) 1995,1996,1997 Free Software Foundation, Inc. |
| 2 | |
| 3 | * This program is free software; you can redistribute it and/or modify |
| 4 | * it under the terms of the GNU General Public License as published by |
| 5 | * the Free Software Foundation; either version 2, or (at your option) |
| 6 | * any later version. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 11 | * GNU General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public License |
| 14 | * along with this software; see the file COPYING. If not, write to |
| 15 | * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, |
| 16 | * Boston, MA 02111-1307 USA |
| 17 | * |
| 18 | * As a special exception, the Free Software Foundation gives permission |
| 19 | * for additional uses of the text contained in its release of GUILE. |
| 20 | * |
| 21 | * The exception is that, if you link the GUILE library with other files |
| 22 | * to produce an executable, this does not by itself cause the |
| 23 | * resulting executable to be covered by the GNU General Public License. |
| 24 | * Your use of that executable is in no way restricted on account of |
| 25 | * linking the GUILE library code into it. |
| 26 | * |
| 27 | * This exception does not however invalidate any other reasons why |
| 28 | * the executable file might be covered by the GNU General Public License. |
| 29 | * |
| 30 | * This exception applies only to the code released by the |
| 31 | * Free Software Foundation under the name GUILE. If you copy |
| 32 | * code from other Free Software Foundation releases into a copy of |
| 33 | * GUILE, as the General Public License permits, the exception does |
| 34 | * not apply to the code that you add in this way. To avoid misleading |
| 35 | * anyone as to the status of such modified files, you must delete |
| 36 | * this exception notice from them. |
| 37 | * |
| 38 | * If you write modifications of your own for GUILE, it is your choice |
| 39 | * whether to permit this exception to apply to your modifications. |
| 40 | * If you do not wish that, delete this exception notice. */ |
| 41 | \f |
| 42 | |
| 43 | /* list manipulation */ |
| 44 | |
| 45 | #include <stdio.h> |
| 46 | |
| 47 | #include <gh.h> |
| 48 | |
| 49 | /* returns the length of a list */ |
| 50 | unsigned long |
| 51 | gh_length (SCM l) |
| 52 | { |
| 53 | return gh_scm2ulong (scm_length (l)); |
| 54 | } |
| 55 | |
| 56 | /* list operations */ |
| 57 | |
| 58 | /* gh_list(SCM elt, ...) is implemented as a macro in gh.h. */ |
| 59 | |
| 60 | /* gh_append() takes a args, which is a list of lists, and appends |
| 61 | them all together into a single list, which is returned. This is |
| 62 | equivalent to the Scheme procedure (append list1 list2 ...) */ |
| 63 | SCM gh_append(SCM args) |
| 64 | { |
| 65 | return scm_append(args); |
| 66 | } |
| 67 | |
| 68 | SCM gh_append2(SCM l1, SCM l2) |
| 69 | { |
| 70 | return scm_append(scm_listify(l1, l2, SCM_UNDEFINED)); |
| 71 | } |
| 72 | |
| 73 | SCM gh_append3(SCM l1, SCM l2, SCM l3) |
| 74 | { |
| 75 | return scm_append(scm_listify(l1, l2, l3, SCM_UNDEFINED)); |
| 76 | } |
| 77 | |
| 78 | SCM gh_append4(SCM l1, SCM l2, SCM l3, SCM l4) |
| 79 | { |
| 80 | return scm_append(scm_listify(l1, l2, l3, l4, SCM_UNDEFINED)); |
| 81 | } |
| 82 | |
| 83 | /* gh_reverse() is defined as a macro in gh.h */ |
| 84 | /* gh_list_tail() is defined as a macro in gh.h */ |
| 85 | /* gh_list_ref() is defined as a macro in gh.h */ |
| 86 | /* gh_memq() is defined as a macro in gh.h */ |
| 87 | /* gh_memv() is defined as a macro in gh.h */ |
| 88 | /* gh_member() is defined as a macro in gh.h */ |
| 89 | /* gh_assq() is defined as a macro in gh.h */ |
| 90 | /* gh_assv() is defined as a macro in gh.h */ |
| 91 | /* gh_assoc() is defined as a macro in gh.h */ |
| 92 | |
| 93 | /* analogous to the Scheme cons operator */ |
| 94 | SCM |
| 95 | gh_cons (SCM x, SCM y) |
| 96 | { |
| 97 | return scm_cons (x, y); |
| 98 | } |
| 99 | |
| 100 | /* analogous to the Scheme car operator */ |
| 101 | SCM |
| 102 | gh_car (SCM x) |
| 103 | { |
| 104 | return SCM_CAR (x); |
| 105 | } |
| 106 | |
| 107 | /* analogous to the Scheme cdr operator */ |
| 108 | SCM |
| 109 | gh_cdr (SCM x) |
| 110 | { |
| 111 | return SCM_CDR (x); |
| 112 | } |
| 113 | |
| 114 | /* now for the multiple car/cdr utility procedures */ |
| 115 | SCM |
| 116 | gh_caar (SCM x) |
| 117 | { |
| 118 | return SCM_CAAR (x); |
| 119 | } |
| 120 | SCM |
| 121 | gh_cadr (SCM x) |
| 122 | { |
| 123 | return SCM_CADR (x); |
| 124 | } |
| 125 | SCM |
| 126 | gh_cdar (SCM x) |
| 127 | { |
| 128 | return SCM_CDAR (x); |
| 129 | } |
| 130 | SCM |
| 131 | gh_cddr (SCM x) |
| 132 | { |
| 133 | return SCM_CDDR (x); |
| 134 | } |
| 135 | |
| 136 | SCM |
| 137 | gh_caaar (SCM x) |
| 138 | { |
| 139 | return SCM_CAAAR (x); |
| 140 | } |
| 141 | SCM |
| 142 | gh_caadr (SCM x) |
| 143 | { |
| 144 | return SCM_CAADR (x); |
| 145 | } |
| 146 | SCM |
| 147 | gh_cadar (SCM x) |
| 148 | { |
| 149 | return SCM_CADAR (x); |
| 150 | } |
| 151 | SCM |
| 152 | gh_caddr (SCM x) |
| 153 | { |
| 154 | return SCM_CADDR (x); |
| 155 | } |
| 156 | SCM |
| 157 | gh_cdaar (SCM x) |
| 158 | { |
| 159 | return SCM_CDAAR (x); |
| 160 | } |
| 161 | SCM |
| 162 | gh_cdadr (SCM x) |
| 163 | { |
| 164 | return SCM_CDADR (x); |
| 165 | } |
| 166 | SCM |
| 167 | gh_cddar (SCM x) |
| 168 | { |
| 169 | return SCM_CDDAR (x); |
| 170 | } |
| 171 | SCM |
| 172 | gh_cdddr (SCM x) |
| 173 | { |
| 174 | return SCM_CDDDR (x); |
| 175 | } |
| 176 | |
| 177 | /* equivalent to (set-car! pair value) */ |
| 178 | SCM |
| 179 | gh_set_car_x(SCM pair, SCM value) |
| 180 | { |
| 181 | return scm_set_car_x(pair, value); |
| 182 | } |
| 183 | |
| 184 | /* equivalent to (set-cdr! pair value) */ |
| 185 | SCM |
| 186 | gh_set_cdr_x(SCM pair, SCM value) |
| 187 | { |
| 188 | return scm_set_cdr_x(pair, value); |
| 189 | } |