Safe Haskell | None |
---|---|
Language | Haskell2010 |
Rebase.Data.Vector.Generic
Documentation
(!) :: (HasCallStack, Vector v a) => v a -> Int -> a #
unsafeAccum :: Vector v a => (a -> b -> a) -> v a -> [(Int, b)] -> v a #
enumFromTo :: (Vector v a, Enum a) => a -> a -> v a #
enumFromThenTo :: (Vector v a, Enum a) => a -> a -> a -> v a #
zip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => v a -> v b -> v c -> v (a, b, c) #
zipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (a -> b -> c -> d) -> v a -> v b -> v c -> v d #
unzip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => v (a, b, c) -> (v a, v b, v c) #
unsafeIndex :: Vector v a => v a -> Int -> a #
zip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => v a -> v b -> v c -> v d -> v (a, b, c, d) #
zip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => v a -> v b -> v c -> v d -> v e -> v (a, b, c, d, e) #
zip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => v a -> v b -> v c -> v d -> v e -> v f -> v (a, b, c, d, e, f) #
zipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e #
zipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f #
zipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g #
unzip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => v (a, b, c, d) -> (v a, v b, v c, v d) #
unzip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => v (a, b, c, d, e) -> (v a, v b, v c, v d, v e) #
unzip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => v (a, b, c, d, e, f) -> (v a, v b, v c, v d, v e, v f) #
zipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (a -> b -> m c) -> v a -> v b -> m (v c) #
replicateM :: (Monad m, Vector v a) => Int -> m a -> m (v a) #
gfoldl :: (Vector v a, Data a) => (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> v a -> c (v a) #
gunfold :: (Vector v a, Data a, HasCallStack) => (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (v a) #
unsafeHead :: Vector v a => v a -> a #
unsafeTail :: Vector v a => v a -> v a #
unsafeInit :: Vector v a => v a -> v a #
unsafeLast :: Vector v a => v a -> a #
unsafeTake :: Vector v a => Int -> v a -> v a #
unsafeDrop :: Vector v a => Int -> v a -> v a #
unfoldrExactN :: Vector v a => Int -> (b -> (a, b)) -> b -> v a #
unfoldrExactNM :: (Monad m, Vector v a) => Int -> (b -> m (a, b)) -> b -> m (v a) #
postscanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a #
enumFromStepN :: (Vector v a, Num a) => a -> a -> Int -> v a #
class MVector (Mutable v) a => Vector (v :: Type -> Type) a where #
Minimal complete definition
basicUnsafeFreeze, basicUnsafeThaw, basicLength, basicUnsafeSlice, basicUnsafeIndexM
Methods
basicUnsafeFreeze :: Mutable v s a -> ST s (v a) #
basicUnsafeThaw :: v a -> ST s (Mutable v s a) #
basicLength :: v a -> Int #
basicUnsafeSlice :: Int -> Int -> v a -> v a #
basicUnsafeIndexM :: v a -> Int -> Box a #
basicUnsafeCopy :: Mutable v s a -> v a -> ST s () #
Instances
type family Mutable (v :: Type -> Type) = (mv :: Type -> Type -> Type) | mv -> v #
Instances
type Mutable Array | |
Defined in Data.Vector.Generic.Base | |
type Mutable PrimArray | |
Defined in Data.Vector.Generic.Base | |
type Mutable SmallArray | |
Defined in Data.Vector.Generic.Base | |
type Mutable Vector | |
Defined in Data.Vector | |
type Mutable Vector | |
Defined in Data.Vector.Primitive | |
type Mutable Vector | |
Defined in Data.Vector.Storable | |
type Mutable Vector | |
Defined in Data.Vector.Strict type Mutable Vector = MVector | |
type Mutable Vector | |
Defined in Data.Vector.Unboxed.Base |
accumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a #
backpermute :: (HasCallStack, Vector v a, Vector v Int) => v a -> v Int -> v a #
constructN :: Vector v a => Int -> (v a -> a) -> v a #
constructrN :: Vector v a => Int -> (v a -> a) -> v a #
dataCast :: (Vector v a, Data a, Typeable v, Typeable t) => (forall d. Data d => c (t d)) -> Maybe (c (v a)) #
izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (Int -> a -> b -> c -> d) -> v a -> v b -> v c -> v d #
izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (Int -> a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e #
izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (Int -> a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f #
izipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g #
izipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (Int -> a -> b -> m c) -> v a -> v b -> m (v c) #
maxIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int #
minIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int #
mkVecConstr :: String -> Constr #
postscanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b #
unsafeAccumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a #
unsafeHeadM :: (Vector v a, Monad m) => v a -> m a #
unsafeIndexM :: (Vector v a, Monad m) => v a -> Int -> m a #
unsafeLastM :: (Vector v a, Monad m) => v a -> m a #
unsafeSlice :: Vector v a => Int -> Int -> v a -> v a #
unstablePartition :: Vector v a => (a -> Bool) -> v a -> (v a, v a) #