Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master
Fetching contributors…

Octocat-spinner-32-eaf2f5

Cannot retrieve contributors at this time

file 130 lines (124 sloc) 3.545 kb
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
(*
Vector
Polymorphic Vectors
Copyright 2011 Christopher Cramer

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/.
*)
signature VECTOR = sig
type 'a t = 'a vector
include CREATEABLE_SEQUENCE where type 'a sequence = 'a t
include PURE_SEQUENCE where type 'a pureSequence = 'a t

type 'a vector = type 'a t
end

structure Vector :> VECTOR = struct
open Vector
type 'a t = 'a vector
type 'a sequence = 'a t
type 'a pureSequence = 'a t
fun isEmpty t = length t = 0
fun hd t = sub (t, 0)
val appl = app
val appli = appi
fun appr f t = foldr (fn (x, ()) => f x) () t
fun appri f t = foldri (fn (i, x, ()) => f (i, x)) () t
val fold = foldl
fun reducel f t =
let
val n = length t
fun loop (i, a) =
if i >= n then a
else loop (i + 1, f (sub (t, i), a))
in
if n = 0 then raise Empty
else loop (1, sub (t, 0))
end
val reduce = reducel
fun reducer f t =
let
fun loop (i, a) =
if i < 0 then a
else loop (i - 1, sub (t, i), a)
val n = length t
in
if n = 0 then raise Empty
else loop (n - 2, sub (t, n -1))
end
val findl = find
val findli = findi
fun findr f t =
let
fun loop i =
if i < 0 then NONE
else
let
val x = sub (t, i)
in
if f x then SOME x
else loop (i - 1)
end
in
loop (length t - 1)
end
fun findri f t =
let
fun loop i =
if i < 0 then NONE
else
let
val x = (i, sub (t, i))
in
if f x then SOME x
else loop (i - 1)
end
in
loop (length t - 1)
end
val toShadow = Shadow.fromVector
val revToShadow = Shadow.fromRevVector
fun toList t = foldr (fn (x, y) => x :: y) nil t
fun revToList t = foldl (fn (x, y) => x :: y) nil t
fun toTabulated tabulate t = tabulate (length t, fn i => sub (t, i))
fun revToTabulated tabulate t =
let
val n = length t
in
tabulate (n, fn i => sub (t, n - 1 - i))
end
fun toArray t = toTabulated Array.tabulate t
fun revToArray t = revToTabulated Array.tabulate t
val toCharArray = toTabulated CharArray.tabulate
val revToCharArray = revToTabulated CharArray.tabulate
val toBoolArray = toTabulated BoolArray.tabulate
val revToBoolArray = revToTabulated BoolArray.tabulate
val toIntArray = toTabulated IntArray.tabulate
val revToIntArray = revToTabulated IntArray.tabulate
val toWordArray = toTabulated WordArray.tabulate
val revToWordArray = revToTabulated WordArray.tabulate
val toRealArray = toTabulated RealArray.tabulate
val revToRealArray = revToTabulated RealArray.tabulate
val toFixedIntArray = toTabulated FixedIntArray.tabulate
val revToFixedIntArray = revToTabulated FixedIntArray.tabulate
val toLargeIntArray = toTabulated LargeIntArray.tabulate
val revToLargeIntArray = revToTabulated LargeIntArray.tabulate
fun unfold f (n, a) =
let
val (vector, _) = MLton.Vector.unfoldi (n, a, fn (_, a) => f a)
in
vector
end
fun unfoldi f (n, a) =
let
val (vector, _) = MLton.Vector.unfoldi (n, a, f)
in
vector
end
end
Something went wrong with that request. Please try again.