Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. (<+>) :: Doc -> Doc -> Doc

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   Beside, separated by space, unless one of the arguments is empty. <+> is associative, with identity empty.

2. type family (as :: [k]) :++: (bs :: [k]) :: [k]

   clash-prelude	Clash.Class.HasDomain.Common

   No documentation available.

3. (<<+) :: forall (n :: Nat) a . Vec n a -> a -> Vec n a

   clash-prelude	Clash.Explicit.Prelude

   Add an element to the tail of a vector, and extract all but the first element.

   >>> (3:>4:>5:>Nil) <<+ 1
   4 :> 5 :> 1 :> Nil
   
   >>> Nil <<+ 1
   Nil
   

4. (<<+) :: forall (n :: Nat) a . Vec n a -> a -> Vec n a

   clash-prelude	Clash.Explicit.Prelude.Safe

   Add an element to the tail of a vector, and extract all but the first element.

   >>> (3:>4:>5:>Nil) <<+ 1
   4 :> 5 :> 1 :> Nil
   
   >>> Nil <<+ 1
   Nil
   

5. (<<+) :: forall (n :: Nat) a . Vec n a -> a -> Vec n a

   clash-prelude	Clash.Prelude

   Add an element to the tail of a vector, and extract all but the first element.

   >>> (3:>4:>5:>Nil) <<+ 1
   4 :> 5 :> 1 :> Nil
   
   >>> Nil <<+ 1
   Nil
   

6. (<<+) :: forall (n :: Nat) a . Vec n a -> a -> Vec n a

   clash-prelude	Clash.Prelude.Safe

   Add an element to the tail of a vector, and extract all but the first element.

   >>> (3:>4:>5:>Nil) <<+ 1
   4 :> 5 :> 1 :> Nil
   
   >>> Nil <<+ 1
   Nil
   

7. (.<<+) :: forall (n :: Nat) . KnownNat n => BitVector n -> Bit -> BitVector n

   clash-prelude	Clash.Sized.BitVector

   Shift in a bit from the LSB side of a BitVector. Equal to left shifting the BitVector by one and replacing the LSB with the bit to be shifted in.

   >>> 0b1111_0000 .<<+ 0 :: BitVector 8
   0b1110_0000
   
   >>> 0b1111_0000 .<<+ 1 :: BitVector 8
   0b1110_0001
   

8. (<<+) :: forall (n :: Nat) a . Vec n a -> a -> Vec n a

   clash-prelude	Clash.Sized.Vector

   Add an element to the tail of a vector, and extract all but the first element.

   >>> (3:>4:>5:>Nil) <<+ 1
   4 :> 5 :> 1 :> Nil
   
   >>> Nil <<+ 1
   Nil
   

9. ($$+) :: Monad m => ConduitT () a m () -> ConduitT a Void m b -> m (SealedConduitT () a m (), b)

   classy-prelude-conduit	ClassyPrelude.Conduit

   The connect-and-resume operator. This does not close the Source, but instead returns it to be used again. This allows a Source to be used incrementally in a large program, without forcing the entire program to live in the Sink monad. Mnemonic: connect + do more. Since 0.5.0

10. ($$++) :: Monad m => SealedConduitT () a m () -> ConduitT a Void m b -> m (SealedConduitT () a m (), b)

    classy-prelude-conduit	ClassyPrelude.Conduit

    Continue processing after usage of $$+. Since 0.5.0

Page 56 of many | Previous | Next