Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
A library for client-side HTTP requests, focused on ease of use. When reading the examples in this module, you should assume the following environment:
-- Make it easy to write literal ByteString and Text values. {-# LANGUAGE OverloadedStrings #-} -- Our handy module. import Network.Wreq -- Operators such as (&) and (.~). import Control.Lens -- Conversion of Haskell values to JSON. import Data.Aeson (toJSON) -- Easy traversal of JSON data. import Data.Aeson.Lens (key, nth)
There exist some less frequently used lenses that are not exported from this module; these can be found in Network.Wreq.Lens. -
wreq Network.Wreq A lens onto the final request of a historied response.
-
wreq Network.Wreq.Lens A lens onto the final request of a historied response.
-
wreq Network.Wreq.Types A request that is ready to be submitted.
-
wreq Network.Wreq.Types Return the URL associated with the given Req. This includes the port number if not standard, and the query string if one exists.
-
basement Basement.Compat.Base The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.
-
basement Basement.Imports The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.
deepseq :: NormalForm a => a -> b -> bbasement Basement.NormalForm No documentation available.
sequence :: forall m (n :: Nat) a . Monad m => ListN n (m a) -> m (ListN n a)basement Basement.Sized.List Evaluate each monadic action in the list sequentially, and collect the results.
sequence_ :: forall m (n :: Nat) a . Monad m => ListN n (m a) -> m ()basement Basement.Sized.List Evaluate each monadic action in the list sequentially, and ignore the results.