Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. pattern (:<>:) :: () => ErrorMessage -> ErrorMessage -> ErrorMessage

    incipit-base Incipit.Base

    Put two pieces of error message next to each other.

  2. (.<>.) :: Keyword -> Keyword -> Keyword

    sql-words Language.SQL.Keyword.Concat

    Binary not eq operator for SQL expression.

  3. (:$<>:) :: forall (docl :: Doc Symbol) (docr :: Doc Symbol) . SDoc docl -> SDoc docr -> SDoc (docl ':<>: docr)

    type-level-show TypeLevelShow.Doc

    No documentation available.

  4. (:<>:) :: Doc s -> Doc s -> Doc s

    type-level-show TypeLevelShow.Doc

    append docs next to each other

  5. 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).

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

    composable-associations Data.ComposableAssociation

    No documentation available.

  7. (?<>) :: (ToBool bool, Monoid a) => bool -> a -> a

    cond Control.Conditional

    Conditional monoid operator. If the predicate is False, the second argument is replaced with mempty. The fixity of this operator is one level higher than <>. It can also be used to chain multiple predicates together, like this: 

    even (length ls) ?<> not (null ls) ?<> ls

  8. (:<>:) :: forall p a b . Grammar p a b -> Grammar p a b -> Grammar p a b

    invertible-grammar Data.InvertibleGrammar.Base

    Grammar alternation. Left operand is tried first.

  9. ($<>) :: RAct x s => x -> s -> x

    lr-acts Data.Act.Act

    Infix synonym or ract The acting part is on the right of the operator (symbolized by <>) and the actee on the left (symbolized by $), hence the notation $<>.

  10. (.<>) :: HSDoc n -> HSDoc n -> HSDoc n

    morpheus-graphql-code-gen-utils Data.Morpheus.CodeGen.Printer

    No documentation available.

Page 20 of many | Previous | Next