Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

Exact lookup

1. pattern (:||) :: Piece -> [Piece] -> Key

   tomland	Toml.Type.Key

   Bidirectional pattern synonym for constructing and deconstructing Keys.

2. data (key :: Symbol) := value

   type-level-kv-list	Data.KVList

   No documentation available.

3. (:=) :: forall (key :: Symbol) value . ListKey key -> value -> key := value

   type-level-kv-list	Data.KVList

   No documentation available.

4. data (a :: Nat) :<=? (b :: Nat)

   typelits-witnesses	GHC.TypeLits.Compare

   Two possible ordered relationships between two natural numbers.

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

   typenums	Data.TypeLits

   Stack two pieces of error message on top of each other.

6. (:%) :: k -> Nat -> Rat

   typenums	Data.TypeLits

   No documentation available.

7. (:<>:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

   typenums	Data.TypeLits

   Put two pieces of error message next to each other.

8. (:%) :: k -> Nat -> Rat

   typenums	Data.TypeNums

   No documentation available.

9. (:%) :: k -> Nat -> Rat

   typenums	Data.TypeNums.Rats

   No documentation available.

10. type (e :: k) :| (es :: [k]) = Member e es

    vary	Vary

    Constrain es to be any type list containing e. Useful to talk about variants generically without having to specify the exact type list right away. For instance, the type of from is

    Vary.from :: (a :| l) => a -> Vary l
    

    because we can use it to construct any Vary as long as there is an a somewhere in its list of types.

Page 68 of many | Previous | Next