org.armedbear.lisp.butlast.lisp Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of abcl Show documentation
Show all versions of abcl Show documentation
Common Lisp implementation running on the JVM
;;; butlast.lisp
;;;
;;; Copyright (C) 2003 Peter Graves
;;; $Id$
;;;
;;; 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
;;; of the License, 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 program; if not, write to the Free Software
;;; Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
;;;
;;; As a special exception, the copyright holders of this library give you
;;; permission to link this library with independent modules to produce an
;;; executable, regardless of the license terms of these independent
;;; modules, and to copy and distribute the resulting executable under
;;; terms of your choice, provided that you also meet, for each linked
;;; independent module, the terms and conditions of the license of that
;;; module. An independent module is a module which is not derived from
;;; or based on this library. If you modify this library, you may extend
;;; this exception to your version of the library, but you are not
;;; obligated to do so. If you do not wish to do so, delete this
;;; exception statement from your version.
(in-package "COMMON-LISP")
(export '(butlast nbutlast))
(defun butlast (list &optional (n 1))
(unless (and (listp list) (typep n '(integer 0)))
(error 'type-error))
(unless (null list)
(let ((length (do ((list list (cdr list))
(i 0 (1+ i)))
((atom list) (1- i)))))
(unless (< length n)
(do* ((top (cdr list) (cdr top))
(result (list (car list)))
(splice result)
(count length (1- count)))
((= count n) result)
(setq splice (cdr (rplacd splice (list (car top))))))))))
(defun nbutlast (list &optional (n 1))
(unless (and (listp list) (typep n '(integer 0)))
(error 'type-error))
(unless (null list)
(let ((length (do ((list list (cdr list))
(i 0 (1+ i)))
((atom list) (1- i)))))
(unless (< length n)
(do ((1st (cdr list) (cdr 1st))
(2nd list 1st)
(count length (1- count)))
((= count n)
(rplacd 2nd ())
list))))))