Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

  1. removeFirst :: (a -> Bool) -> [a] -> [a]

    zenacy-html Zenacy.HTML.Internal.Core

    Removes the first item from a list that satisfies a predicate.

  2. htmlElemNodeFirst :: HTMLNode -> Maybe HTMLNode

    zenacy-html Zenacy.HTML.Internal.Oper

    Gets the first child for an element.

  3. htmlQueryFirst :: HTMLQuery ()

    zenacy-html Zenacy.HTML.Internal.Query

    Moves the query to the first child node.

  4. htmlQueryIsFirst :: HTMLQuery ()

    zenacy-html Zenacy.HTML.Internal.Query

    Tests the current node to see if it is the first sibling.

  5. tokenFirst :: STRef s (TokenBuffer s) -> ST s Int

    zenacy-html Zenacy.HTML.Internal.Token

    Positions the emitter to the first token and returns its offset.

  6. htmlZipFirst :: HTMLZipper -> Maybe HTMLZipper

    zenacy-html Zenacy.HTML.Internal.Zip

    Moves the zipper to the first child node.

  7. htmlZipTestFirst :: HTMLZipper -> Maybe HTMLZipper

    zenacy-html Zenacy.HTML.Internal.Zip

    Test whether the zipper is at the first child node.

  8. bestFirstSearchOn :: (Ord b, Tree t) => (a -> b) -> t a -> ItemM t a

    ListTree Data.List.Tree

    Best First Search given a scoring function.

  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. _releaseGroupFirstReleaseDate :: ReleaseGroup -> Maybe Text

    MusicBrainz Network.Protocol.MusicBrainz.Types

    No documentation available.

Page 105 of many | Previous | Next