Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. pattern (:>) :: a -> Vec n a -> Vec (n + 1) a

    clash-prelude Clash.Prelude.Safe

    Add an element to the head of a vector. 

    >>> 3:>4:>5:>Nil
3 :> 4 :> 5 :> Nil

>>> let x = 3:>4:>5:>Nil

>>> :t x
x :: Num a => Vec 3 a
    Can be used as a pattern: 
    >>> let f (x :> y :> _) = x + y

>>> :t f
f :: Num a => Vec ((n + 1) + 1) a -> a

>>> f (3:>4:>5:>6:>7:>Nil)
7
    Also in conjunctions with (:<): 
    >>> let g (a :> b :> (_ :< y :< x)) = a + b +  x + y

>>> :t g
g :: Num a => Vec ((((n + 1) + 1) + 1) + 1) a -> a

>>> g (1:>2:>3:>4:>5:>Nil)
12

  2. (:-) :: a -> Signal dom a -> Signal (dom :: Domain) a

    clash-prelude Clash.Signal.Internal

    The constructor, (:-), is not synthesizable.

  3. pattern (:<) :: Vec n a -> a -> Vec (n + 1) a

    clash-prelude Clash.Sized.Vector

    Add an element to the tail of a vector. 

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

>>> let x = (3:>4:>5:>Nil) :< 1

>>> :t x
x :: Num a => Vec 4 a
    Can be used as a pattern: 
    >>> let f (_ :< y :< x) = y + x

>>> :t f
f :: Num a => Vec ((n + 1) + 1) a -> a

>>> f (3:>4:>5:>6:>7:>Nil)
13
    Also in conjunctions with (:>): 
    >>> let g (a :> b :> (_ :< y :< x)) = a + b +  x + y

>>> :t g
g :: Num a => Vec ((((n + 1) + 1) + 1) + 1) a -> a

>>> g (1:>2:>3:>4:>5:>Nil)
12

  4. pattern (:>) :: a -> Vec n a -> Vec (n + 1) a

    clash-prelude Clash.Sized.Vector

    Add an element to the head of a vector. 

    >>> 3:>4:>5:>Nil
3 :> 4 :> 5 :> Nil

>>> let x = 3:>4:>5:>Nil

>>> :t x
x :: Num a => Vec 3 a
    Can be used as a pattern: 
    >>> let f (x :> y :> _) = x + y

>>> :t f
f :: Num a => Vec ((n + 1) + 1) a -> a

>>> f (3:>4:>5:>6:>7:>Nil)
7
    Also in conjunctions with (:<): 
    >>> let g (a :> b :> (_ :< y :< x)) = a + b +  x + y

>>> :t g
g :: Num a => Vec ((((n + 1) + 1) + 1) + 1) a -> a

>>> g (1:>2:>3:>4:>5:>Nil)
12

  5. (:$) :: Expr -> Expr -> Expr

    code-conjure Conjure.Engine

    function application between expressions

  6. (:$) :: Expr -> Expr -> Expr

    code-conjure Conjure.Expr

    function application between expressions

  7. data base :<> assoc

    composable-associations Data.ComposableAssociation

    A type representing the composition of a base type (which can be serialized into a key-value structure) along with a key-value type. This type exists as a way to compose a haskell value that has a key-value representation (ex: a haskell record where its fields are keys to their values) with additional key-value associations into a single key-value object. This is intended for use with Association to add additional key-values to a type for the purposes of serialization/deserialization. For example: 

    >>> data User = User { name :: String, age :: Int }

>>> let alice = User "Alice" 26

>>> let bob = User "Bob" 25

>>> let charlie = User "Charlie" 27

>>> let bobsFriends = [alice, charlie]

>>> bobAndFriends :: User :<> Association "friends" [User]

>>> let bobAndFriends = bob :<> Association Proxy bobsFriends
    While (bob, bobsFriends) contains the same values as bobAndFriends, it lacks information about how to combine bob and bobsFriends together into a single serialized key-value object (as well as how to deserialize that back into haskell values).

  8. (:<>) :: base -> assoc -> (:<>) base assoc

    composable-associations Data.ComposableAssociation

    No documentation available.

  9. type a :*: b = (a, b)

    data-has Data.Has

    Infix version of tuple(right associative).

  10. pattern (:*:) :: a -> b -> (a, b)

    data-has Data.Has

    Infix pattern alias for tuple(right associative).

Page 52 of many | Previous | Next