all -base
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
See module docs for more information, and "cv-combinators" package for example usage.
Version 0.0.2
Try to use direct rendering, silently using indirect rendering if this is not possible.
Two modules supplying proxy instances that allow you to define pure andor effectful instances in terms of their more general effectfulroute-including equivalents in Alloy.
Version 1.0.0
Used in results of RegexContext instances
Used in results of RegexContext instances
Used in results of RegexContext instances
This is an alpha release of Allure of the Stars, a near-future Sci-Fi roguelike and tactical squad game. The game is barely fun at this stage and not yet really Sci-Fi. See the wiki for design notes and contribute.
New in this release are missiles flying for three turns (by an old kosmikus' idea), visual feedback for targeting and animations of combat and individual monster moves. Long term goals are high replayability and auto-balancing through procedural content generation and persistent content modification based on player behaviour.
The game is written using the LambdaHack roguelike game engine available at http://hackage.haskell.org/package/LambdaHack.
Version 0.4.4
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.
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.
The 'cabal' command-line program simplifies the process of managing Haskell software by automating the fetching, configuration, compilation and installation of Haskell libraries and programs.
Version 0.14.0
This is cabal-install with bundled dependencies. Easier to bootstrap.
Version 0.14.0
The 'cabal' command-line program simplifies the process of managing Haskell software by automating the fetching, configuration, compilation and installation of Haskell libraries and programs.
cabal-install-0.10.2 does not build with the packages that come with ghc-7.2. This package is a copy of cabal-install-0.10.2 with dependency version changes made in the cabal file and the bootstrap.sh file to be compatible with ghc-7.2 packages. Thanks to beastaugh on github for describing these changes at https:gist.github.com/1169332. This package will be removed once a new version of cabal-install comes out that is compatible with the next version of ghc, 7.4.
Known bug: cabal sdist does not work with the version. You must build your own source package using tar czf.
Version 0.10.4
This is a naive adaption of cabal-install-ghc72 for ghc 7.4.1. Don't complain if it does not work for you.
The 'cabal' command-line program simplifies the process of managing Haskell software by automating the fetching, configuration, compilation and installation of Haskell libraries and programs.
cabal-install-0.10.2 does not build with the packages that come with ghc-7.4. This package is a copy of cabal-install-0.10.2 with dependency version changes made in the cabal file and the bootstrap.sh file to be compatible with ghc-7.4 packages. Thanks to beastaugh on github for describing these changes at https:gist.github.com/1169332. This package will be removed once a new version of cabal-install comes out that is compatible with the next version of ghc, 7.4.
Known bug: cabal sdist does not work with the version. You must build your own source package using tar czf.
Version 0.10.4
Different kinds of callbacks
Adds a callback
the callbacks for this test case
callCC (call-with-current-continuation) calls its argument function, passing it the current continuation. It provides an escape continuation mechanism for use with continuation monads. Escape continuations one allow to abort the current computation and return a value immediately. They achieve a similar effect to throwError and catchError within an ErrorT monad. The advantage of this function over calling return is that it makes the continuation explicit, allowing more flexibility and better control.
The standard idiom used with callCC is to provide a lambda-expression to name the continuation. Then calling the named continuation anywhere within its scope will escape from the computation, even if it is many layers deep within nested computations.
Show more results