Search results

99 questions/90 to 94
...w 4, the queen in the second column is in row 2, etc. Use the generate-and-test paradigm. [1,5,8,6,3,7,2,4]

6 KB (802 words) - 06:27, 11 June 2023
10分で学ぶHaskell
:Prelude> <hask>4 ^ 2 - 1</hask> :Prelude> <hask>(1 - 5)^(3 * 2 - 4)</hask>

17 KB (1,020 words) - 07:22, 9 June 2023
99 questions/Solutions/99
Hints: (1) The problem is not easy. You will need some time to thoroughly understand extractor = filter ((>1) . length) . map (filter ((=='.').snd)) . groupBy (equaling snd)

5 KB (741 words) - 03:47, 10 January 2017
Euler problems/71 to 80
problem_71=fareySeq (0%1) (3%7) ...elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000?

7 KB (972 words) - 02:57, 3 May 2015
Euler problems/31 to 40
p31 = length $ g 200 [200,100,50,20,10,5,2,1] problem_31 = ways [1,2,5,10,20,50,100,200] !!200

11 KB (1,557 words) - 09:03, 19 September 2014
Informatics 1 - Functional Programming
The course [http://www.inf.ed.ac.uk/teaching/courses/inf1/fp/ Informatics 1 - Functional Programming] is the first programming course taught to student ...dents to verify their code using [[QuickCheck]], where writing appropriate test properties is part of the challenge. In addition, some tutorial exercises u

3 KB (537 words) - 01:42, 20 October 2016
Introduction to QuickCheck1
tl <- find (n-1) -- I want to test this function, without hitting the filesystem. In C++ I

8 KB (1,186 words) - 20:49, 28 May 2021
Data.Semigroup
...v` 2 == 4</hask> is not equal to <hask>(8 `div` 4) `div` 2 == 2 `div` 2 == 1</hask>. === Test for any elements which are True in a non-empty list using <hask>sconcat</ha

4 KB (688 words) - 22:51, 29 June 2021
Sandbox
...odule=Control.Monad.State.Lazy|module-doc=Control.Monad.State.Lazy|package=test}} {| border="1"

5 KB (503 words) - 07:14, 22 December 2021
Memory leak
let xs = [1..1000000::Integer] let makeXs n = [1..n::Integer]

4 KB (648 words) - 14:59, 13 June 2016
Regex Posix
The regular expressions provided by the GHC bundle (up to 6.10.1) are ...sKuklewicz]]). Note that all of these tests are passed by regex-tdfa-0.97.1 (but not below

26 KB (3,619 words) - 03:30, 10 March 2017
QuickCheck as a test set generator
...span style='font-size:x-large; font-weight:bold'>Using QuickCheck as a DIY test data generator</span></p></center> test their re-implementation (in Java) of the part of the huge

10 KB (1,529 words) - 18:30, 16 January 2017
Simple Unix tools
-- Return the head -1 line of a file -- Return the tail -1 line of a file

6 KB (842 words) - 05:27, 8 February 2016
HUnit 1.0 User's Guide
...The [https://en.wikipedia.org/wiki/SUnit Sunit] tool pioneered support for test-first development in Smalltalk. HUnit is an adaptation of the unit testing ...rk is designed for easy extension. (Would anyone care to write a graphical test controller for HUnit?)

23 KB (3,542 words) - 03:11, 15 May 2020
How to work on lists
:Indexes are zero based, so <hask>[1,2,3] !! 0</hask> will result in <hask>1</hask>. :(Returns everything that ''passes'' the test.)

6 KB (1,106 words) - 12:32, 15 November 2019
Logic programming example
* Parent 1: "The child said 'I am a boy.'" What is the sex of parent 1, parent 2, the child, and what sex did the child

14 KB (2,307 words) - 12:23, 31 July 2014
Learning Haskell with Chess
==Exercise 1 - data types== *Define the initial board (<hask>initialBoard::Board</hask>), test <hask>prettyBoard</hask> with <hask>initialBoard</hask>.

4 KB (546 words) - 02:12, 26 April 2021
Nonogram
[Blank : row | row <- rows (n-1) (k:ks)] ++ else [replicate k Cross ++ Blank : row | row <- rows (n-k-1) ks]

17 KB (2,482 words) - 20:34, 8 June 2017
99 questions/61 to 69
tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) [1,2]

12 KB (1,696 words) - 05:35, 11 June 2023
FFI complete examples
[1 of 1] Compiling Main ( Main.hs, Main.o ) [1 of 2] Compiling Termios ( Termios.hs, Termios.o )

7 KB (1,181 words) - 21:12, 30 August 2014

Search results

Navigation menu

Search