all -base -package
O(n) all p t determines whether all characters in the Text t satisify the predicate p. Subject to fusion.
O(n) Applied to a predicate and a ByteString, all determines if all elements of the ByteString satisfy the predicate.
Used in results of RegexContext instances
Try to use direct rendering, silently using indirect rendering if this is not possible.
Used in results of RegexContext instances
Used in results of RegexContext instances
Used in results of RegexContext instances
Experimental features using Template Haskell. You need to have a {-# LANGUAGE TemplateHaskell #-} pragma in your module for any of these to work.
Register a one-shot timer callback to be triggered after at least the given amount of time. Multiple timer callbacks at same or differing times may be registered simultaneously. There is no support for canceling a registered callback.
The number of milliseconds is a lower bound on the time before the callback is generated. GLUT attempts to deliver the timer callback as soon as possible after the expiration of the callback's time interval.
Perform a series of STM actions atomically.
You cannot use atomically inside an unsafePerformIO or unsafeInterleaveIO. Any attempt to do so will result in a runtime error. (Reason: allowing this would effectively allow a transaction inside a transaction, depending on exactly when the thunk is evaluated.)
However, see newTVarIO, which can be called inside unsafePerformIO, and which allows top-level TVars to be allocated.
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.
Show more results