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. type family (x :: [k]) :++ (y :: [k]) :: [k]

    registry Data.Registry.Solver

    Extracted from the typelevel-sets project and adapted for the Registry datatype This union deduplicates elements only if they appear in contiguously What we really want is typelevel sets but they are too slow for now https://github.com/dorchard/type-level-sets/issues/17

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

    sql-words Language.SQL.Keyword.Concat

    Directly concatenate SQL string without whitespaces.

  3. (|++) :: Pattern String -> Pattern String -> Pattern String

    tidal-core Sound.Tidal.Core

    No documentation available.

  4. (|++|) :: Applicative a => a String -> a String -> a String

    tidal-core Sound.Tidal.Core

    No documentation available.

  5. (||++) :: Pattern String -> Pattern String -> Pattern String

    tidal-core Sound.Tidal.Core

    No documentation available.

  6. type family (a :: [k]) :++: (b :: [k]) :: [k]

    type-fun TypeFun.Data.List

    No documentation available.

  7. (<++>) :: (Text, Text) -> UnpickleError -> UnpickleError

    xml-picklers Data.XML.Pickle

    No documentation available.

  8. ($++$) :: Doc -> Doc -> Doc

    Agda Agda.Compiler.JS.Pretty

    Separate by blank line.

  9. ($++$) :: Doc -> Doc -> Doc

    BNFC BNFC.PrettyPrint

    Separate vertically by a blank line.

    >>> "foo" $++$ "bar"
    foo
    
    bar
    
    >>> "foo" $++$ empty
    foo
    

  10. (<++) :: ReadP a a -> ReadP r a -> ReadP r a

    cabal-install Distribution.Deprecated.ReadP

    Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.

Page 20 of many | Previous | Next