* Makefile.am (srfi_DATA): Added srfi-16.scm.
* srfi-16.scm: New file.
This commit is contained in:
parent
5cd06d5eaa
commit
6851c8a446
3 changed files with 130 additions and 0 deletions
|
|
@ -1,3 +1,9 @@
|
|||
2001-05-14 Martin Grabmueller <mgrabmue@cs.tu-berlin.de>
|
||||
|
||||
* Makefile.am (srfi_DATA): Added srfi-16.scm.
|
||||
|
||||
* srfi-16.scm: New file.
|
||||
|
||||
2001-05-10 Martin Grabmueller <mgrabmue@cs.tu-berlin.de>
|
||||
|
||||
* srfi-13.c (scm_string_delete): Logic was inversed for charset.
|
||||
|
|
|
|||
|
|
@ -45,6 +45,7 @@ srfi_DATA = srfi-2.scm \
|
|||
srfi-11.scm \
|
||||
srfi-13.scm \
|
||||
srfi-14.scm \
|
||||
srfi-16.scm \
|
||||
srfi-17.scm \
|
||||
srfi-19.scm
|
||||
|
||||
|
|
|
|||
123
srfi/srfi-16.scm
Normal file
123
srfi/srfi-16.scm
Normal file
|
|
@ -0,0 +1,123 @@
|
|||
;;;; srfi-16.scm --- `case-lambda' for Guile
|
||||
|
||||
;;; Copyright (C) 2001 Free Software Foundation, Inc.
|
||||
;;;
|
||||
;;; This program is free software; you can redistribute it and/or
|
||||
;;; modify it under the terms of the GNU General Public License as
|
||||
;;; published by the Free Software Foundation; either version 2, or
|
||||
;;; (at your option) any later version.
|
||||
;;;
|
||||
;;; This program 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
|
||||
;;; General Public License for more details.
|
||||
;;;
|
||||
;;; You should have received a copy of the GNU General Public License
|
||||
;;; along with this software; see the file COPYING. If not, write to
|
||||
;;; the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
||||
;;; Boston, MA 02111-1307 USA
|
||||
|
||||
;;; Commentary:
|
||||
|
||||
;;; Implementation of SRFI-16. `case-lambda' is a syntactic form
|
||||
;;; which permits writing functions acting different according to the
|
||||
;;; number of arguments passed.
|
||||
;;;
|
||||
;;; The syntax of the `case-lambda' form is defined in the following
|
||||
;;; EBNF grammar.
|
||||
;;;
|
||||
;;; <case-lambda>
|
||||
;;; --> (case-lambda <case-lambda-clause>)
|
||||
;;; <case-lambda-clause>
|
||||
;;; --> (<signature> <definition-or-command>*)
|
||||
;;; <signature>
|
||||
;;; --> (<identifier>*)
|
||||
;;; | (<identifier>* . <identifier>)
|
||||
;;; | <identifier>
|
||||
;;;
|
||||
;;; The value returned by a `case-lambda' form is a procedure which
|
||||
;;; matches the number of actual arguments against the signatures in
|
||||
;;; the various clauses, in order. The first matching clause is
|
||||
;;; selected, the corresponding values from the actual parameter list
|
||||
;;; are bound to the variable names in the clauses and the body of the
|
||||
;;; clause is evaluated.
|
||||
|
||||
;;; Author: Martin Grabmueller
|
||||
|
||||
;;; Code:
|
||||
(define-module (srfi srfi-16))
|
||||
|
||||
(export-syntax case-lambda)
|
||||
|
||||
(define-macro (case-lambda . clauses)
|
||||
|
||||
;; Return the length of the list @var{l}, but allow dotted list.
|
||||
;;
|
||||
(define (alength l)
|
||||
(cond ((null? l) 0)
|
||||
((pair? l) (+ 1 (alength (cdr l))))
|
||||
(else 0)))
|
||||
|
||||
;; Return @code{#t} if @var{l} is a dotted list, @code{#f} if it is
|
||||
;; a normal list.
|
||||
;;
|
||||
(define (dotted? l)
|
||||
(cond ((null? l) #f)
|
||||
((pair? l) (dotted? (cdr l)))
|
||||
(else #t)))
|
||||
|
||||
;; Return the expression for accessing the @var{index}th element of
|
||||
;; the list called @var{args-name}. If @var{tail?} is true, code
|
||||
;; for accessing the list-tail is generated, otherwise for accessing
|
||||
;; the list element itself.
|
||||
;;
|
||||
(define (accessor args-name index tail?)
|
||||
(if tail?
|
||||
(case index
|
||||
((0) `,args-name)
|
||||
((1) `(cdr ,args-name))
|
||||
((2) `(cddr ,args-name))
|
||||
((3) `(cdddr ,args-name))
|
||||
((4) `(cddddr ,args-name))
|
||||
(else `(list-tail ,args-name ,index)))
|
||||
(case index
|
||||
((0) `(car ,args-name))
|
||||
((1) `(cadr ,args-name))
|
||||
((2) `(caddr ,args-name))
|
||||
((3) `(cadddr ,args-name))
|
||||
(else `(list-ref ,args-name ,index)))))
|
||||
|
||||
;; Generate the binding lists of the variables of one case-lambda
|
||||
;; clause. @var{vars} is the (possibly dotted) list of variables
|
||||
;; and @var{args-name} is the generated name used for the argument
|
||||
;; list.
|
||||
;;
|
||||
(define (gen-temps vars args-name)
|
||||
(let lp ((v vars) (i 0))
|
||||
(cond ((null? v) '())
|
||||
((pair? v)
|
||||
(cons `(,(car v) ,(accessor args-name i #f))
|
||||
(lp (cdr v) (+ i 1))))
|
||||
(else `((,v ,(accessor args-name i #t)))))))
|
||||
|
||||
;; Generate the cond clauses for each of the clauses of case-lambda,
|
||||
;; including the parameter count check, binding of the parameters
|
||||
;; and the code of the corresponding body.
|
||||
;;
|
||||
(define (gen-clauses l length-name args-name)
|
||||
(cond ((null? l) (list '(else (error "too few arguments"))))
|
||||
(else
|
||||
(cons
|
||||
`((,(if (dotted? (caar l)) '>= '=)
|
||||
,length-name ,(alength (caar l)))
|
||||
(let ,(gen-temps (caar l) args-name)
|
||||
,@(cdar l)))
|
||||
(gen-clauses (cdr l) length-name args-name)))))
|
||||
|
||||
(let ((args-name (gensym))
|
||||
(length-name (gensym)))
|
||||
(let ((proc
|
||||
`(lambda ,args-name
|
||||
(let ((,length-name (length ,args-name)))
|
||||
(cond ,@(gen-clauses clauses length-name args-name))))))
|
||||
proc)))
|
||||
Loading…
Add table
Add a link
Reference in a new issue