;;; -*- show-trailing-whitespace: t; indent-tabs-mode: nil -*-

;;; Copyright (c) 2007 Ivan Shvedunov. All rights reserved.
;;; Copyright (c) 2007 David Lichteblau. 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.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR 'AS IS' AND ANY EXPRESSED
;;; 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 THE AUTHOR 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 :xpath)

;; sought at http://paste.lisp.org/display/46324
;; (which is slighltly different from PAIP version)

(defconstant empty-pipe nil)

(defun pipe-empty-p (pipe) (eq pipe empty-pipe))

(defmacro make-pipe (head tail)
  "@arg[head]{pipe head (evaluated)}
   @arg[tail]{tail expression}
   @return{a pipe}
   @short{Constructs a pipe (lazy list).}

   The @code{head} expression is evaluated immediatelly. The value of @code{head} will
   be returned by @fun{pipe-head} called for the pipe object returned by @code{make-pipe}.
   Evaluation of @code{tail} expression is delayed until @fun{pipe-tail} is called for
   the pipe returned by this function. Evaluation of @code{tail} expression should produce
   a pipe or a list."
  `(cons ,head #'(lambda () ,tail)))

(defun pipe-head (pipe)
  "@arg[pipe]{a pipe}
   @return{an object}
   Returns the head of the @code{pipe}."
  (car pipe))

(defun pipe-tail (pipe)
  "@arg[pipe]{a pipe}
   @return{an object}
   @short{Returns the tail of the list.}

   First time @code{pipe-tail} is called it causes pipe tail expression to be evaluated
   and remembered for later calls."
  (if (functionp (cdr pipe))
      (setf (cdr pipe) (funcall (cdr pipe)))
      (cdr pipe)))

(defun enumerate (pipe &key count key (result pipe))
  "@arg[pipe]{a pipe}
   @arg[count]{a non-negative integer}
   @arg[key]{a function}
   @arg[result]{an object]
   @return{the value of @key{result} (the value of @code{pipe} by default)}
   Goes through all or @code{count} elements of pipe,
   possibly applying the @code{key} function."
  (if (or (pipe-empty-p pipe) (eql count 0))
      result
      (progn
        (unless (null key) (funcall key (pipe-head pipe)))
        (enumerate (pipe-tail pipe)
                   :count (if count (1- count))
                   :key key
                   :result result))))

(defun force (pipe)
  (enumerate pipe))

(defun pipe-length (pipe) ;; DANGER: this func should not be used for infinite pipes
  (length (force pipe)))

(defun map-pipe (function pipe)
  (if (pipe-empty-p pipe)
      empty-pipe
      (make-pipe (funcall function (pipe-head pipe))
                 (map-pipe function (pipe-tail pipe)))))

(defun pipe-elt (n pipe)
  (if (plusp n)
      (pipe-elt (1- n) (pipe-tail pipe))
      (pipe-head pipe)))

(defun filter-pipe (function pipe)
  (cond ((pipe-empty-p pipe) empty-pipe)
        ((funcall function (pipe-head pipe))
         (make-pipe (pipe-head pipe) (filter-pipe function (pipe-tail pipe))))
        (t (filter-pipe function (pipe-tail pipe)))))

#+nil
(defun append-pipes-rec (pipe-of-pipes) ;; FIXME
  (cond ((pipe-empty-p pipe-of-pipes) empty-pipe)
        ((pipe-empty-p (pipe-head pipe-of-pipes))
         (append-pipes-rec (pipe-tail pipe-of-pipes)))
        (t (make-pipe (head (pipe-head pipe-of-pipes))
                      (append-pipes-rec (make-pipe (pipe-tail (pipe-head pipe-of-pipes))
                                                   (pipe-tail pipe-of-pipes)))))))

(defun map-pipe-filtering (fn pipe &optional filter-test)
  "Map fn over pipe, delaying all but the first fn call,
           collecting results"
  (if (pipe-empty-p pipe)
      empty-pipe
      (let* ((head (pipe-head pipe))
             (tail (pipe-tail pipe))
             (result (funcall fn head)))
        (if (or (and filter-test (funcall filter-test result))
                result)
            (make-pipe result (map-pipe-filtering fn tail filter-test))
            (map-pipe-filtering fn tail filter-test)))))

(defun append-pipes (pipex pipey)
  "return a pipe that appends two pipes"
  (if (pipe-empty-p pipex)
      pipey
      (make-pipe (pipe-head pipex)
                 (append-pipes (pipe-tail pipex) pipey))))

(defun mappend-pipe (fn pipe)
  "lazily map fn over pipe, appending results"
  (if (pipe-empty-p pipe)
      empty-pipe
      (append-pipes (funcall fn (pipe-head pipe))
                    (mappend-pipe fn (pipe-tail pipe)))))

(defun mappend-pipe-filtering (fn pipe &optional filter-test)
  "Map fn over pipe, delaying all but the first fn call,
  appending results, filtering along the way"
  (if (pipe-empty-p pipe)
      empty-pipe
      (let* ((head (pipe-head pipe))
             (tail (pipe-tail pipe))
             (result (funcall fn head)))
        (if (or (and filter-test (funcall filter-test result))
                result)
            (make-pipe (pipe-head result)
                       (append-pipes (pipe-tail result)
                                     (mappend-pipe-filtering fn tail filter-test)))
            (mappend-pipe-filtering fn tail filter-test)))))


(defun subpipe-before (elt pipe &key (test #'eql))
  (if (pipe-empty-p pipe)
      pipe
      (let ((head (pipe-head pipe))
            (tail (pipe-tail pipe)))
        (if (funcall test elt head)
            empty-pipe
            (make-pipe head (subpipe-before elt tail :test test))))))

(defun subpipe-after (elt pipe &key (test #'eql))
  (loop
     for p = pipe then (pipe-tail p)
     while (and p (not (funcall test (pipe-head p) elt)))
     finally (return (pipe-tail p))))

(defun find-in-pipe (item pipe &key (test #'equal) (key #'identity))
  (loop
    for p = pipe then (pipe-tail p)
    while p
    when (funcall test item (funcall key (pipe-head p)))
      do (return (pipe-head p))))

(defun find-in-pipe-if (pred pipe &key (key #'identity))
  (loop
    for p = pipe then (pipe-tail p)
    while p
    when (funcall pred (funcall key (pipe-head p)))
      do (return (pipe-head p))))