Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. zipWithMSubvectors :: (Vector u a, Vector v b, Vector w c, Applicative m) => (u a -> v b -> m (w c)) -> Chimera u a -> Chimera v b -> m (Chimera w c)

    chimera Data.Chimera

    Zip subvectors from two streams, using a given monadic length-preserving function. Caveats for tabulateM and traverseSubvectors apply.

  2. zipWithSubvectors :: (Vector u a, Vector v b, Vector w c) => (u a -> v b -> w c) -> Chimera u a -> Chimera v b -> Chimera w c

    chimera Data.Chimera

    Zip subvectors from two streams, using a given length-preserving function.

  3. fromVector :: (Vector v a, PrimMonad m) => v a -> m (MStack v (PrimState m) a)

    circular Data.Stack.Circular

    Convert a vector to a circular stack with size being equal to the length of the vector. The first element of the vector is the oldest element of the stack, the last element of the vector is the youngest element of the stack. The vector must be non-empty. O(n).

  4. fromVectorWithIndex :: (Vector v a, PrimMonad m) => Int -> v a -> m (MStack v (PrimState m) a)

    circular Data.Stack.Circular

    Convert a vector to a circular stack with size being equal to the length of the vector. The element of the vector at the given index is the youngest element of the stack, the next element of the vector is the oldest element of the stack. The vector must be non-empty. O(n).

  5. toVector :: (Vector v a, PrimMonad m) => MStack v (PrimState m) a -> m (v a)

    circular Data.Stack.Circular

    Convert a circular stack to a vector. The first element of the returned vector is the oldest element of the stack, the last element of the returned vector is the youngest element of the stack. O(n).

  6. concatBitVector# :: forall (n :: Nat) (m :: Nat) . (KnownNat n, KnownNat m) => Vec n (BitVector m) -> BitVector (n * m)

    clash-prelude Clash.Explicit.Prelude

    No documentation available.

  7. unconcatBitVector# :: forall (n :: Nat) (m :: Nat) . (KnownNat n, KnownNat m) => BitVector (n * m) -> Vec n (BitVector m)

    clash-prelude Clash.Explicit.Prelude

    No documentation available.

  8. concatBitVector# :: forall (n :: Nat) (m :: Nat) . (KnownNat n, KnownNat m) => Vec n (BitVector m) -> BitVector (n * m)

    clash-prelude Clash.Explicit.Prelude.Safe

    No documentation available.

  9. unconcatBitVector# :: forall (n :: Nat) (m :: Nat) . (KnownNat n, KnownNat m) => BitVector (n * m) -> Vec n (BitVector m)

    clash-prelude Clash.Explicit.Prelude.Safe

    No documentation available.

  10. assertBitVector :: forall (dom :: Domain) (n :: Nat) b . (KnownDomain dom, KnownNat n) => Clock dom -> Reset dom -> String -> Signal dom (BitVector n) -> Signal dom (BitVector n) -> Signal dom b -> Signal dom b

    clash-prelude Clash.Explicit.Testbench

    The same as assert, but can handle don't care bits in its expected value.

Page 88 of many | Previous | Next