Search results
Jump to navigation
Jump to search
- Prelude> 4 ^ 2 - 1 Prelude> (1 - 5)^(3 * 2 - 4)14 KB (2,164 words) - 16:35, 9 October 2016
- If this is rendered with "values" set to <hask>[1..4]</hask> the result will be: 1, 2, 3, 412 KB (1,726 words) - 15:16, 6 February 2021
- test via retryWith may or may not be well defined. With GHC 6.6 I get "test"24 KB (3,463 words) - 05:20, 12 July 2021
- fun a1 b1 = sum [ e | e <- [2..a*b-1], gcd e (a*b) == 1,15 KB (2,018 words) - 01:29, 26 April 2021
- test1 = safe_reverse [1,2,3] As we can see, the null test is algorithmic. After we've done it, head8 KB (1,274 words) - 20:23, 18 July 2014
- "info" -> io $ putStrLn "This is a test computation." when (i < 10) $ goto again (i+1)12 KB (2,067 words) - 05:43, 9 March 2021
- The Haskell Cabal [[#1|[1]]] is a framework which defines a common interface for authors to more easi ...e the <code>runghc Setup.hs configure</code> command as specified in [[#1|[1]]].19 KB (2,929 words) - 23:51, 13 September 2013
- ...Otherwise you have to choose the smaller range <code>A >= a.b.c && <a.b.c+1</code>. It may also be that <hask>Another.Important.Module.open</hask> was ...e observed for sub-vectors and elements with size greater than 1 byte. The test suite did miss that.5 KB (816 words) - 08:28, 2 May 2015
- ...ndard FFI libraries along with cabal install should work, but we typically test new releases only against the latest version of Haskell Platform for the su * '''Windows''': You will need wx-config for Windows, MinGW 5.1.6 and MSYS 0.1.11 (these are the latest versions at the time of writing). You must select7 KB (1,057 words) - 03:54, 14 August 2021
- * using repeated type variables in Instances to test for type equality; and This gives in effect a type-level test for equality.14 KB (2,091 words) - 17:28, 4 February 2023
- ...e says more or less that almost everything must be expected. It is hard to test them, because they can in principle depend on every state of the real world ...logging becomes. To avoid this, you should generally use a type that has O(1) <code>mappend</code>, such as <code>Data.Sequence</code>, and <code>fold</10 KB (1,634 words) - 22:52, 6 April 2022
- remainder, GCD, and also contains the following predicates: test for zero, test for equality and < > <= >=8 KB (1,365 words) - 19:23, 15 August 2019
- Goal was to perform the test whether a string ''w'' is a word of a given regular set (given by a regular The word test is based on two functions. The first, here called ''nullable'' checks, whet22 KB (3,425 words) - 22:34, 29 June 2021
- g = arr (\x -> x*3 + 1) |<code>second g</code> ⇔ <code>3*y + 1</code>, where <code>y</code> is the second component of the pair8 KB (1,315 words) - 00:43, 16 May 2024
- A Shootout Entry for the [http://shootout.alioth.debian.org/gp4/benchmark.php?test=sumcol&lang=all sum-file benchmark]. ...hmark, at 2.74 seconds[http://shootout.alioth.debian.org/gp4/benchmark.php?test=sumcol&lang=clean&id=0], and anything Clean can do Haskell should be able t20 KB (3,239 words) - 02:07, 26 April 2021
- * <tt>--start=int</tt> 1-based index of first result to print, defaults to 1 find $1 -name '*.hoo'18 KB (2,779 words) - 22:27, 12 June 2017
- {| border="1" cellspacing="0" cellpadding="5" align="center" | 1.5hr4 KB (638 words) - 23:08, 5 April 2021
- return [EventAdd 1] Value is now: 17 KB (1,076 words) - 08:53, 4 July 2014
- ...) for Haskell Platforms 2013.2.0.0, 2014.2.0.0 and 7.10.2, and MinGHC 7.10.1. The Haskell packages are installed locally. To test wxHaskell, install [[wxAsteroids]] with:14 KB (2,131 words) - 23:13, 11 July 2021
- ...nGLRaw] contains a low-level wrapper around OpenGL, which is basically a 1:1 mapping of the C API. renderString Roman "Test string"9 KB (1,237 words) - 02:14, 8 August 2022
- Tue Mar 1 03:13:08 EST 2005 into GHCi -- tested on GHCi 6.2.1 or GHCi snapshot 6.3.20041106. It20 KB (3,458 words) - 15:19, 6 February 2021
- let largestNumber = last [1..] * Numbers the output lines, starting at 1.25 KB (3,657 words) - 18:20, 12 September 2015
- just so we can test to make sure it's never called! If this were a ...ow next to the current one, and reversing the window list are all simple O(1) operations.16 KB (2,690 words) - 16:02, 26 December 2022
- | p x = 1 + count p xs [a | i <- [1..m]]29 KB (4,702 words) - 12:36, 4 May 2021
- ...n your code's behavior. See [http://hackage.haskell.org/package/hashable-1.1.2.2/hashable.cabal this Cabal file] for an example of how to include tests ...amework for QuickCheck using some Template Haskell. For HUnit, see [[HUnit 1.0 User's Guide]]22 KB (3,268 words) - 04:57, 30 January 2022
- ...from the so- called [http://www.ibiblio.org/xml/books/bible/examples/05/5-1.xml XML Bible]. The complete source for this example is included in the HITS="5" DOUBLES="1" TRIPLES="0"28 KB (3,540 words) - 18:19, 5 January 2015
- ...compiled with an slightly earlier version of CouchDB than the current 0.10.1. -- revision 1-7fa1d1116e6ae0c1ee8d4ce89a701fdf12 KB (1,556 words) - 15:19, 6 February 2021
- Installation of SDL 1.x: Linking test ...7 KB (1,003 words) - 23:19, 5 April 2021
- y = 1 : x ...important to stress that this procedure allocates only two numbers - 0 and 1 - in memory, making this a truly cyclic list.24 KB (3,850 words) - 17:16, 28 June 2021
- ...of type 'IO a'. This idea has been described previously, by both Filinski [1] who named the operators 'reflect' and 'reify', as well as Pfenning and Dav [1] Representing Monads Andrzej Filinski Principles of Programming Languages,16 KB (2,520 words) - 06:08, 16 October 2016
- ...ber'' (or a ''prime'') is such that has no divisors other than itself (and 1). This means that it cannot be represented as a product of any two of such ...', i.e. those representable as product of two natural numbers greater than 1.58 KB (8,594 words) - 20:34, 6 May 2023
- reset (1 + shift (\k -> k 1 + k 2)) :: Int ...k> is <hask>k = \x -> x + 1</hask>, so the expression evaluates to <hask>k 1 + k 2 = 2 + 3 = 5</hask>.35 KB (5,673 words) - 20:05, 7 July 2015
- We also provide a constraint to test that two Rows are '''disjoint'''. Corresponding to this we also provide a f <haskell> typerr1 = (x := 1 .| empty) .! y + 1 </haskell>25 KB (4,073 words) - 08:53, 9 December 2013
- ...iew" as well, but to use Glome for anything other than viewing the default test scene, you may want to download the source tar file manually. ...verything works, a window should open and you should (after a pause) see a test scene with a variety of geometric shapes. If it doesn't work, then let [ht40 KB (6,787 words) - 01:19, 8 April 2014
- light_source {<-2, +3, -5>, colour rgb 1} pigment {colour rgb <1, 0, 0>}9 KB (1,391 words) - 15:17, 6 February 2021
- h <- openRawFD "test" WriteMode transformer. If you don't use any encodings other than Latin-1 -- or21 KB (3,181 words) - 16:03, 14 March 2014
- ...onent is a validating and namespace-aware XML Parser that supports the XML 1.0 Standard almost completely. Extensions are a validator for RelaxNG and an <p></p>This definition corresponds 1:1 to the composition of binary relations. With the help of the <hask>(>>>)</h48 KB (6,937 words) - 00:20, 27 April 2016
- ...Talk by <u>David Luposchainsky: "Haskell QA“</u>: Live Session explaining test frameworks and setup, benchmarking, generating and validating documentation ...t bus between the airport and Freiburg train station. Travel time is about 1 hour, a one-way ticket costs about 20 € (credit cards not accepted). The7 KB (1,040 words) - 11:33, 4 August 2017
- To test your installation, see if you can run the 'dbxml' command from the install Trying 127.0.0.1...15 KB (2,390 words) - 15:19, 6 February 2021
- {| border="1" cellspacing="0" cellpadding="5" | easier for newcomers from other languages; 0.5.1 leaks memory in some cases18 KB (2,819 words) - 19:20, 15 August 2019
- ...what this line says is just "To get the result, filter the list xs by the test p and compute the length of the result". ...rgument. Notice that filter is also a higher order function, it takes the "test function" as an argument.33 KB (5,616 words) - 22:30, 3 May 2024
- ...ocal assumptions: [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.167.4165&rep=rep1&type=pdf PDF]''' '''Version 1 comments, now dealt with; thank you!'''9 KB (1,527 words) - 09:11, 10 August 2022
- Step 1. Install the remaining packages such that at the end the following packages ....haskell.org/haskore/revised/ Design experiments] || Henning Thielemann || Test of several changes of Haskore's design targetting at more flexibility and c8 KB (1,173 words) - 10:09, 14 July 2014
- 73 KB (10,050 words) - 00:05, 19 April 2021
- ...sign can be found [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf here]. It is [https://downloads.haskell.org/ghc ...size. Taken from [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf this paper].30 KB (4,551 words) - 00:29, 15 June 2023
- solve = forM [(i,j) | i <- [1..9], j <- [1..9]] $ \(i,j) -> do a <- option [1..9] -- pick a number67 KB (9,593 words) - 05:40, 9 March 2021
- > oneMoreTime (Lover (name,times)) = Lover (name,times + 1) Lover {loverDiary = ("Antonia ",1)}28 KB (4,668 words) - 15:16, 6 February 2021
- == Chapter 1: Ubiquitous "Hello world!" and other ways to do IO in Haskell == -- Taken from 'cd-fit-1-1.hs'69 KB (11,026 words) - 12:26, 9 January 2023
- -- Carl Sagan, "The Fine Art of Baloney Detection," Parade, February 1, 1987 "wisdom engineering". As a test of our ideas, we have written IMMANUEL, a8 KB (1,343 words) - 09:02, 13 March 2016
- writing I use ghc-6.4.1, haddock-0.7 and (GNU-) emacs with the latest ...conditions are obviously fulfilled (i.e. by a case statement or a previous test). Particularly the call of <code>head</code> should be used with care or (e17 KB (2,651 words) - 09:36, 10 August 2022