;; You should have received a copy of the GNU General Public License
;; along with JSCL. If not, see <http://www.gnu.org/licenses/>.
+(/debug "loading sequence.lisp!")
+
+(defun not-seq-error (thing)
+ (error "`~S' is not of type SEQUENCE" thing))
+
(defmacro do-sequence ((elt seq &optional (index (gensym "i") index-p)) &body body)
(let ((nseq (gensym "seq")))
(unless (symbolp elt)
(let ((,elt (aref ,nseq ,index)))
,@body))))))
-(defun find (item seq &key key (test #'eql))
- (if key
- (do-sequence (x seq)
- (when (funcall test (funcall key x) item)
- (return x)))
- (do-sequence (x seq)
- (when (funcall test x item)
- (return x)))))
+(defun find (item seq &key key (test #'eql testp) (test-not #'eql test-not-p))
+ (do-sequence (x seq)
+ (when (satisfies-test-p item x :key key :test test :testp testp
+ :test-not test-not :test-not-p test-not-p)
+ (return x))))
(defun find-if (predicate sequence &key key)
(if key
(when (funcall predicate x)
(return x)))))
-(defun position (elt sequence &key (test #'eql))
- (do-sequence (x seq index)
- (when (funcall test elt x)
- (return index))))
+(defun position (elt sequence
+ &key key (test #'eql testp)
+ (test-not #'eql test-not-p)
+ (start 0) end)
+ ;; TODO: Implement START and END efficiently for all the sequence
+ ;; functions.
+ (let ((end (or end (length sequence))))
+ (do-sequence (x sequence index)
+ (when (and (<= start index)
+ (< index end)
+ (satisfies-test-p elt x
+ :key key :test test :testp testp
+ :test-not test-not :test-not-p test-not-p))
+ (return index)))))
+
+;; TODO: need to support &key from-end
+(defun position-if (predicate sequence
+ &key key (start 0) end)
+ ;; TODO: Implement START and END efficiently for all the sequence
+ ;; functions.
+ (let ((end (or end (length sequence))))
+ (do-sequence (x sequence index)
+ (when (and (<= start index)
+ (< index end)
+ (funcall predicate (if key (funcall key x) x)))
+ (return index)))))
+
+(defun position-if-not (predicate sequence
+ &key key (start 0) end)
+ (position-if (complement predicate) sequence :key key :start start :end end))
-(defun remove (x seq)
+(defun remove (x seq &key key (test #'eql testp) (test-not #'eql test-not-p))
(cond
((null seq)
nil)
(let* ((head (cons nil nil))
(tail head))
(do-sequence (elt seq)
- (unless (eql x elt)
+ (unless (satisfies-test-p x elt :key key :test test :testp testp
+ :test-not test-not :test-not-p test-not-p)
(let ((new (list elt)))
(rplacd tail new)
(setq tail new))))
(t
(let (vector)
(do-sequence (elt seq index)
- (if (eql x elt)
+ (if (satisfies-test-p x elt :key key :test test :testp testp
+ :test-not test-not :test-not-p test-not-p)
;; Copy the beginning of the vector only when we find an element
;; that does not match.
(unless vector
(cond
((listp seq) (list-remove-if func seq nil))
((arrayp seq) (vector-remove-if func seq nil))
- (t (error "`~S' is not of type SEQUENCE" seq))))
+ (t (not-seq-error seq))))
(defun remove-if-not (func seq)
(cond
((listp seq) (list-remove-if func seq t))
((arrayp seq) (vector-remove-if func seq t))
- (t (error "`~S' is not of type SEQUENCE" seq))))
+ (t (not-seq-error seq))))
(defun list-remove-if (func list negate)
(if (endp list)
(defun vector-remove-if (func vector negate)
(let ((out-vector (make-array 0)))
- (dotimes (i (length vector))
- (let* ((element (aref vector i))
- (test (funcall func element)))
+ (do-sequence (element vector i)
+ (let ((test (funcall func element)))
(when (if negate test (not test))
(vector-push-extend element out-vector))))
out-vector))
-;;; TODO: Support both List and vectors in the following functions
-
(defun subseq (seq a &optional b)
- (if b
- (slice seq a b)
- (slice seq a)))
+ (cond
+ ((listp seq)
+ (if b
+ (let ((diff (- b a)))
+ (cond
+ ((zerop diff) ())
+ ((minusp diff)
+ (error "Start index must be smaller than end index"))
+ (t
+ (let* ((drop-a (copy-list (nthcdr a seq)))
+ (pointer drop-a))
+ (dotimes (_ (1- diff))
+ (setq pointer (cdr pointer))
+ (when (null pointer)
+ (error "Ending index larger than length of list")))
+ (rplacd pointer ())
+ drop-a))))
+ (copy-list (nthcdr a seq))))
+ ((vectorp seq)
+ (let* ((b (or b (length seq)))
+ (size (- b a))
+ (new (make-array size :element-type (array-element-type seq))))
+ (do ((i 0 (1+ i))
+ (j a (1+ j)))
+ ((= j b) new)
+ (aset new i (aref seq j)))))
+ (t (not-seq-error seq))))
+
+(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))))))