Hoogle Search

Within LTS Haskell 24.57 (ghc-9.10.3)

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

  1. pattern SearchListVideoSyndicated_Any :: SearchListVideoSyndicated

    gogol-youtube Gogol.YouTube.Types

    Return all videos, syndicated or not.

  2. pattern SearchListVideoType_Any :: SearchListVideoType

    gogol-youtube Gogol.YouTube.Types

    Return all videos.

  3. pattern VideoAgeGating_VideoGameRating_Anyone :: VideoAgeGating_VideoGameRating

    gogol-youtube Gogol.YouTube.Types

    No documentation available.

  4. insertMany :: (AllocM m, Key key, Value val) => Map key val -> Tree key val -> m (Tree key val)

    haskey-btree Data.BTree.Impure

    Bulk insert a bunch of key-value pairs in an impure B+-tree. You are responsible to make sure all keys is smaller than maxKeySize, otherwise a KeyTooLargeError can (but not always will) be thrown.

  5. insertMany :: (AllocM m, Key key, Value val) => Map key val -> Tree key val -> m (Tree key val)

    haskey-btree Data.BTree.Impure.Internal.Insert

    Bulk insert a bunch of key-value pairs in an impure B+-tree. You are responsible to make sure all keys is smaller than maxKeySize, otherwise a KeyTooLargeError can (but not always will) be thrown.

  6. insertRecMany :: forall m (height :: Nat) key val . (AllocM m, Key key, Value val) => Height height -> Map key val -> NodeId height key val -> m (Index key (NodeId height key val))

    haskey-btree Data.BTree.Impure.Internal.Insert

    No documentation available.

  7. insertMany :: (AllocM m, Key k, Value v) => Map k v -> NonEmptyTree k v -> m (NonEmptyTree k v)

    haskey-btree Data.BTree.Impure.NonEmpty

    Bulk insert a bunch of key-value pairs into a NonEmptyTree.

  8. splitLeafMany :: Key key => Int -> (Map key val -> a) -> Map key val -> Index key a

    haskey-btree Data.BTree.Primitives.Leaf

    Split a leaf many times. This function ensures that the for each returned leaf, the amount of items maxLeafItems (and= minLeafItems, except when the original leaf had less than minLeafItems items.

  9. splitLeafManyPred :: Key key => (a -> Bool) -> (Map key val -> a) -> Map key val -> Maybe (Index key a)

    haskey-btree Data.BTree.Primitives.Leaf

    Split a leaf many times until the predicate is satisfied. This function ensures that the for each returned leaf, the predicate is satisfied, or returns Nothing when it can't be satisfied.

  10. insertMany :: Key k => Map k v -> Tree k v -> Tree k v

    haskey-btree Data.BTree.Pure

    Insert a bunch of key-value pairs simultaneously.

Page 291 of many | Previous | Next