Hoogle Search

Within LTS Haskell 24.27 (ghc-9.10.3)

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

Exact lookup

1. reverseDependencyClosure :: GenericInstallPlan ipkg srcpkg -> [UnitId] -> [GenericPlanPackage ipkg srcpkg]

   cabal-install	Distribution.Client.InstallPlan

   Return the packages in the plan that depend directly or indirectly on the given packages.

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

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

   cabal-install	Distribution.Client.SolverInstallPlan

   No documentation available.

4. reverseTopologicalOrder :: SolverInstallPlan -> [SolverPlanPackage]

   cabal-install	Distribution.Client.SolverInstallPlan

   No documentation available.

5. reverseTopSort :: [(Unique, a)] -> [(Unique, Unique)] -> Either String [a]

   clash-lib	Clash.Util.Graph

   Same as `reverse (topSort nodes edges)` if alternative representations are considered the same. That is, topSort might produce multiple answers and still deliver on its promise of yielding a topologically sorted node list. Likewise, this function promises one of those lists in reverse, but not necessarily the reverse of topSort itself.

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

   comfort-graph	Data.Graph.Comfort

   No documentation available.

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

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

9. reverseZetaOnS :: Rational -> OptimizeResult

   exp-pairs	Math.ExpPairs.Ivic

   An attempt to reverse zetaOnS.

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

Page 33 of many | Previous | Next