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.

  1. data SuccessorTo n

    type-level-natural-number TypeLevel.NaturalNumber

    No documentation available.

  2. successorTo :: n -> SuccessorTo n

    type-level-natural-number TypeLevel.NaturalNumber

    No documentation available.

  3. package vector-quicksort

    Fast and flexible quicksort implementation for mutable vectors Quicksort implementation developed with performance in mind. Has good default single-threaded sort and provides parallelised versions that are actually faster than the single-threaded version. Users can define new parallelisation methods. Good starting point: 

    import Data.Vector.Algorithms.Quicksort qualified as Quick
    Then call as 
    Quick.sort xs

  4. bitonicSortIntST :: MVector s Int64 -> ST s ()

    vector-quicksort Data.Vector.Algorithms.Quicksort.Predefined.BitonicIntST

    No documentation available.

  5. websocketsOrT :: forall m (stM :: Type -> Type) . (MonadBaseControl IO m stM, Extractable stM) => ConnectionOptions -> ServerAppT m -> MiddlewareT m

    wai-transformers Network.WebSockets.Trans

    Respond with the WebSocket server when applicable, as a middleware

  6. class HListMergeSort (as :: [Type]) (bs :: [Type])

    web3-solidity Data.Solidity.Event.Internal

    No documentation available.

  7. mergeSortHList :: HListMergeSort as bs => HList as -> HList bs -> HList (MergeSort' as bs)

    web3-solidity Data.Solidity.Event.Internal

    No documentation available.

  8. getSortedMigrationFiles :: MonadIO m => Yggdrasil -> m [(Int, Text)]

    yggdrasil-schema Yggdrasil

    No documentation available.

  9. bestFirstSearchSortedChildrenOn :: (Ord b, Tree t) => (a -> b) -> t a -> ItemM t a

    ListTree Data.List.Tree

    Best-First-Search given that a node's children are in sorted order (best first) and given a scoring function. Especially useful for trees where nodes have an infinite amount of children, where bestFirstSearchOn will get stuck. Example: Find smallest Pythagorian Triplets 

    import Control.Monad
import Control.Monad.Generator
import Control.Monad.Trans.Class
import Data.List.Tree
import Data.Maybe

pythagorianTriplets =
catMaybes .
fmap fst .
bestFirstSearchSortedChildrenOn snd .
generate $ do
x <- lift [1..]
yield (Nothing, x)
y <- lift [1..]
yield (Nothing, x + y)
z <- lift [1..]
yield (Nothing, x + y + z)
lift . guard $ x^2 + y^2 == z^2
yield (Just (x, y, z), 0)

> print $ take 10 pythagorianTriplets
[(3,4,5),(4,3,5),(6,8,10),(8,6,10),(5,12,13),(12,5,13),(9,12,15),(12,9,15),(15,8,17),(8,15,17)]

  10. _areaSortName :: Area -> Maybe Text

    MusicBrainz Network.Protocol.MusicBrainz.Types

    No documentation available.

Page 218 of many | Previous | Next