Search results

Jump to: navigation, search
  • ...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,613 words) - 08:24, 16 November 2020
  • test/example code and had almost no implementation errors in the code! The // To sort array a[] of size n: qsort(a,0,n-1)
    26 KB (4,102 words) - 23:54, 29 February 2020
  • * <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
  • ...<tt>libreadline.so.3</tt> in <tt>/usr/lib</tt>. We tried this on a SuSE 7.1 box and it seemed to work, but YMMV. ghc-6.4.1: internal error: mallocBytesRWX: failed to protect 0x0x1660730
    36 KB (5,898 words) - 19:50, 3 February 2021
  • One of the project aims is to test the efficiency of a real-world CA ....): <EM>Applications of Functional Programming</EM>, UCL Press, 1995, ISBN 1-85728-377-5 HB.<br> From the cover: <blockquote> This book is unique in sho
    14 KB (2,253 words) - 01:06, 29 October 2016
  • ...It has crystal-clear illustrations and guided practice. You will write and test dozens of interesting programs and dive into custom Haskell modules. You wi ...], Paperback / eBook: 498 pages, Apress (January 2014), English, ISBN: 978-1-43026-250-3
    49 KB (7,108 words) - 11:51, 25 November 2021
  • In article <9pdvgc$u3d$1@news.fas.harvard.edu>, Ken Shan ...ecursions to screw in a light bulb, one to turn the light bulb once, and n-1 to screw it in.
    54 KB (8,771 words) - 11:52, 15 December 2021
  • <ul><li><p><em>ArrayRef 0.1.2</em>. Uploaded by Gwern Branwen. ...[http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ArrayRef-0.1.2 ArrayRef]: Unboxed references, dynamic arrays and more.</p></li>
    76 KB (9,269 words) - 19:17, 15 August 2019
  • 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
  • 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
  • h <- openRawFD "test" WriteMode transformer. If you don't use any encodings other than Latin-1 -- or
    21 KB (3,181 words) - 16:03, 14 March 2014
  • ...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
  • == Chapter 1: Ubiquitous "Hello world!" and other ways to do IO in Haskell == -- Taken from 'cd-fit-1-1.hs'
    71 KB (11,244 words) - 09:00, 4 May 2014
  • [x] -> 1 _ -> -1
    4 KB (584 words) - 13:24, 22 April 2021
  • 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
  • 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 (e
    17 KB (2,652 words) - 05:40, 6 April 2021
  • '''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) - 18:16, 20 July 2021
  • Tue Mar 1 03:13:08 EST 2005 into GHCi -- tested on GHCi 6.2.1 or GHCi snapshot 6.3.20041106. It
    20 KB (3,458 words) - 15:19, 6 February 2021
  • solve = forM [(i,j) | i <- [1..9], j <- [1..9]] $ \(i,j) -> do a <- option [1..9] -- pick a number
    67 KB (9,593 words) - 05:40, 9 March 2021
  • rhs = varE(as !! (i -1)) -- !! is 0 based as = [ mkName $ "a" ++ show i | i <- [1..n] ]
    30 KB (4,549 words) - 09:00, 18 July 2021

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