Hoogle Search
Within LTS Haskell 24.66 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sharedSecretPerform :: ByteString -> CommChannel -> IO ()acid-state Data.Acid.Remote attempt to authenticate with the server using a shared secret.
skipAuthenticationPerform :: CommChannel -> IO ()acid-state Data.Acid.Remote skip client-side authentication entirely.
clampBefore :: Active a -> Active aactive Data.Active "Clamp" an active value so that it is constant before the start of its era. For example, clampBefore ui can be visualized as See the documentation of clamp for more information.
trimBefore :: Monoid a => Active a -> Active aactive Data.Active "Trim" an active value so that it is empty before the start of its era. For example, trimBefore ui can be visualized as See the documentation of trim for more details.
-
aern2-mp AERN2.MP.Accuracy No documentation available.
enforceRangeMP :: (Maybe Integer, Maybe Integer) -> MPFloat -> MPFloataern2-mp AERN2.MP.Float.Tests enforceRange (Just l, Just u) a where l < u returns an arbitrary value b with u < b < l. Moreover, the returned values are distributed roughly evenly if the input values a are distributed roughly evenly in a large neighbourhood of the interval [l,r]. In most cases, when l<a<u, then b=a.
configTstBeforeRem :: Config -> Boolaeson-diff Data.Aeson.Diff No documentation available.
minimumSkipForCodePoint :: CodePoint -> CodeUnitIndexalfred-margaret Data.Text.BoyerMooreCI.Automaton Number of bytes that we can skip in the haystack if we want to skip no more than 1 pattern codepoint. It must always be a low (safe) estimate, otherwise the algorithm can miss matches. It must account for any variation of upper/lower case characters that may occur in the haystack. In most cases, this is the same number of bytes as for the given codepoint minimumSkipForCodePoint a == 1 minimumSkipForCodePoint ะด == 2 minimumSkipForCodePoint โ == 3 minimumSkipForCodePoint ๐ == 4
bfsForest :: AdjacencyIntMap -> [Int] -> Forest Intalgebraic-graphs Algebra.Graph.AdjacencyIntMap.Algorithm Compute the breadth-first search forest of a graph, such that adjacent vertices are explored in the increasing order. The search is seeded by a list of vertices that will become the roots of the resulting forest. Duplicates in the list will have their first occurrence explored and subsequent ones ignored. The seed vertices that do not belong to the graph are also ignored. Complexity: O((L + m) * log n) time and O(n) space, where L is the number of seed vertices.
forest $ bfsForest (edge 1 2) [0] == empty forest $ bfsForest (edge 1 2) [1] == edge 1 2 forest $ bfsForest (edge 1 2) [2] == vertex 2 forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2] forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2] forest $ bfsForest (edge 1 1) [1] == vertex 1 isSubgraphOf (forest $ bfsForest x vs) x == True bfsForest x (vertexList x) == map (\v -> Node v []) (nub $ vertexList x) bfsForest x [] == [] bfsForest empty vs == [] bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == [ Node { rootLabel = 1 , subForest = [ Node { rootLabel = 5 , subForest = [] }]} , Node { rootLabel = 4 , subForest = [] }] forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
dfsForest :: AdjacencyIntMap -> Forest Intalgebraic-graphs Algebra.Graph.AdjacencyIntMap.Algorithm Compute the depth-first search forest of a graph, where adjacent vertices are explored in the increasing order. Complexity: O((n + m) * min(n,W)) time and O(n) space.
forest $ dfsForest empty == empty forest $ dfsForest (edge 1 1) == vertex 1 forest $ dfsForest (edge 1 2) == edge 1 2 forest $ dfsForest (edge 2 1) == vertices [1,2] isSubgraphOf (forest $ dfsForest x) x == True isDfsForestOf (dfsForest x) x == True dfsForest . forest . dfsForest == dfsForest dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs) dfsForest $ 3 * (1 + 4) * (1 + 5) == [ Node { rootLabel = 1 , subForest = [ Node { rootLabel = 5 , subForest = [] }]} , Node { rootLabel = 3 , subForest = [ Node { rootLabel = 4 , subForest = [] }]}] forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]