Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. many :: forall (m :: Type -> Type) (n :: Type -> Type) s a . (Alternative m, Applicative n, Monoid s) => Format m n s a -> Format m n s [a]

   construct	Construct

   Same as the usual many except a Format is no Functor, let alone Alternative.

2. manyTill :: forall (m :: Type -> Type) (n :: Type -> Type) s a . (Alternative m, Applicative n, Monoid s) => Format m n s a -> Format m n s () -> Format m n s [a]

   construct	Construct

   In the parsing direction, the same as the regular manyTill: parses the item zero or more times until the terminator succeeds. When serializing, makes sure to append the terminator. Beware, for performance reasons the function does not verify that no item's serialization can be parsed via the terminator.

3. contramany :: Decidable f => f a -> f [a]

   contravariant-extras	Contravariant.Extras

   No documentation available.

4. parseAnyString :: Parser String

   currycarbon	Currycarbon.ParserHelpers

   No documentation available.

5. data WitAny (f :: Type -> Type) (a :: k ~> Type) (b :: f k)

   decidable	Data.Type.Predicate.Quantification

   A WitAny p as is a witness that, for at least one item a in the type-level collection as, the predicate p a is true.

6. decideAny :: forall (f :: Type -> Type) k (p :: k ~> Type) . Universe f => Decide p -> Decide (Any f p)

   decidable	Data.Type.Predicate.Quantification

   Lifts a predicate p on an individual a into a predicate that on a collection as that is true if and only if any item in as satisfies the original predicate. That is, it turns a predicate of kind k ~> Type into a predicate of kind f k ~> Type. Essentially tests existential quantification.

7. idecideAny :: forall k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (Any f p @@ as)

   decidable	Data.Type.Predicate.Quantification

   decideAny, but providing an Elem.

8. data WitAny (f :: Type -> Type) (a :: k ~> Type) (b :: f k)

   decidable	Data.Type.Universe

   A WitAny p as is a witness that, for at least one item a in the type-level collection as, the predicate p a is true.

9. decideAny :: forall (f :: Type -> Type) k (p :: k ~> Type) . Universe f => Decide p -> Decide (Any f p)

   decidable	Data.Type.Universe

   Lifts a predicate p on an individual a into a predicate that on a collection as that is true if and only if any item in as satisfies the original predicate. That is, it turns a predicate of kind k ~> Type into a predicate of kind f k ~> Type. Essentially tests existential quantification.

10. idecideAny :: forall k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (Any f p @@ as)

    decidable	Data.Type.Universe

    decideAny, but providing an Elem.

Page 220 of many | Previous | Next