Safe Haskell | None |
---|
A SortedVector
is a vector that maintains the invariant that all elements are sorted. Whenever an element is added/removed, the vector is automatically adjusted. Because element positions can be changed in this way, it does not make sense to index the vector by specific locations.
Documentation
data SortedVector a Source
Foldable SortedVector | |
Monad SortedVector | |
Applicative SortedVector | |
Pointed SortedVector | |
Functor SortedVector | |
Prunable SortedVector | |
Eq a => Eq (SortedVector a) | |
Ord a => Ord (SortedVector a) | |
Read a => Read (SortedVector a) | |
Show a => Show (SortedVector a) | |
Ord a => Monoid (SortedVector a) | |
Ord a => HomTrainer (SortedVector a) | |
Index (SortedVector dp) | |
Ord a => Abelian (SortedVector a) | |
(Ord a, Invertible a) => Group (SortedVector a) | |
NFData a => NFData (SortedVector a) |