std.array
A dynamically sized contigous sequence.
Types
type Array a = Array a
Values
Eq a
defines equality (==) on a
Ord a
defines an ordering on a
Show a
represents a conversion function from a
to a readable string.
A Functor
represents an action on a parameterized type which does not
change the structure with the mapped type.
The following laws should hold:
map id == id
map (f << g) == map f << map g
Operations over a data structure that can be folded which means that a functions gets called on
each element to reduce the structure to a single value (Array
, List
and Map
are all Foldable
)
#[implicit]
let traversable : Traversable Array
Semigroup a
represents an associative operation on a
.
This means the following laws must hold:
forall x . append x (append y z) == append (append x y) z
Monoid a
represents an semigroup an which has an identity. This means
the following additional laws must hold:
forall x . append x empty == x
forall x . append empty x == x