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.
data
Any (f :: Type -> Type) (a :: Predicate k) (b :: TyFun f k Type)decidable Data.Type.Universe An Any f p is a predicate testing a collection as :: f a for the fact that at least one item in as satisfies p. Represents the "exists" quantifier over a given universe. This is mostly useful for its Decidable and TFunctor instances, which lets you lift predicates on p to predicates on Any f p.
module Data.Generics.Product.
Any Derive a variety of lenses generically.
-
Derive a variety of prisms generically.
-
quickcheck-dynamic Test.QuickCheck.StateModel.Variables No documentation available.
-
stratosphere Stratosphere.Types No documentation available.
-
type-map Data.TypeMap.Internal.Unsafe The type constructor Any is type to which you can unsafely coerce any lifted type, and back. More concretely, for a lifted type t and value x :: t, unsafeCoerce (unsafeCoerce x :: Any) :: t is equivalent to x.
-
No documentation available.
-
proto-lens-protobuf-types Data.ProtoLens.Any Fields :
module Proto.Google.Protobuf.
Any No documentation available.
-
proto-lens-protobuf-types Proto.Google.Protobuf.Any Fields :