X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fsequence.lisp;h=880f7fd6edfb19ac755710a64f0d119c3dec5c8a;hb=71497337d7fc99cf8eefe239e662f86c67519d57;hp=cda0b411dfb489547718835272fc9d2ea54cb898;hpb=e2040ea9a5d5794b68a34277d459d52b475d6eff;p=jscl.git diff --git a/src/sequence.lisp b/src/sequence.lisp index cda0b41..880f7fd 100644 --- a/src/sequence.lisp +++ b/src/sequence.lisp @@ -13,6 +13,11 @@ ;; You should have received a copy of the GNU General Public License ;; along with JSCL. If not, see . +(/debug "loading sequence.lisp!") + +(defun sequencep (thing) + (or (listp thing) (vectorp thing))) + (defun not-seq-error (thing) (error "`~S' is not of type SEQUENCE" thing)) @@ -179,3 +184,91 @@ (defun copy-seq (sequence) (subseq sequence 0)) + + +;;; Reduce (based on SBCL's version) + +(defun reduce (function sequence &key key from-end (start 0) end (initial-value nil ivp)) + (let ((key (or key #'identity)) + (end (or end (length sequence)))) + (if (= end start) + (if ivp initial-value (funcall function)) + (macrolet ((reduce-list (function sequence key start end initial-value ivp from-end) + `(let ((sequence + ,(if from-end + `(reverse (nthcdr ,start ,sequence)) + `(nthcdr ,start ,sequence)))) + (do ((count (if ,ivp ,start (1+ ,start)) + (1+ count)) + (sequence (if ,ivp sequence (cdr sequence)) + (cdr sequence)) + (value (if ,ivp ,initial-value (funcall ,key (car sequence))) + ,(if from-end + `(funcall ,function (funcall ,key (car sequence)) value) + `(funcall ,function value (funcall ,key (car sequence)))))) + ((>= count ,end) value))))) + (if from-end + (reduce-list function sequence key start end initial-value ivp t) + (reduce-list function sequence key start end initial-value ivp nil)))))) + +(defun elt (sequence index) + (when (< index 0) + (error "The index ~D is below zero." index)) + (etypecase sequence + (list + (let ((i 0)) + (dolist (elt sequence) + (when (eql index i) + (return-from elt elt)) + (incf i)) + (error "The index ~D is too large for ~A of length ~D." index 'list i))) + (array + (let ((length (length sequence))) + (when (>= index length) + (error "The index ~D is too large for ~A of length ~D." index 'vector length)) + (aref sequence index))))) + +(defun mismatch (sequence1 sequence2 &key key (test #'eql testp) (test-not nil test-not-p) + (start1 0) (end1 (length sequence1)) + (start2 0) (end2 (length sequence2))) + (let ((index1 start1) + (index2 start2)) + (while (and (<= index1 end1) (<= index2 end2)) + (when (or (eql index1 end1) (eql index2 end2)) + (return-from mismatch (if (eql end1 end2) NIL index1))) + (unless (satisfies-test-p (elt sequence1 index1) (elt sequence2 index2) + :key key :test test :testp testp + :test-not test-not :test-not-p test-not-p) + (return-from mismatch index1)) + (incf index1) + (incf index2)))) + +(defun list-search (sequence1 list2 args) + (let ((length1 (length sequence1)) + (position 0)) + (while list2 + (let ((mismatch (apply #'mismatch sequence1 list2 args))) + (when (or (not mismatch) (>= mismatch length1)) + (return-from list-search position))) + (pop list2) + (incf position)))) + +(defun vector-search (sequence1 vector2 args) + (let ((length1 (length sequence1))) + (dotimes (position (length vector2)) + (let ((mismatch (apply #'mismatch sequence1 (subseq vector2 position) args))) + (when (or (not mismatch) (>= mismatch length1)) + (return-from vector-search position)))))) + +(defun search (sequence1 sequence2 &rest args &key key test test-not) + (unless (sequencep sequence1) + (not-seq-error sequence1)) + (when (or (and (listp sequence1) (null sequence1)) + (and (vectorp sequence1) (zerop (length sequence1)))) + (return-from search 0)) + (funcall + (typecase sequence2 + (list #'list-search) + (array #'vector-search) + (t (not-seq-error sequence2))) + sequence1 sequence2 args))