Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. justAcquired :: DownloadAccessRestriction -> Maybe Bool

   gogol-books	Gogol.Books

   If deviceAllowed, whether access was just acquired with this request.

2. justAcquired :: DownloadAccessRestriction -> Maybe Bool

   gogol-books	Gogol.Books.Types

   If deviceAllowed, whether access was just acquired with this request.

3. justify :: Int -> [String] -> [String]

   table-layout	Text.Layout.Table

   Fits as many words on a line as possible depending on the given width. Every line, except the last one, gets equally filled with spaces between the words as far as possible.

4. justifyText :: Int -> String -> [String]

   table-layout	Text.Layout.Table

   Uses words to split the text into words and justifies it with justify.

   >>> justifyText 10 "This text will not fit on one line."
   ["This  text","will   not","fit on one","line."]
   

5. justify :: Int -> [String] -> [String]

   table-layout	Text.Layout.Table.Justify

   Fits as many words on a line as possible depending on the given width. Every line, except the last one, gets equally filled with spaces between the words as far as possible.

6. justifyText :: Int -> String -> [String]

   table-layout	Text.Layout.Table.Justify

   Uses words to split the text into words and justifies it with justify.

   >>> justifyText 10 "This text will not fit on one line."
   ["This  text","will   not","fit on one","line."]
   

7. adjustOption :: IsOption v => (v -> v) -> TestTree -> TestTree

   tasty	Test.Tasty

   Locally adjust the option value for the given test subtree.

8. adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.

9. adjust# :: (Eq k, Hashable k) => (v -> (# v #)) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Much like adjust, but not inherently leaky.

10. adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v

    unordered-containers	Data.HashMap.Internal.Strict

    Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.

Page 22 of many | Previous | Next