Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
topSort :: Ord n => Set n -> [(n, n)] -> Maybe [n]Agda Agda.Utils.Graph.TopSort topoligical sort with smallest-numbered available vertex first | input: nodes, edges | output is Nothing if the graph is not a DAG Note: should be stable to preserve order of generalizable variables. Algorithm due to Richard Eisenberg, and works by walking over the list left-to-right and moving each node the minimum distance left to guarantee topological ordering.
topoSort :: (a -> a -> Bool) -> [a] -> Maybe PermutationAgda Agda.Utils.Permutation Stable topologic sort. The first argument decides whether its first argument is an immediate parent to its second argument.
topoSortM :: Monad m => (a -> a -> m Bool) -> [a] -> m (Maybe Permutation)Agda Agda.Utils.Permutation No documentation available.
popCntSorted :: (Unbox n, Integral n, Bits n, Ranked n) => Int -> Vector nOrderedBits Data.Bits.Ordered The slow default implementation. We sort the vector, not the list, as sorting will walk the whole data structure anyway, and the vector requires not as much memory. Replaced popCount &&& id as sort, which provides for a<b on equal popCount with popCount &&& activeBitsL which sorts according to a list of increasing bit indices. Mostly to stay in sync with the pred / succ functions below.
clearFromCursorToLineBeginningCode :: Stringansi-terminal-types System.Console.ANSI.Codes No documentation available.
clearFromCursorToLineEndCode :: Stringansi-terminal-types System.Console.ANSI.Codes No documentation available.
clearFromCursorToScreenBeginningCode :: Stringansi-terminal-types System.Console.ANSI.Codes No documentation available.
clearFromCursorToScreenEndCode :: Stringansi-terminal-types System.Console.ANSI.Codes No documentation available.
writeSorted :: (C a, Storable a) => Path w a -> [[KeyCount w a]] -> IO ()battleship-combinatorics Combinatorics.Battleship.Count.CountMap No documentation available.
-
bloodhound Database.Bloodhound.Common.Client For a given search, request a scroll for efficient streaming of search results. Combine this with advanceScroll to efficiently stream through the full result set. Note that this search respects sorting and may be less efficient than getInitialScroll.