| zbrown | ? |
| narain | zbrown: nub |
| zbrown | thanks |
| narain | > nub [1,2,1,5,3,2,4,3] |
| lambdabot | [1,2,5,3,4] |
| LoganCapaldo | > let s = (0,0) : [ (a+2, b+3) | (a, b) <- s ] in s |
| lambdabot | [(0,0),(2,3),(4,6),(6,9),(8,12),(10,15),(12,18),(14,21),(16,24),(18,27),(20,... |
| zbrown | LoganCapaldo: and then i need a+3, b+2 |
| LoganCapaldo | So add them |
| zbrown | not to mention a+3,b+2 applied to list 1, and a+2,b+3 applied to list 2 hmmm lets see |
| narain | zbrown: interesting problem that should have an impressively elegant haskell solution, only i don't know what it is |
| zbrown | narain: ya im trying to find an elegant solution |
| narain | > let s = (0,0) : concatMap (\(a,b) -> [(a+2,b+3),(a+3,(b+2)]) s in s |
| mux | go open source! |
| dons | dcoutts and i'll be doing quite a bit of bytestring hacking i nteh coming weeks, so its good to have nhc98 support now. |
| malcolmw | yeah, I heard dcoutts will be in oz for a bit dons: how come hbc seems to be totally broken on x86? |
| triplah_ | mux: what project? :\ |
| mux | triplah_: FreeBSD |
| triplah_ | mux: argh :| |
| mux | someone didn't get the *sleep()/wakeup() API and is butchering manpages |
| triplah_ | :\ revert is your friend |
| mux | we're not supposed to just plain revert other people's changes :-) |
| triplah_ | haha |
| quicksilver | make a change yourself, then |
| mux | it would lead to endless commit wars, and we've had enough of those in the past |
| quicksilver | and then revert *that* all the way back |
| mux | no, I'm just harping on him with mails, as other devs are doing |
| quicksilver | :) |
| mux | so that at some point he'll either back out, or we'll have sufficient claims that his change is wrong for core@ to back it out |
| Cff | @hoogle map |
| lambdabot | Prelude.map :: (a -> b) -> [a] -> [b] Data.IntMap.map :: (a -> b) -> IntMap a -> IntMap b Data.IntSet.map :: (Int -> Int) -> IntSet -> IntSet |
| Cff | neat |
| mux | 40985 root 1 96 0 4287M 4274M select 0 391:01 4.93% snmpd ouch |