Hoogle Search

Within LTS Haskell 24.49 (ghc-9.10.3)

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

Exact lookup

1. deriveBounded :: Name -> Q [Dec]

   deriving-compat	Data.Bounded.Deriving

   Generates a Bounded instance declaration for the given data type or data family instance.

2. deriveBounded :: Name -> Q [Dec]

   deriving-compat	Data.Bounded.Deriving.Internal

   Generates a Bounded instance declaration for the given data type or data family instance.

3. genericToNamedSchemaBoundedIntegral :: forall a (d :: Meta) (f :: Type -> Type) . (Bounded a, Integral a, Generic a, Rep a ~ D1 d f, Datatype d) => SchemaOptions -> Proxy a -> NamedSchema

   openapi3	Data.OpenApi.Internal.Schema

   Default generic named schema for Bounded, Integral types.

4. toSchemaBoundedIntegral :: (Bounded a, Integral a) => Proxy a -> Schema

   openapi3	Data.OpenApi.Internal.Schema

   Default schema for Bounded, Integral types.

   >>> BSL.putStrLn $ encodePretty $ toSchemaBoundedIntegral (Proxy :: Proxy Int16)
   {
   "maximum": 32767,
   "minimum": -32768,
   "type": "integer"
   }
   

5. genericToNamedSchemaBoundedIntegral :: forall a (d :: Meta) (f :: Type -> Type) . (Bounded a, Integral a, Generic a, Rep a ~ D1 d f, Datatype d) => SchemaOptions -> Proxy a -> NamedSchema

   openapi3	Data.OpenApi.Schema

   Default generic named schema for Bounded, Integral types.

6. toSchemaBoundedIntegral :: (Bounded a, Integral a) => Proxy a -> Schema

   openapi3	Data.OpenApi.Schema

   Default schema for Bounded, Integral types.

   >>> BSL.putStrLn $ encodePretty $ toSchemaBoundedIntegral (Proxy :: Proxy Int16)
   {
   "maximum": 32767,
   "minimum": -32768,
   "type": "integer"
   }
   

7. class JoinSemiLattice a => LowerBounded a

   numhask	NumHask

   A join-semilattice with an identity element bottom for \/.

   x \/ bottom == bottom
   

8. class MeetSemiLattice a => UpperBounded a

   numhask	NumHask

   A meet-semilattice with an identity element top for /\.

   x /\ top == top
   

9. class JoinSemiLattice a => LowerBounded a

   numhask	NumHask.Algebra.Lattice

   A join-semilattice with an identity element bottom for \/.

   x \/ bottom == bottom
   

10. class MeetSemiLattice a => UpperBounded a

    numhask	NumHask.Algebra.Lattice

    A meet-semilattice with an identity element top for /\.

    x /\ top == top
    

Page 27 of many | Previous | Next