Hoogle Search

Within LTS Haskell 24.9 (ghc-9.10.2)

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

  1. reverseTopologicalOrder :: GenericInstallPlan ipkg srcpkg -> [GenericPlanPackage ipkg srcpkg]

    cabal-install Distribution.Client.InstallPlan

    Return all the packages in the InstallPlan in reverse topological order. That is, for each package, all dependencies of the package appear first. Compared to executionOrder, this function returns all the installed and source packages rather than just the source ones. Also, while both this and executionOrder produce reverse topological orderings of the package dependency graph, it is not necessarily exactly the same order.

  2. reverseDependencyClosure :: SolverInstallPlan -> [SolverId] -> [SolverPlanPackage]

    cabal-install Distribution.Client.SolverInstallPlan

    No documentation available.

  3. reverseTopologicalOrder :: SolverInstallPlan -> [SolverPlanPackage]

    cabal-install Distribution.Client.SolverInstallPlan

    No documentation available.

  4. reverseEdge :: Reverse edge => edge node -> edge node

    comfort-graph Data.Graph.Comfort

    No documentation available.

  5. reverseMBigOnHalf :: Rational -> OptimizeResult

    exp-pairs Math.ExpPairs.Ivic

    Try to reverse mBigOnHalf: for a given <math> find maximal possible <math>. Sometimes, when mBigOnHalf gets especially lucky exponent pair, reverseMBigOnHalf can miss real <math> and returns lower value.

  6. reverseMOnS :: Rational -> RationalInf -> Rational

    exp-pairs Math.ExpPairs.Ivic

    Try to reverse mOnS: for a given precision and <math> compute <math>. Implemented as a binary search, so its performance is very poor. Since mOnS is not monotonic, the result is not guaranteed to be neither minimal nor maximal possible, but usually is close enough. For integer <math> this function corresponds to the multidimensional Dirichlet problem and returns <math> from error term <math>. See Ch. 13 in Ivić, 2003.

  7. reverseZetaOnS :: Rational -> OptimizeResult

    exp-pairs Math.ExpPairs.Ivic

    An attempt to reverse zetaOnS.

  8. reverseFL :: FocusList a -> FocusList a

    focuslist Data.FocusList

    Reverse a FocusList. The Focus is updated accordingly. 

    >>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "cat"]

>>> reverseFL fl
FocusList (Focus 2) ["cat","bye","hello"]

    >>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "cat", "goat"]

>>> reverseFL fl
FocusList (Focus 1) ["goat","cat","bye","hello"]
    The item with the Focus should never change after calling intersperseFL. 
    getFocusItemFL (fl :: FocusList Int) == getFocusItemFL (reverseFL fl)
    Reversing twice should not change anything. 
    (fl :: FocusList Int) == reverseFL (reverseFL fl)
    Reversing empty lists and single lists should not do anything. 
    emptyFL == reverseFL emptyFL

    singletonFL a == reverseFL (singletonFL a)
    complexity: O(n) where n is the length of the FocusList.

  9. reverseDNS :: PublicIPInfo dnsptr ip -> dnsptr

    hetzner Hetzner.Cloud

    Reverse DNS PTR entry/entries.

  10. reversed :: Group -> Group

    hw-hedgehog HaskellWorks.Hedgehog

    No documentation available.

Page 33 of many | Previous | Next