| 1 |
;;; |
| 2 |
;;; Vector library (SRFI-43) |
| 3 |
;;; |
| 4 |
|
| 5 |
;; This is kept only for the backward compatibility. |
| 6 |
;; Most functions are covered by SRFI-133. A few have the same |
| 7 |
;; functionality with diffrent names in the core. |
| 8 |
|
| 9 |
(define-module srfi.43 |
| 10 |
(use srfi.133 :except (vector-fold vector-fold-right |
| 11 |
vector-map vector-map! vector-for-each |
| 12 |
vector-count)) |
| 13 |
(export |
| 14 |
;; Those are either built-in or SRFI-133 |
| 15 |
vector-unfold vector-unfold-right |
| 16 |
vector-reverse-copy vector-append vector-concatenate |
| 17 |
vector-empty? vector= |
| 18 |
vector-index vector-index-right |
| 19 |
vector-skip vector-skip-right |
| 20 |
vector-binary-search |
| 21 |
vector-any vector-every |
| 22 |
vector-copy! vector-swap! vector-reverse! vector-reverse-copy! |
| 23 |
reverse-vector->list reverse-list->vector |
| 24 |
|
| 25 |
;; SRFI-43 specific procedures |
| 26 |
vector-fold vector-fold-right vector-count |
| 27 |
(rename vector-map-with-index vector-map) ; built-in |
| 28 |
(rename vector-map-with-index! vector-map!) ; built-in |
| 29 |
(rename vector-for-each-with-index vector-for-each) ;built-in |
| 30 |
)) |
| 31 |
(select-module srfi.43) |
| 32 |
|
| 33 |
;; A few incompatible procedures |
| 34 |
|
| 35 |
(define vector-fold |
| 36 |
(case-lambda |
| 37 |
([proc seed v] ; fast path |
| 38 |
(assume-type v <vector>) |
| 39 |
(let1 len (vector-length v) |
| 40 |
(let loop ([i 0] [seed seed]) |
| 41 |
(if (= i len) seed (loop (+ i 1) (proc i seed (vector-ref v i))))))) |
| 42 |
([proc seed v . vs] |
| 43 |
(let* ([vs (cons v vs)] |
| 44 |
[len (fold (^[v len] |
| 45 |
(assume-type v <vector>) |
| 46 |
(if len (min (vector-length v) len) (vector-length v))) |
| 47 |
#f vs)]) |
| 48 |
(let loop ([i 0] [seed seed]) |
| 49 |
(if (= i len) |
| 50 |
seed |
| 51 |
(loop (+ i 1) |
| 52 |
(apply proc i seed (map (cut vector-ref <> i) vs))))))))) |
| 53 |
|
| 54 |
(define vector-fold-right |
| 55 |
(case-lambda |
| 56 |
([proc seed v] ; fast path |
| 57 |
(assume-type v <vector>) |
| 58 |
(let1 len (vector-length v) |
| 59 |
(let loop ([i (- len 1)] [seed seed]) |
| 60 |
(if (= i -1) seed (loop (- i 1) (proc i seed (vector-ref v i))))))) |
| 61 |
([proc seed v . vs] |
| 62 |
(let* ([vs (cons v vs)] |
| 63 |
[len (fold (^[v len] |
| 64 |
(assume-type v <vector>) |
| 65 |
(if len (min (vector-length v) len) (vector-length v))) |
| 66 |
#f vs)]) |
| 67 |
(let loop ([i (- len 1)] [seed seed]) |
| 68 |
(if (= i -1) |
| 69 |
seed |
| 70 |
(loop (- i 1) |
| 71 |
(apply proc i seed (map (cut vector-ref <> i) vs))))))))) |
| 72 |
|
| 73 |
(define vector-count |
| 74 |
(case-lambda |
| 75 |
([pred v] ; fast path |
| 76 |
(vector-fold (^[i c e] (if (pred i e) (+ 1 c) c)) 0 v)) |
| 77 |
([pred v . vs] |
| 78 |
(apply vector-fold (^[i c . es] (if (apply pred i es) (+ 1 c) c)) 0 v vs)))) |