Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. QForceSelect :: forall be r (db :: (Type -> Type) -> Type) s next . Projectible be r => (r -> BeamSqlBackendSelectTableSyntax be -> [BeamSqlBackendOrderingSyntax be] -> Maybe Integer -> Maybe Integer -> BeamSqlBackendSelectSyntax be) -> QM be db (QNested s) r -> (r -> next) -> QF be db s next

   beam-core	Database.Beam.Query.Internal

   No documentation available.

2. data LensFor t x

   beam-core	Database.Beam.Schema

   No documentation available.

3. LensFor :: forall t x . Generic t => Lens' t x -> LensFor t x

   beam-core	Database.Beam.Schema

   No documentation available.

4. data LensFor t x

   beam-core	Database.Beam.Schema.Tables

   No documentation available.

5. LensFor :: forall t x . Generic t => Lens' t x -> LensFor t x

   beam-core	Database.Beam.Schema.Tables

   No documentation available.

6. counterEvidenceForLargest :: [Range (Evidence b1 b2) a] -> Maybe b1

   binary-search	Numeric.Search

   Get the content of the counterEvidence for the largest a which does not satisfy pred a.

7. counterEvidenceForSmallest :: [Range (Evidence b1 b2) a] -> Maybe b1

   binary-search	Numeric.Search

   Get the content of the counterEvidence for the smallest a which does not satisfy pred a.

8. divForever :: Integral a => Splitter a

   binary-search	Numeric.Search

   Perform split forever, until we cannot find a mid-value because hi-lo < 2. This splitter assumes that the arguments are Integral, and uses the div funtion. Note that our dividing algorithm always find the mid value for any hi-lo >= 2.

   >>> prove $ \x y -> (y .>= x+2 &&& x+2 .> x) ==> let z = (x+1) `sDiv` 2 + y `sDiv` 2  in x .< z &&& z .< (y::SInt32)
   Q.E.D.
   

9. divideForever :: (Eq a, Fractional a) => Splitter a

   binary-search	Numeric.Search

   Perform split forever, until we cannot find a mid-value due to machine precision. This one uses (/) operator.

10. evidenceForLargest :: [Range (Evidence b1 b2) a] -> Maybe b2

    binary-search	Numeric.Search

    Get the content of the evidence for the largest a which satisfies pred a.

Page 1319 of many | Previous | Next