| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Vector.Unboxed.Sized
Description
This module re-exports the functionality in Sized
specialized to Unboxed.
Functions returning a vector determine the size from the type context unless
they have a ' suffix in which case they take an explicit Proxy argument.
Functions where the resulting vector size is not known until runtime are not exported.
Synopsis
- type Vector = Vector Vector
- pattern SomeSized :: Unbox a => KnownNat n => Vector n a -> Vector a
- type MVector = MVector MVector
- length :: forall n a. KnownNat n => Vector n a -> Int
- length' :: forall n a. Vector n a -> Proxy n
- knownLength :: forall n a r. Unbox a => Vector n a -> (KnownNat n => r) -> r
- knownLength' :: forall n a r. Unbox a => Vector n a -> (KnownNat n => Proxy n -> r) -> r
- index :: forall n a. Unbox a => Vector n a -> Finite n -> a
- index' :: forall n m a p. (KnownNat n, Unbox a) => Vector ((n + m) + 1) a -> p n -> a
- unsafeIndex :: forall n a. Unbox a => Vector n a -> Int -> a
- head :: forall n a. Unbox a => Vector (1 + n) a -> a
- last :: forall n a. Unbox a => Vector (n + 1) a -> a
- indexM :: forall n a m. (Unbox a, Monad m) => Vector n a -> Finite n -> m a
- indexM' :: forall n k a m p. (KnownNat n, Unbox a, Monad m) => Vector (n + k) a -> p n -> m a
- unsafeIndexM :: forall n a m. (Unbox a, Monad m) => Vector n a -> Int -> m a
- headM :: forall n a m. (Unbox a, Monad m) => Vector (1 + n) a -> m a
- lastM :: forall n a m. (Unbox a, Monad m) => Vector (n + 1) a -> m a
- slice :: forall i n m a p. (KnownNat i, KnownNat n, Unbox a) => p i -> Vector ((i + n) + m) a -> Vector n a
- slice' :: forall i n m a p. (KnownNat i, KnownNat n, Unbox a) => p i -> p n -> Vector ((i + n) + m) a -> Vector n a
- init :: forall n a. Unbox a => Vector (n + 1) a -> Vector n a
- tail :: forall n a. Unbox a => Vector (1 + n) a -> Vector n a
- take :: forall n m a. (KnownNat n, Unbox a) => Vector (n + m) a -> Vector n a
- take' :: forall n m a p. (KnownNat n, Unbox a) => p n -> Vector (n + m) a -> Vector n a
- drop :: forall n m a. (KnownNat n, Unbox a) => Vector (n + m) a -> Vector m a
- drop' :: forall n m a p. (KnownNat n, Unbox a) => p n -> Vector (n + m) a -> Vector m a
- splitAt :: forall n m a. (KnownNat n, Unbox a) => Vector (n + m) a -> (Vector n a, Vector m a)
- splitAt' :: forall n m a p. (KnownNat n, Unbox a) => p n -> Vector (n + m) a -> (Vector n a, Vector m a)
- empty :: forall a. Unbox a => Vector 0 a
- singleton :: forall a. Unbox a => a -> Vector 1 a
- fromTuple :: forall a input length. (Unbox a, IndexedListLiterals input length a, KnownNat length) => input -> Vector length a
- replicate :: forall n a. (KnownNat n, Unbox a) => a -> Vector n a
- replicate' :: forall n a p. (KnownNat n, Unbox a) => p n -> a -> Vector n a
- generate :: forall n a. (KnownNat n, Unbox a) => (Finite n -> a) -> Vector n a
- generate' :: forall n a p. (KnownNat n, Unbox a) => p n -> (Finite n -> a) -> Vector n a
- iterateN :: forall n a. (KnownNat n, Unbox a) => (a -> a) -> a -> Vector n a
- iterateN' :: forall n a p. (KnownNat n, Unbox a) => p n -> (a -> a) -> a -> Vector n a
- replicateM :: forall n m a. (KnownNat n, Unbox a, Monad m) => m a -> m (Vector n a)
- replicateM' :: forall n m a p. (KnownNat n, Unbox a, Monad m) => p n -> m a -> m (Vector n a)
- generateM :: forall n m a. (KnownNat n, Unbox a, Monad m) => (Finite n -> m a) -> m (Vector n a)
- generateM' :: forall n m a p. (KnownNat n, Unbox a, Monad m) => p n -> (Finite n -> m a) -> m (Vector n a)
- unfoldrN :: forall n a b. (KnownNat n, Unbox a) => (b -> (a, b)) -> b -> Vector n a
- unfoldrN' :: forall n a b p. (KnownNat n, Unbox a) => p n -> (b -> (a, b)) -> b -> Vector n a
- enumFromN :: forall n a. (KnownNat n, Unbox a, Num a) => a -> Vector n a
- enumFromN' :: forall n a p. (KnownNat n, Unbox a, Num a) => a -> p n -> Vector n a
- enumFromStepN :: forall n a. (KnownNat n, Unbox a, Num a) => a -> a -> Vector n a
- enumFromStepN' :: forall n a p. (KnownNat n, Unbox a, Num a) => a -> a -> p n -> Vector n a
- cons :: forall n a. Unbox a => a -> Vector n a -> Vector (1 + n) a
- snoc :: forall n a. Unbox a => Vector n a -> a -> Vector (n + 1) a
- (++) :: forall n m a. Unbox a => Vector n a -> Vector m a -> Vector (n + m) a
- force :: Unbox a => Vector n a -> Vector n a
- (//) :: Unbox a => Vector m a -> [(Finite m, a)] -> Vector m a
- update :: Unbox a => Vector m a -> Vector n (Int, a) -> Vector m a
- update_ :: Unbox a => Vector m a -> Vector n Int -> Vector n a -> Vector m a
- unsafeUpd :: Unbox a => Vector m a -> [(Int, a)] -> Vector m a
- unsafeUpdate :: Unbox a => Vector m a -> Vector n (Int, a) -> Vector m a
- unsafeUpdate_ :: Unbox a => Vector m a -> Vector n Int -> Vector n a -> Vector m a
- accum :: Unbox a => (a -> b -> a) -> Vector m a -> [(Int, b)] -> Vector m a
- accumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector m a -> Vector n (Int, b) -> Vector m a
- accumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector m a -> Vector n Int -> Vector n b -> Vector m a
- unsafeAccum :: Unbox a => (a -> b -> a) -> Vector m a -> [(Int, b)] -> Vector m a
- unsafeAccumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector m a -> Vector n (Int, b) -> Vector m a
- unsafeAccumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector m a -> Vector n Int -> Vector n b -> Vector m a
- reverse :: Unbox a => Vector n a -> Vector n a
- backpermute :: Unbox a => Vector m a -> Vector n Int -> Vector n a
- unsafeBackpermute :: Unbox a => Vector m a -> Vector n Int -> Vector n a
- ix :: forall n a f. (Unbox a, Functor f) => Finite n -> (a -> f a) -> Vector n a -> f (Vector n a)
- _head :: forall n a f. (Unbox a, Functor f) => (a -> f a) -> Vector (1 + n) a -> f (Vector (1 + n) a)
- _last :: forall n a f. (Unbox a, Functor f) => (a -> f a) -> Vector (n + 1) a -> f (Vector (n + 1) a)
- indexed :: (Unbox a, Unbox (Finite n)) => Vector n a -> Vector n (Finite n, a)
- map :: (Unbox a, Unbox b) => (a -> b) -> Vector n a -> Vector n b
- imap :: (Unbox a, Unbox b) => (Finite n -> a -> b) -> Vector n a -> Vector n b
- concatMap :: (Unbox a, Unbox b) => (a -> Vector m b) -> Vector n a -> Vector (n * m) b
- mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector n a -> m (Vector n b)
- imapM :: (Monad m, Unbox a, Unbox b) => (Finite n -> a -> m b) -> Vector n a -> m (Vector n b)
- mapM_ :: (Monad m, Unbox a) => (a -> m b) -> Vector n a -> m ()
- imapM_ :: (Monad m, Unbox a) => (Finite n -> a -> m b) -> Vector n a -> m ()
- forM :: (Monad m, Unbox a, Unbox b) => Vector n a -> (a -> m b) -> m (Vector n b)
- forM_ :: (Monad m, Unbox a) => Vector n a -> (a -> m b) -> m ()
- zipWith :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Vector n a -> Vector n b -> Vector n c
- zipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Vector n a -> Vector n b -> Vector n c -> Vector n d
- zipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (a -> b -> c -> d -> e) -> Vector n a -> Vector n b -> Vector n c -> Vector n d -> Vector n e
- zipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (a -> b -> c -> d -> e -> f) -> Vector n a -> Vector n b -> Vector n c -> Vector n d -> Vector n e -> Vector n f
- zipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (a -> b -> c -> d -> e -> f -> g) -> Vector n a -> Vector n b -> Vector n c -> Vector n d -> Vector n e -> Vector n f -> Vector n g
- izipWith :: (Unbox a, Unbox b, Unbox c) => (Finite n -> a -> b -> c) -> Vector n a ->