Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. topoSort :: (a -> a -> Bool) -> [a] -> Maybe Permutation

    Agda Agda.Utils.Permutation

    Stable topologic sort. The first argument decides whether its first argument is an immediate parent to its second argument.

  2. topoSortM :: Monad m => (a -> a -> m Bool) -> [a] -> m (Maybe Permutation)

    Agda Agda.Utils.Permutation

    No documentation available.

  3. popCntSorted :: (Unbox n, Integral n, Bits n, Ranked n) => Int -> Vector n

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

  4. clearFromCursorToLineBeginningCode :: String

    ansi-terminal-types System.Console.ANSI.Codes

    No documentation available.

  5. clearFromCursorToLineEndCode :: String

    ansi-terminal-types System.Console.ANSI.Codes

    No documentation available.

  6. clearFromCursorToScreenBeginningCode :: String

    ansi-terminal-types System.Console.ANSI.Codes

    No documentation available.

  7. clearFromCursorToScreenEndCode :: String

    ansi-terminal-types System.Console.ANSI.Codes

    No documentation available.

  8. writeSorted :: (C a, Storable a) => Path w a -> [[KeyCount w a]] -> IO ()

    battleship-combinatorics Combinatorics.Battleship.Count.CountMap

    No documentation available.

  9. getInitialSortedScroll :: forall a m . (MonadBH m, FromJSON a) => IndexName -> Search -> m (SearchResult a)

    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.

  10. getInitialSortedScroll :: FromJSON a => IndexName -> Search -> BHRequest StatusDependant (SearchResult a)

    bloodhound Database.Bloodhound.Common.Requests

    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.

Page 207 of many | Previous | Next