Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

  1. LeftJustification :: Justification

    HPDF Graphics.PDF.Typesetting

    No documentation available.

  2. RightJustification :: Justification

    HPDF Graphics.PDF.Typesetting

    No documentation available.

  3. setJustification :: Justification -> TM ps s ()

    HPDF Graphics.PDF.Typesetting

    No documentation available.

  4. weaveJust :: FailOrCmd a -> Either MError a

    LambdaHack Game.LambdaHack.Client.UI.HandleHelperM

    No documentation available.

  5. returnJustLeft :: MonadClientUI m => (MsgClassShowAndSave, Text) -> m (Maybe (Either (MsgClassShowAndSave, Text) (MsgClassDistinct, (Text, Text))))

    LambdaHack Game.LambdaHack.Client.UI.Watch.WatchSfxAtomicM

    No documentation available.

  6. adjust :: (Ord p, Ord k) => (p -> p) -> k -> PSQ k p -> PSQ k p

    PSQueue Data.PSQueue

    O(log n) Adjust the priority of a key.

  7. adjustWithKey :: (Ord k, Ord p) => (k -> p -> p) -> k -> PSQ k p -> PSQ k p

    PSQueue Data.PSQueue

    O(log n) Adjust the priority of a key.

  8. adjust :: (Ord p, Ord k) => (p -> p) -> k -> PSQ k p -> PSQ k p

    PSQueue Data.PSQueue.Internal

    O(log n) Adjust the priority of a key.

  9. adjustWithKey :: (Ord k, Ord p) => (k -> p -> p) -> k -> PSQ k p -> PSQ k p

    PSQueue Data.PSQueue.Internal

    O(log n) Adjust the priority of a key.

  10. induceJust :: Graph (Maybe a) -> Graph a

    algebraic-graphs Algebra.Graph

    Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(s) time, memory and size. Good consumer and producer. 

    induceJust (vertex Nothing)                               == empty
induceJust (edge (Just x) Nothing)                        == vertex x
induceJust . fmap Just                                    == id
induceJust . fmap (\x -> if p x then Just x else Nothing) == induce p

Page 70 of many | Previous | Next