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
• 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
• Aprende Haskell en 10 minutos
  Prelude> 4 ^ 2 - 1 Prelude> (1 - 5)^(3 * 2 - 4)
  14 KB (2,164 words) - 16:35, 9 October 2016
• HStringTemplate
  If this is rendered with "values" set to <hask>[1..4]</hask> the result will be: 1, 2, 3, 4
  12 KB (1,726 words) - 15:16, 6 February 2021
• New monads/MonadAdvSTM
  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
• Euler problems/181 to 190
  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
• HaskellWiki:Guidelines
  ...wser which doesn't support CSS would probably render page titles and level 1 headlines the same way. ...haskell&gt;</code> for full blocks.) See, for example, [[HaskellWiki:Style test]].
  6 KB (942 words) - 20:17, 8 April 2019
• Non-empty list
  test1 = safe_reverse [1,2,3] As we can see, the null test is algorithmic. After we've done it, head
  8 KB (1,274 words) - 20:23, 18 July 2014
• Contstuff
  "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
• FFI imports packaging utility
  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
• Import modules properly
  ...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
• WxHaskell/2.8
  ...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 select
  7 KB (1,057 words) - 03:54, 14 August 2021
• GHC/SuperClass
  * 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
• Avoiding IO
  ...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
• Type arithmetic
  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
• Regular expressions for XML Schema
  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, whet
  22 KB (3,425 words) - 22:34, 29 June 2021
• Arrow tutorial
  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 pair
  8 KB (1,315 words) - 00:43, 16 May 2024
• Shootout/SumFile
  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 t
  20 KB (3,239 words) - 02:07, 26 April 2021
• Hoogle
  * <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
• Programming performance
  {| border="1" cellspacing="0" cellpadding="5" align="center" | 1.5hr
  4 KB (638 words) - 23:08, 5 April 2021
• Real World Applications/Event Driven Applications
  return [EventAdd 1] Value is now: 1
  7 KB (1,076 words) - 08:53, 4 July 2014

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