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.

  1. type family QExprToIdentity x

    beam-core Database.Beam.Query.Types

    No documentation available.

  2. alongsideTable :: forall tbl (f :: Type -> Type) (g :: Type -> Type) . Beamable tbl => tbl f -> tbl g -> tbl (Columnar' f :*: Columnar' g)

    beam-core Database.Beam.Schema.Tables

    No documentation available.

  3. CounterEvidence :: a -> Evidence a b

    binary-search Numeric.Search

    No documentation available.

  4. data Evidence a b

    binary-search Numeric.Search

    The Evidence datatype is similar to Either , but differes in that all CounterEvidence values are equal to each other, and all Evidence values are also equal to each other. The Evidence type is used to binary-searching for some predicate and meanwhile returning evidences for that. In other words, Evidence is a Bool with additional information why it is True or False. 

    >>> Evidence "He owns the gun" == Evidence "He was at the scene"
True

>>> Evidence "He loved her" == CounterEvidence "He loved her"
False

  5. Evidence :: b -> Evidence a b

    binary-search Numeric.Search

    No documentation available.

  6. counterEvidence :: Evidence a b

    binary-search Numeric.Search

    counterEvidence = CounterEvidence undefined. We can use this combinator to look up for any CounterEvidence, since all CounterEvidences are equal.

  7. 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.

  8. 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.

  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. divideTill :: (Ord a, Fractional a) => a -> Splitter a

    binary-search Numeric.Search

    Perform splitting until hi - lo <= eps.

Page 1346 of many | Previous | Next