Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. pattern SearchListVideoEmbeddable_Any :: SearchListVideoEmbeddable

   gogol-youtube	Gogol.YouTube.Types

   Return all videos, embeddable or not.

2. pattern SearchListVideoLicense_Any :: SearchListVideoLicense

   gogol-youtube	Gogol.YouTube.Types

   Return all videos, regardless of which license they have, that match the query parameters.

3. pattern SearchListVideoPaidProductPlacement_Any :: SearchListVideoPaidProductPlacement

   gogol-youtube	Gogol.YouTube.Types

   Return all videos, paid product placement or not.

4. pattern SearchListVideoSyndicated_Any :: SearchListVideoSyndicated

   gogol-youtube	Gogol.YouTube.Types

   Return all videos, syndicated or not.

5. pattern SearchListVideoType_Any :: SearchListVideoType

   gogol-youtube	Gogol.YouTube.Types

   Return all videos.

6. pattern VideoAgeGating_VideoGameRating_Anyone :: VideoAgeGating_VideoGameRating

   gogol-youtube	Gogol.YouTube.Types

   No documentation available.

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

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

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

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

Page 288 of many | Previous | Next