Search results

Jump to navigation Jump to search
  • infixl 1 : test = 1 Prelude.< 2 ? "yeah" : "no!"
    847 bytes (121 words) - 23:08, 24 July 2021
  • Bucla cu test initial Bucla cu test final
    3 KB (276 words) - 15:17, 6 February 2021
  • ...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
  • ...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
  • == Primality Test and Integer Factorization == Simplest primality test and integer factorization is by trial division:
    4 KB (605 words) - 17:09, 18 July 2022
  • 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
  • ...)</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
  • fib n = fibWorker n 0 1 | otherwise = fibWorker (n-1) f2 (f1+f2)
    2 KB (333 words) - 12:44, 4 June 2018
  • [(i,j) | i <- [1,2], j <- [1..4] ]
    5 KB (679 words) - 17:14, 4 February 2023
  • 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
  • [x] -> 1 _ -> -1
    4 KB (584 words) - 13:24, 22 April 2021
  • 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
  • == Test == import Test.QuickCheck
    2 KB (298 words) - 03:42, 14 August 2021
  • main = print "hey, test this" 0000000000000000 0000000000000000 exe 1 0 0 A
    2 KB (290 words) - 03:36, 9 April 2021
  • == 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
  • 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
  • ...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
  • tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) -- permutation 1
    9 KB (1,368 words) - 02:54, 11 June 2023
  • 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
  • ...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

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