Search results

Jump to navigation Jump to search
  • [[User:ChrisKuklewicz|ChrisKuklewicz]] 14:05, 25 June 2007 (UTC) In response to the link to [http://www.cs.otago
    2 KB (310 words) - 14:05, 25 June 2007
  • [[User:ChrisKuklewicz|ChrisKuklewicz]] 11:53, 6 September 2010 (UTC) I use MacPorts for the infrastructure and c
    4 KB (610 words) - 12:25, 26 September 2012
  • Are you gong to submit this?'' -- ChrisKuklewicz
    2 KB (348 words) - 02:19, 8 October 2006
  • [[User:ChrisKuklewicz|ChrisKuklewicz]] 06:58, 21 August 2010 (UTC) The paper still mentions 6.10 as the newest G Also, in respose to ChrisKuklewicz, I think the type for "cons" is correct, but perhaps one instance should be
    14 KB (2,191 words) - 17:03, 18 February 2012
  • ...ant to use it. Would libpcre be a better choice?''--[[User:ChrisKuklewicz|ChrisKuklewicz]] 00:21, 24 February 2009 (UTC)
    4 KB (577 words) - 17:21, 4 February 2023
  • [[User:ChrisKuklewicz|ChrisKuklewicz]] 14:41, 23 February 2007 (UTC)
    14 KB (2,629 words) - 15:12, 23 February 2007
  • [[User:ChrisKuklewicz|ChrisKuklewicz]] 13:50, 21 February 2007 (UTC)
    8 KB (1,325 words) - 18:23, 21 February 2007
  • * ChrisKuklewicz wrote a bit of boilerplate to re-use IntSet and IntMap with any Enum type:
    17 KB (2,508 words) - 07:09, 8 June 2023
  • entry uses combined loops as well. So they will accept code like this.'' -- ChrisKuklewicz
    13 KB (1,795 words) - 04:56, 17 July 2007
  • ''Need to add my smaller/faster tweak to Joel's entry.'' -- ChrisKuklewicz .... Can you try passing architecture switches to -optc such as -mtune?'' -- ChrisKuklewicz
    85 KB (11,049 words) - 06:08, 21 February 2010
  • ....c] available from Glenn Fowler, the rest from the author of regex-tdfa ([[ChrisKuklewicz]]). Note that all of these tests are passed by regex-tdfa-0.97.1 (but not I, [[ChrisKuklewicz]], have managed to compile a "regex-ast" Haskell wrapper to this POSIX engi
    26 KB (3,619 words) - 03:30, 10 March 2017
  • ...I will explain in the (apples|oranges) section below [[User:ChrisKuklewicz|ChrisKuklewicz]] 15:56, 30 January 2007 (UTC)
    18 KB (2,819 words) - 19:20, 15 August 2019
  • ChrisKuklewicz writes: You are very close to what you want. Making SDL valid Haskell is
    9 KB (1,391 words) - 15:17, 6 February 2021
  • 56.38 -2.87 "TuringTest" # ChrisKuklewicz
    11 KB (1,031 words) - 06:16, 8 June 2023
  • -- ChrisKuklewicz
    20 KB (3,239 words) - 02:07, 26 April 2021
  • ...ew entry that reads well and avoids the memory leak of the old entry.'' -- ChrisKuklewicz ...rk it, see sections 5.1 and 5.2 for map and association list version.'' -- ChrisKuklewicz
    56 KB (8,172 words) - 22:25, 18 February 2010
  • ...en Aaron Denney's excellent entry (see bottom of page) and tweaked it. -- ChrisKuklewicz ...s version you are comparing to (which has an older Ch implementation)'' -- ChrisKuklewicz
    37 KB (4,961 words) - 07:55, 13 December 2009
  • ...slower on G4; still three times faster that the all parsec entry below) -- ChrisKuklewicz I (ChrisKuklewicz) have resurrected the "All parsec" proposal and crafted this entry. It use
    133 KB (20,540 words) - 08:31, 13 December 2009
  • By ChrisKuklewicz by ChrisKuklewicz
    67 KB (9,593 words) - 05:40, 9 March 2021
  • <li><p><em>regex-pcre 0.94.1</em>. Uploaded by ChrisKuklewicz.
    76 KB (9,269 words) - 19:17, 15 August 2019