aboutsummaryrefslogtreecommitdiffstats
path: root/srfi-1.txi
blob: 4849703be2a3e9dbc8b6cf1d11874c05adea0fd7 (plain)
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
@code{(require 'srfi-1)}
@ftindex srfi-1

@noindent
Implements the @dfn{SRFI-1} @dfn{list-processing library} as described
@cindex SRFI-1
@cindex list-processing library
at @url{http://srfi.schemers.org/srfi-1/srfi-1.html}

@subheading Constructors


@defun xcons d a

 @code{(define (xcons d a) (cons a d))}.
@end defun


@defun list-tabulate len proc

 Returns a list of length @var{len}.  Element @var{i} is
@code{(@var{proc} @var{i})} for 0 <= @var{i} < @var{len}.
@end defun


@defun cons* obj1 obj2

@end defun


@defun list-copy flist

@end defun


@defun iota count start step


@defunx iota count start

@defunx iota count
Returns a list of @var{count} numbers: (@var{start}, @var{start}+@var{step}, @dots{},  @var{start}+(@var{count}-1)*@var{step}).
@end defun


@defun circular-list obj1 obj2 @dots{}

Returns a circular list of @var{obj1}, @var{obj2}, @dots{}.
@end defun

@subheading Predicates


@defun proper-list? obj

@end defun


@defun circular-list? x

@end defun


@defun dotted-list? obj

@end defun


@defun null-list? obj

@end defun


@defun not-pair? obj

@end defun


@defun list= =pred list @dots{}

@end defun

@subheading Selectors


@defun first pair

@end defun


@defun second pair

@end defun


@defun third pair

@end defun


@defun fourth pair

@end defun


@defun fifth pair
@defunx sixth pair
@defunx seventh pair
@defunx eighth pair
@defunx ninth pair
@defunx tenth pair

@end defun


@defun car+cdr pair

@end defun


@defun drop lst k
@defunx take lst k
@defunx take! lst k

@end defun


@defun take-right lst k

@end defun


@defun drop-right lst k

@end defun


@deffn {Procedure} drop-right! lst k

@end deffn


@defun split-at lst k
@defunx split-at! lst k

@end defun


@defun last lst k @dots{}

@end defun

@subheading Miscellaneous


@defun length+ clist

@end defun


@defun concatenate lists
@defunx concatenate! lists

@end defun


@deffn {Procedure} reverse! lst

@end deffn


@defun append-reverse rev-head tail
@defunx append-reverse! rev-head tail

@end defun


@defun zip list1 list2 @dots{}

@end defun


@defun unzip1 lst
@defunx unzip2 lst
@defunx unzip3 lst
@defunx unzip4 lst
@defunx unzip5 lst

@end defun


@defun count pred list1 list2 @dots{}

@end defun

@subheading Fold and Unfold


@defun fold kons knil clist1 clist2 @dots{}

@end defun


@defun fold-right kons knil clist1 clist2 @dots{}

@end defun


@defun pair-fold kons knil clist1 clist2 @dots{}

@end defun


@defun pair-fold-right kons knil clist1 clist2 @dots{}

@end defun


@defun reduce f ridentity list
@defunx reduce-right f ridentity list

@end defun


@deffn {Procedure} map! f clist1 clist2 @dots{}

@end deffn


@defun pair-for-each f clist1 clist2 @dots{}

@end defun

@subheading Filtering and Partitioning


@defun filter pred list

@end defun


@deffn {Procedure} filter! pred list

@end deffn


@defun partition pred list

@end defun


@defun remove pred list

@end defun


@deffn {Procedure} partition! pred list

@end deffn


@deffn {Procedure} remove! pred list

@end deffn

@subheading Searching


@defun find pred clist

@end defun


@defun find-tail pred clist

@end defun


@defun span pred list

@end defun


@deffn {Procedure} span! pred list

@end deffn


@defun break pred list

@end defun


@deffn {Procedure} break! pred list

@end deffn


@defun any pred clist1 clist2 @dots{}

@end defun


@defun list-index pred clist1 clist2 @dots{}

@end defun


@defun member obj list =


@defunx member obj list
@end defun

@subheading Deleting


@defun delete-duplicates x list =


@defunx delete-duplicates x list
@end defun


@deffn {Procedure} delete-duplicates! x list =


@deffnx {Procedure} delete-duplicates! x list
@end deffn

@subheading Association lists


@defun assoc obj alist pred


@defunx assoc obj alist
@end defun


@defun alist-cons key datum alist

@end defun


@defun alist-copy alist

@end defun


@defun alist-delete key alist =


@defunx alist-delete key alist
@end defun


@deffn {Procedure} alist-delete! key alist =


@deffnx {Procedure} alist-delete! key alist
@end deffn

@subheading Set operations


@defun lset<= = list1 @dots{}

Determine if a  transitive subset relation exists between the lists @var{list1}
@dots{}, using @var{=} to determine equality of list members.
@end defun


@defun lset= = list1 list2 @dots{}

@end defun


@defun lset-adjoin list elt1 @dots{}

@end defun


@defun lset-union = list1 @dots{}

@end defun


@defun lset-intersection = list1 list2 @dots{}

@end defun


@defun lset-difference = list1 list2 @dots{}

@end defun


@defun lset-xor = list1 @dots{}

@end defun


@defun lset-diff+intersection = list1 list2 @dots{}

@end defun

@noindent
These are linear-update variants.  They are allowed, but not
required, to use the cons cells in their first list parameter to
construct their answer.  @code{lset-union!} is permitted to recycle
cons cells from any of its list arguments.


@deffn {Procedure} lset-intersection! = list1 list2 @dots{}

@end deffn


@deffn {Procedure} lset-difference! = list1 list2 @dots{}

@end deffn


@deffn {Procedure} lset-union! = list1 @dots{}

@end deffn


@deffn {Procedure} lset-xor! = list1 @dots{}

@end deffn


@deffn {Procedure} lset-diff+intersection! = list1 list2 @dots{}

@end deffn