Showing 3,406,061–3,406,095 of 15,725,707 results
| 2007-03-10 14:28:44 +0100 | <lambdabot> | No matches, try a more general search |
| 2007-03-10 14:29:00 +0100 | <dons> | all of haskell is just sugar for case/let/apply/lambda in the end |
| 2007-03-10 14:29:05 +0100 | <dons> | which is useful to know |
| 2007-03-10 14:29:28 +0100 | <dons> | :t Data.ByteString.unpack . Data.ByteString.Char8.pack |
| 2007-03-10 14:29:32 +0100 | <lambdabot> | String -> [Word8] |
| 2007-03-10 14:29:44 +0100 | <dons> | oh, 1.30am, nightly cronjob running on lambdaobt's box |
| 2007-03-10 14:29:58 +0100 | <dancor> | lambdabox |
| 2007-03-10 14:30:25 +0100 | roconnor | (n=roconnor@69-12-240-152.dsl.dynamic.sonic.net) joined #haskell |
| 2007-03-10 14:30:28 +0100 | <emk> | dons: Ah, that's useful to know. The crypto library works entirely in terms of [Word8] lists. |
| 2007-03-10 14:31:04 +0100 | <dons> | yeah. it probably should use lazy bytestrings. you could ping Dominic about the darcs repo version he was working for this stuff, actually |
| 2007-03-10 14:31:12 +0100 | triplah_ | ("Leaving") |
| 2007-03-10 14:32:00 +0100 | <roconnor> | emk, my sha-2 implemenation sometimes uses [Word32] IIRC |
| 2007-03-10 14:32:00 +0100 | <dons> | mm. xmonad (our little window manager) is really rather nice. |
| 2007-03-10 14:32:21 +0100 | <emk> | dons: Yeah, that's probably a good idea. |
| 2007-03-10 14:32:35 +0100 | <roconnor> | I just join, so I missed what you were talking about, so maybe you should ignore me |
| 2007-03-10 14:32:48 +0100 | roconnor | is still sleepy |
| 2007-03-10 14:32:52 +0100 | <dons> | no no, roconnor, always relevant :-) |
| 2007-03-10 14:32:52 +0100 | <dancor> | is there a uniquifier for lists |
| 2007-03-10 14:32:56 +0100 | <dons> | nub |
| 2007-03-10 14:33:05 +0100 | <dancor> | equiv to Set.toList . Set.fromList |
| 2007-03-10 14:33:06 +0100 | <dons> | > nub [1,2,1,2,3,4,1] |
| 2007-03-10 14:33:08 +0100 | <lambdabot> | [1,2,3,4] |
| 2007-03-10 14:33:10 +0100 | <dancor> | ah |
| 2007-03-10 14:33:24 +0100 | <dons> | or go via Sets/ or sort a Map |
| 2007-03-10 14:34:08 +0100 | <roconnor> | > nub [1,2,1,2,4,3,1] |
| 2007-03-10 14:34:10 +0100 | <lambdabot> | [1,2,4,3] |
| 2007-03-10 14:34:23 +0100 | <roconnor> | > (Set.toList . Set.fromList) [1,2,1,2,4,3,1] |
| 2007-03-10 14:34:24 +0100 | <lambdabot> | Not in scope: `Set.fromList' |
| 2007-03-10 14:34:35 +0100 | <roconnor> | well, they are different |
| 2007-03-10 14:34:43 +0100 | <dancor> | :t toList |
| 2007-03-10 14:34:46 +0100 | <lambdabot> | Not in scope: `toList' |
| 2007-03-10 14:34:46 +0100 | <roconnor> | nub doesn't return a sorted list |
| 2007-03-10 14:34:49 +0100 | <dancor> | :t S.toList |
| 2007-03-10 14:34:52 +0100 | <lambdabot> | forall a. S.Set a -> [a] |
| 2007-03-10 14:35:05 +0100 | <roconnor> | > (S.toList . S.fromList) [1,2,1,2,4,3,1] |