Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. skipManyTill :: MonadPlus m => m a -> m end -> m end

   network-uri-template	Network.URI.Template.Internal.Parse

   skipManyTill p end applies the parser p zero or more times skipping results until parser end succeeds. Result parsed by end is then returned. See also: manyTill, skipMany.

2. XAnything :: String -> X

   nicify-lib	Text.Nicify

   No documentation available.

3. type CouldBeAnyOf (e :: [Type]) (xs :: [Type]) = All Map CouldBe e xs

   oops	Control.Monad.Oops

   Listing larger variants' constraints might amplify the noise of functions' signatures. The CouldBeAnyOfF constraint lets us specify several types a variant may contain in a single type-level list, as opposed to several independent constraints. So, we could replace, f :: (e CouldBe Int, e CouldBe Bool, e CouldBe Char) => VariantF IO e with the equivalent constraint, f :: e CouldBeAnyOf '[Int, Bool, Char] => VariantF IO e As CouldBeAnyOf is just short-hand, we can use throw just like when we have CouldBe constraints:

   >>> :set -XTypeOperators
   
   >>> :{
   f :: e `CouldBeAnyOf` '[Int, Bool, Char] => Variant e
   f = throw 'c'
   :}
   

   ... and eliminate constraints in just the same way:

   >>> :{
   g :: e `CouldBeAnyOf` '[Int, Bool] => Either (Variant e) Char
   g = catch @Char f
   :}
   

4. type CouldBeAnyOfF (e :: [k]) (xs :: [k]) = All Map CouldBeF e xs

   oops	Control.Monad.Oops

   As with CouldBeAnyOf, we can also constrain a variant to represent several possible types, as we might with several CouldBeF constraints, using one type-level list.

5. type CouldBeAnyOf (e :: [Type]) (xs :: [Type]) = All Map CouldBe e xs

   oops	Data.Variant

   Listing larger variants' constraints might amplify the noise of functions' signatures. The CouldBeAnyOfF constraint lets us specify several types a variant may contain in a single type-level list, as opposed to several independent constraints. So, we could replace, f :: (e CouldBe Int, e CouldBe Bool, e CouldBe Char) => VariantF IO e with the equivalent constraint, f :: e CouldBeAnyOf '[Int, Bool, Char] => VariantF IO e As CouldBeAnyOf is just short-hand, we can use throw just like when we have CouldBe constraints:

   >>> :set -XTypeOperators
   
   >>> :{
   f :: e `CouldBeAnyOf` '[Int, Bool, Char] => Variant e
   f = throw 'c'
   :}
   

   ... and eliminate constraints in just the same way:

   >>> :{
   g :: e `CouldBeAnyOf` '[Int, Bool] => Either (Variant e) Char
   g = catch @Char f
   :}
   

6. type CouldBeAnyOfF (e :: [k]) (xs :: [k]) = All Map CouldBeF e xs

   oops	Data.Variant

   As with CouldBeAnyOf, we can also constrain a variant to represent several possible types, as we might with several CouldBeF constraints, using one type-level list.

7. arrangeInsertMany :: Table columns a -> NonEmpty columns -> Maybe OnConflict -> SqlInsert

   opaleye	Opaleye.Internal.Manipulation

   No documentation available.

8. arrangeInsertManyReturning :: Unpackspec columnsReturned ignored -> Table columnsW columnsR -> NonEmpty columnsW -> (columnsR -> columnsReturned) -> Maybe OnConflict -> Returning SqlInsert

   opaleye	Opaleye.Internal.Manipulation

   No documentation available.

9. arrangeInsertManyReturningSql :: Unpackspec columnsReturned ignored -> Table columnsW columnsR -> NonEmpty columnsW -> (columnsR -> columnsReturned) -> Maybe OnConflict -> String

   opaleye	Opaleye.Internal.Manipulation

   No documentation available.

10. arrangeInsertManySql :: Table columnsW columnsR -> NonEmpty columnsW -> Maybe OnConflict -> String

    opaleye	Opaleye.Internal.Manipulation

    No documentation available.

Page 232 of many | Previous | Next