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.

  1. hgetall :: RedisCtx m f => ByteString -> m (f [(ByteString, ByteString)])

    hedis Database.Redis

    No documentation available.

  2. smallestPendingMessageId :: XPendingSummaryResponse -> ByteString

    hedis Database.Redis

    No documentation available.

  3. type MessageCallback = ByteString -> IO ()

    hedis Database.Redis.Sentinel

    A handler for a message from a subscribed channel. The callback is passed the message content. Messages are processed synchronously in the receiving thread, so if the callback takes a long time it will block other callbacks and other messages from being received. If you need to move long-running work to a different thread, we suggest you use TBQueue with a reasonable bound, so that if messages are arriving faster than you can process them, you do eventually block. If the callback throws an exception, the exception will be thrown from pubSubForever which will cause the entire Redis connection for all subscriptions to be closed. As long as you call pubSubForever in a loop you will reconnect to your subscribed channels, but you should probably add an exception handler to each callback to prevent this.

  4. type PMessageCallback = RedisChannel -> ByteString -> IO ()

    hedis Database.Redis.Sentinel

    A handler for a message from a psubscribed channel. The callback is passed the channel the message was sent on plus the message content. Similar to MessageCallback, callbacks are executed synchronously and any exceptions are rethrown from pubSubForever.

  5. type UnregisterCallbacksAction = IO ()

    hedis Database.Redis.Sentinel

    An action that when executed will unregister the callbacks. It is returned from addChannels or addChannelsAndWait and typically you would use it in bracket to guarantee that you unsubscribe from channels. For example, if you are using websockets to distribute messages to clients, you could use something such as:

    websocketConn <- Network.WebSockets.acceptRequest pending
    let mycallback msg = Network.WebSockets.sendTextData websocketConn msg
    bracket (addChannelsAndWait ctrl [("hello", mycallback)] []) id $ const $ do
    {- loop here calling Network.WebSockets.receiveData -}
    

  6. flushall :: RedisCtx m f => m (f Status)

    hedis Database.Redis.Sentinel

    No documentation available.

  7. hgetall :: RedisCtx m f => ByteString -> m (f [(ByteString, ByteString)])

    hedis Database.Redis.Sentinel

    No documentation available.

  8. smallestPendingMessageId :: XPendingSummaryResponse -> ByteString

    hedis Database.Redis.Sentinel

    No documentation available.

  9. data CallStack

    relude Relude.Base

    CallStacks are a lightweight method of obtaining a partial call-stack at any point in the program. A function can request its call-site with the HasCallStack constraint. For example, we can define

    putStrLnWithCallStack :: HasCallStack => String -> IO ()
    
    as a variant of putStrLn that will get its call-site and print it, along with the string given as argument. We can access the call-stack inside putStrLnWithCallStack with callStack.
    >>> :{
    putStrLnWithCallStack :: HasCallStack => String -> IO ()
    putStrLnWithCallStack msg = do
    putStrLn msg
    putStrLn (prettyCallStack callStack)
    :}
    
    Thus, if we call putStrLnWithCallStack we will get a formatted call-stack alongside our string.
    >>> putStrLnWithCallStack "hello"
    hello
    CallStack (from HasCallStack):
    putStrLnWithCallStack, called at <interactive>:... in interactive:Ghci...
    
    GHC solves HasCallStack constraints in three steps:
    1. If there is a CallStack in scope -- i.e. the enclosing function has a HasCallStack constraint -- GHC will append the new call-site to the existing CallStack.
    2. If there is no CallStack in scope -- e.g. in the GHCi session above -- and the enclosing definition does not have an explicit type signature, GHC will infer a HasCallStack constraint for the enclosing definition (subject to the monomorphism restriction).
    3. If there is no CallStack in scope and the enclosing definition has an explicit type signature, GHC will solve the HasCallStack constraint for the singleton CallStack containing just the current call-site.
    CallStacks do not interact with the RTS and do not require compilation with -prof. On the other hand, as they are built up explicitly via the HasCallStack constraints, they will generally not contain as much information as the simulated call-stacks maintained by the RTS. A CallStack is a [(String, SrcLoc)]. The String is the name of function that was called, the SrcLoc is the call-site. The list is ordered with the most recently called function at the head. NOTE: The intrepid user may notice that HasCallStack is just an alias for an implicit parameter ?callStack :: CallStack. This is an implementation detail and should not be considered part of the CallStack API, we may decide to change the implementation in the future.

  10. callStack :: HasCallStack => CallStack

    relude Relude.Base

    Return the current CallStack. Does *not* include the call-site of callStack.

Page 464 of many | Previous | Next