Search results

Jump to navigation Jump to search

  • Ternary operator
    infixl 1 : test = 1 Prelude.< 2 ? "yeah" : "no!"
    847 bytes (121 words) - 23:08, 24 July 2021
  • RodinV08-Package1
    Bucla cu test initial Bucla cu test final
    3 KB (276 words) - 15:17, 6 February 2021
  • 99 questions/Solutions/90
    ...omposition of separate functions to generate the list of candidates and to test each candidate: queens n = filter test (generate n)
    3 KB (451 words) - 17:56, 30 September 2019
  • 99 questions/Solutions/33
    ...e coprime. Two numbers are coprime if their greatest common divisor equals 1. coprime a b = gcd a b == 1
    329 bytes (49 words) - 19:43, 18 January 2014
  • Testing primality
    == Primality Test and Integer Factorization == Simplest primality test and integer factorization is by trial division:
    4 KB (605 words) - 17:09, 18 July 2022
  • 99 questions/Solutions/65
    Use the same conventions as in problem P64 and test your function in an appropriate way. layout t = layoutAux x1 1 sep1 t
    2 KB (299 words) - 03:42, 10 January 2017
  • Concurrency demos/Haskell-Javascript concurrency
    ...)</code>. Explicit delays are used to yield control to other threads. This test also demonstrates the use of message boxes that may be used for Javascript -- Test of plain CPS based concurrency in Javascript
    4 KB (517 words) - 04:59, 26 April 2021
  • Worker wrapper
    fib n = fibWorker n 0 1 | otherwise = fibWorker (n-1) f2 (f1+f2)
    2 KB (333 words) - 12:44, 4 June 2018
  • List comprehension
    [(i,j) | i <- [1,2], j <- [1..4] ]
    5 KB (679 words) - 17:14, 4 February 2023
  • Code for Bob
    import "/home/ralf/hudak_soe/HUnit-1.0/HUnit" oneMoreTime (Lover (name, times)) = Lover (name, times+1)
    1 KB (154 words) - 15:16, 6 February 2021
  • Reference card
    [x] -> 1 _ -> -1
    4 KB (584 words) - 13:24, 22 April 2021
  • Calling Haskell from C
    where fibs = 0 : 1 : zipWith (+) fibs (tail fibs) $ ghc -optc-O test.c Safe.o Safe_stub.o -o test
    1 KB (215 words) - 17:08, 27 June 2019
  • Graham Scan Implementation
    == Test == import Test.QuickCheck
    2 KB (298 words) - 03:42, 14 August 2021
  • Web/Literature/Static linking
    main = print "hey, test this" 0000000000000000 0000000000000000 exe 1 0 0 A
    2 KB (290 words) - 03:36, 9 April 2021
  • HDBC-ODBC under Windows
    == Test == You can test it from a [[GHC/GHCi| ghci]] prompt (obviously you'll need to change the co
    2 KB (286 words) - 08:45, 23 May 2021
  • 99 questions/Solutions/66
    Use the same conventions as in problem P64 and P65 and test your predicate in an appropriate way. Note: This is a difficult problem. Do where (l, t', r) = layoutAux x1 1 t
    4 KB (637 words) - 03:42, 10 January 2017
  • Hoed
    ...following program: a defective implementation of a parity function with a test property. plusOne n = n + 1
    6 KB (896 words) - 09:12, 22 December 2015
  • 99 questions/54A to 60
    tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) -- permutation 1
    9 KB (1,368 words) - 02:54, 11 June 2023
  • Introduction to QuickCheck2
    tl <- find (n-1) -- I want to test this function, without hitting the filesystem. In C++ I
    8 KB (1,214 words) - 00:46, 23 October 2017
  • 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
  • HacBerlin2014/Topics
    With as few lines as possible generate as most test scripts as possible, part test-cases are combinable. Language of the test scripts: ruby, python, perl, c++, ... (it depends)
    8 KB (1,326 words) - 20:19, 28 September 2014
  • WxHaskell/Building
    * '''windows'''. General Windows systems (i.e. Windows 95 to Windows 8.1). <br /> * '''windows'''. Windows 98, 2000, XP, and 7, using wxMSW 2.8.x. Windows 8.1, using wxWidgets 2.9 and 3.0
    9 KB (1,401 words) - 22:39, 1 December 2015
  • Haskell program coverage
    14% boolean coverage (1/7) 16% guards (1/6), 2 always True, 2 always False, 1 unevaluated
    20 KB (2,607 words) - 17:13, 16 June 2022
  • Arch Linux/Applications
    * [http://aur.archlinux.org/packages.php?ID=19810 graphmod 1.1.3-1] 0 Present the module depen * [http://aur.archlinux.org/packages.php?ID=17823 darcs-graph 1.0-1] 2 Generate graphs of darcs repository activity
    27 KB (2,482 words) - 19:02, 6 May 2020
  • Prime numbers miscellaneous
    ...of the form <math>6k+1</math> or <math>6k+5</math>. Thus, we only need to test these numbers: 1:p:candidates = [6*k+r | k <- [0..], r <- [1,5]]
    18 KB (2,583 words) - 20:08, 19 December 2020
  • Learn Haskell in 10 minutes
    Prelude> 4 ^ 2 - 1 Prelude> (1 - 5)^(3 * 2 - 4)
    13 KB (1,986 words) - 17:59, 9 August 2019
  • Internationalization of Haskell programs using gettext
    "MIME-Version: 1.0\n" === Run and test the program ===
    10 KB (1,489 words) - 15:02, 26 October 2016
  • WxHaskell/Development
    ...07/custom-controls-in-wxhaskell-part-1/ Custom Controls in wxHaskell (part 1)], [http://wewantarock.wordpress.com/2010/01/10/custom-controls-in-wxhaskel ...l-event-handling-work-part-1/ How does wxHaskell event handling work (part 1)]
    6 KB (743 words) - 16:02, 26 April 2017
  • WxHaskell/Cygwin
    ...cessary to run <tt>configure</tt> and <tt>make</tt>, i.e. <tt>sh</tt>, <tt>test</tt>, <tt>sed</tt>, gnu <tt>make</tt> etc. The cygwin environment provides export PS1='\[\033[1;31m\]\w\$ \[\033[0m\]'
    5 KB (902 words) - 19:36, 5 April 2015
  • Maybe
    '''Maybe''' satisfies the [[type]] equation <math>F X = 1 + X</math>, where the functor <math>F</math> takes a set to a point plus th ;<hask>isJust</hask>, <hask>isNothing</hask> :Test the argument, returing a Bool based on the constructor.
    2 KB (409 words) - 00:28, 11 November 2023
  • Debugging
    -- test.hs crash = sum [1,2,3,undefined,5,6,7,8]
    9 KB (1,453 words) - 19:18, 3 February 2021

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://wiki.haskell.org/Special:Search"