Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
pcallTrace :: NumArgs -> NumResults -> LuaE e Statushslua-core HsLua.Core Like pcall, but sets an appropriate message handler function, thereby adding a stack traceback if an error occurs.
callTrace :: LuaError e => NumArgs -> NumResults -> LuaE e ()hslua-core HsLua.Core.Trace Like call, but adds a traceback if an error occurs.
pcallTrace :: NumArgs -> NumResults -> LuaE e Statushslua-core HsLua.Core.Trace Like pcall, but sets an appropriate message handler function, thereby adding a stack traceback if an error occurs.
destroyAllResources :: Pool a -> IO ()resource-pool Data.Pool Destroy all resources in all stripes in the pool. Note that this will ignore any exceptions in the destroy function. This function is useful when you detect that all resources in the pool are broken. For example after a database has been restarted all connections opened before the restart will be broken. In that case it's better to close those connections so that takeResource won't take a broken connection from the pool but will open a new connection instead. Another use-case for this function is that when you know you are done with the pool you can destroy all idle resources immediately instead of waiting on the garbage collector to destroy them, thus freeing up those resources sooner.
destroyAllResources :: Pool a -> IO ()resource-pool Data.Pool.Internal Destroy all resources in all stripes in the pool. Note that this will ignore any exceptions in the destroy function. This function is useful when you detect that all resources in the pool are broken. For example after a database has been restarted all connections opened before the restart will be broken. In that case it's better to close those connections so that takeResource won't take a broken connection from the pool but will open a new connection instead. Another use-case for this function is that when you know you are done with the pool you can destroy all idle resources immediately instead of waiting on the garbage collector to destroy them, thus freeing up those resources sooner.
destroyAllResources :: Pool a -> IO ()resource-pool Data.Pool.Introspection Destroy all resources in all stripes in the pool. Note that this will ignore any exceptions in the destroy function. This function is useful when you detect that all resources in the pool are broken. For example after a database has been restarted all connections opened before the restart will be broken. In that case it's better to close those connections so that takeResource won't take a broken connection from the pool but will open a new connection instead. Another use-case for this function is that when you know you are done with the pool you can destroy all idle resources immediately instead of waiting on the garbage collector to destroy them, thus freeing up those resources sooner.
gallopingSearchLeftP :: (PrimMonad m, MVector v e) => (e -> Bool) -> v (PrimState m) e -> m Intvector-algorithms Data.Vector.Algorithms.Search Given a predicate that is guaranteed to be monotone on the vector elements in order, finds the index at which the predicate turns from False to True. The length of the vector is returned if the predicate is False for the entire vector. Begins searching at the start of the vector, in increasing steps of size 2^n.
-
vector-algorithms Data.Vector.Algorithms.Search Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False). Begins searching at l, going right in increasing (2^n)-steps.
gallopingSearchRightP :: (PrimMonad m, MVector v e) => (e -> Bool) -> v (PrimState m) e -> m Intvector-algorithms Data.Vector.Algorithms.Search Given a predicate that is guaranteed to be monotone on the vector elements in order, finds the index at which the predicate turns from False to True. The length of the vector is returned if the predicate is False for the entire vector. Begins searching at the end of the vector, in increasing steps of size 2^n.
-
vector-algorithms Data.Vector.Algorithms.Search Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False). Begins searching at u, going left in increasing (2^n)-steps.