all package:rio

O(n) Applied to a predicate and a ByteString, all determines if all elements of the ByteString satisfy the predicate.

Determines whether all elements of the structure satisfy the predicate.

O(n) all p t determines whether all characters in the Text t satisfy the predicate p. Subject to fusion.

O(n) Check if all elements satisfy the predicate.

Examples

>>> import qualified Data.Vector as V

>>> V.all even $ V.fromList [2, 4, 12 :: Int]
True

>>> V.all even $ V.fromList [2, 4, 13 :: Int]
False

>>> V.all even (V.empty :: V.Vector Int)
True

O(n) Check if all elements satisfy the predicate.

Examples

>>> import qualified Data.Vector as V

>>> V.all even $ V.fromList [2, 4, 12 :: Int]
True

>>> V.all even $ V.fromList [2, 4, 13 :: Int]
False

>>> V.all even (V.empty :: V.Vector Int)
True

O(n) Check if all elements satisfy the predicate.

Examples

>>> import qualified Data.Vector.Storable as VS

>>> VS.all even $ VS.fromList [2, 4, 12 :: Int]
True

>>> VS.all even $ VS.fromList [2, 4, 13 :: Int]
False

>>> VS.all even (VS.empty :: VS.Vector Int)
True

O(n) Check if all elements satisfy the predicate.

Examples

>>> import qualified Data.Vector.Unboxed as VU

>>> VU.all even $ VU.fromList [2, 4, 12 :: Int]
True

>>> VU.all even $ VU.fromList [2, 4, 13 :: Int]
False

>>> VU.all even (VU.empty :: VU.Vector Int)
True

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>:2:1 in interactive:Ghci1

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.

Convert a CallStack value into a Utf8Builder indicating the first source location. TODO Consider showing the entire call stack instead.

groupAllWith operates like groupWith, but sorts the list first so that each equivalence class has, at most, one list in the output

groupAllWith1 is to groupWith1 as groupAllWith is to groupWith

Determines whether all elements of the structure satisfy their appropriate predicate argument.

O(n+m) Find all non-overlapping instances of needle in haystack. Each element of the returned list consists of a pair:

• The entire string prior to the kth match (i.e. the prefix)
• The kth match, followed by the remainder of the string

Examples:

breakOnAll "::" ""
==> []
breakOnAll "/" "a/b/c/"
==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]

This function is strict in its first argument, and lazy in its second. In (unlikely) bad cases, this function's time complexity degrades towards O(n*m). The needle parameter may not be empty.

O(n+m) Find all non-overlapping instances of needle in haystack. Each element of the returned list consists of a pair:

• The entire string prior to the kth match (i.e. the prefix)
• The kth match, followed by the remainder of the string

Examples:

>>> breakOnAll "::" ""
[]

>>> breakOnAll "/" "a/b/c/"
[("a","/b/c/"),("a/b","/c/"),("a/b/c","/")]

In (unlikely) bad cases, this function's time complexity degrades towards O(n*m). The needle parameter may not be empty.