more-ops.lisp

;; -*- system :dlist; -*- 
;; Copyright (c) 2011-2012, Krzysztof Drewniak
;; All rights reserved.

;; Redistribution and use in source and binary forms, with or without
;; modification, are permitted provided that the following conditions are met:
;;     * Redistributions of source code must retain the above copyright
;;       notice, this list of conditions and the following disclaimer.
;;     * Redistributions in binary form must reproduce the above copyright
;;       notice, this list of conditions and the following disclaimer in the
;;       documentation and/or other materials provided with the distribution.
;;     * Neither the name of the <organization> nor the
;;       names of its contributors may be used to endorse or promote products
;;       derived from this software without specific prior written permission.

;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
;; ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
;; WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
;; DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
;; DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
;; (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
;; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
;; ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
;; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

(in-package #:dlist)

(defun dlist-reverse (dlist)
  "Reverses dlist non-destructively."
  (mapdlist #'(lambda (x) x) dlist :from-end t))

(defun copy-dlist (dlist &key deep-copy)
  "Copies `dlist', returning a new dlist with the same elements as `dlist'. If `deep-copy' is true, `copy-dlist' deep-copies dlists and sequences."
  (mapdlist #'(lambda (x) (cond 
			    ((and deep-copy (or (dlistp x) (dconsp x))) (copy-dlist x))
			    ((and deep-copy (typep x 'sequence)) (copy-seq x))
			    (t x))) dlist))

(defun make-dlist (size &key initial-element)
  "Creates a dlist that contains `initial-element' `size' times."
  (let ((ret nil))
    (loop repeat size do (dlist-push initial-element ret)) ret))

(defun dlist-length (dlist)
  "Returns the length of `dlist'"
  (let ((ret 0))
    (dodlist (i dlist ret)
      (declare (ignore i))
      (incf ret))))

(defun dlist-append (&rest dlists)
  "Appends `dlists' non-derstructively by calling `dlist-nconc' with shallow copies of each dlist."
  (apply #'dlist-nconc (mapcar #'copy-dlist dlists)))