3 ;; Copyright (C) 2001 Free Software Foundation, Inc.
5 ;; This program is free software; you can redistribute it and/or modify
6 ;; it under the terms of the GNU General Public License as published by
7 ;; the Free Software Foundation; either version 2, or (at your option)
10 ;; This program is distributed in the hope that it will be useful,
11 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
12 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 ;; GNU General Public License for more details.
15 ;; You should have received a copy of the GNU General Public License
16 ;; along with this program; see the file COPYING. If not, write to
17 ;; the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 ;; Boston, MA 02111-1307, USA.
22 (define-module (language elisp runtime function-slot)
23 #:use-module (language elisp runtime))
25 ; This module contains the function-slots of elisp symbols. Elisp built-in
26 ; functions are implemented as predefined function bindings here.
29 ; Equivalence and equalness predicates.
31 (built-in-func eq (lambda (a b)
32 (elisp-bool (eq? a b))))
34 (built-in-func equal (lambda (a b)
35 (elisp-bool (equal? a b))))
40 (built-in-func floatp (lambda (num)
41 (elisp-bool (and (real? num)
43 (prim not (integer? num)))))))
45 (built-in-func integerp (lambda (num)
46 (elisp-bool (and (exact? num)
49 (built-in-func numberp (lambda (num)
50 (elisp-bool (real? num))))
52 (built-in-func wholenump (lambda (num)
53 (elisp-bool (and (exact? num)
57 (built-in-func zerop (lambda (num)
58 (elisp-bool (prim = num 0))))
63 (built-in-func = (lambda (num1 num2)
64 (elisp-bool (prim = num1 num2))))
65 (built-in-func /= (lambda (num1 num2)
66 (elisp-bool (prim not (prim = num1 num2)))))
68 (built-in-func < (lambda (num1 num2)
69 (elisp-bool (prim < num1 num2))))
70 (built-in-func <= (lambda (num1 num2)
71 (elisp-bool (prim <= num1 num2))))
72 (built-in-func > (lambda (num1 num2)
73 (elisp-bool (prim > num1 num2))))
74 (built-in-func >= (lambda (num1 num2)
75 (elisp-bool (prim >= num1 num2))))
77 (built-in-func max (lambda (. nums)
78 (prim apply (@ (guile) max) nums)))
79 (built-in-func min (lambda (. nums)
80 (prim apply (@ (guile) min) nums)))
82 (built-in-func abs (@ (guile) abs))
87 (built-in-func float (lambda (num)
92 ; TODO: truncate, floor, ceiling, round.
95 ; Arithmetic functions.
97 (built-in-func 1+ (@ (guile) 1+))
98 (built-in-func 1- (@ (guile) 1-))
99 (built-in-func + (@ (guile) +))
100 (built-in-func - (@ (guile) -))
101 (built-in-func * (@ (guile) *))
102 (built-in-func % (@ (guile) modulo))
104 ; TODO: / with correct integer/real behaviour, mod (for floating-piont values).
107 ; Floating-point rounding operations.
109 (built-in-func ffloor (@ (guile) floor))
110 (built-in-func fceiling (@ (guile) ceiling))
111 (built-in-func ftruncate (@ (guile) truncate))
112 (built-in-func fround (@ (guile) round))
119 (elisp-bool (pair? el))))
122 (elisp-bool (prim not (pair? el)))))
126 (elisp-bool (or (pair? el) (null? el)))))
127 (built-in-func nlistp
129 (elisp-bool (and (prim not (pair? el))
130 (prim not (null? el))))))
134 (elisp-bool (null? el))))
137 ; Accessing list elements.
150 (built-in-func car-safe
155 (built-in-func cdr-safe
168 ((null? tail) nil-value)
169 ((zero? i) (prim car tail))
170 (else (iterate (prim 1- i) (prim cdr tail))))))))
171 (built-in-func nthcdr
178 ((null? tail) nil-value)
180 (else (iterate (prim 1- i) (prim cdr tail))))))))
185 (built-in-func cons (@ (guile) cons))
186 (built-in-func list (@ (guile) list))
187 (built-in-func make-list
189 (prim make-list len obj)))
191 (built-in-func append (@ (guile) append))
192 (built-in-func reverse (@ (guile) reverse))
193 (built-in-func copy-tree (@ (guile) copy-tree))
195 (built-in-func number-sequence
196 (lambda (from . rest)
197 (if (prim > (prim length rest) 2)
198 (runtime-error "too many arguments for number-sequence"
202 (let ((to (prim car rest))
203 (sep (if (or (null? (prim cdr rest))
204 (eq? nil-value (prim cadr rest)))
208 ((or (eq? nil-value to) (prim = to from)) `(,from))
209 ((and (zero? sep) (prim not (prim = from to)))
210 (runtime-error "infinite list in number-sequence"))
211 ((prim < (prim * to sep) (prim * from sep)) '())
213 (let iterate ((i (prim +
217 (prim abs (prim - to from))
222 (iterate (prim - i sep) (prim cons i result)))))))))))
227 (built-in-func setcar
229 (prim set-car! cell val)
232 (built-in-func setcdr
234 (prim set-cdr! cell val)
240 (built-in-func not (lambda (x)
241 (if x nil-value t-value)))