Akii 2017-02-04 23:45:11
decode "defers conversion"
zipper 2017-02-04 23:45:48
Akii: SMH how did I miss that? :(
Akii 2017-02-04 23:46:25
well interesting detail I didn't know
Akii 2017-02-04 23:46:56
this also seems to be kind of a konvention; e. g. see foldl'
Akii 2017-02-04 23:47:00
and stuff
the_2nd 2017-02-04 23:55:29
How can I convert a [Maybe a] -> Maybe [a] where result is just if all inital values were just
the_2nd 2017-02-04 23:55:50
sequence looks similar to what I want
wz1000 2017-02-05 00:10:59
How do I define the fixity of type operators?
phadej 2017-02-05 00:16:20
wz1000: in the very same way as for value-level
wz1000 2017-02-05 00:17:49
phadej: How are ambiguities resolved?
wz1000 2017-02-05 00:18:00
Supposing I use the same operator on the type and value level
phadej 2017-02-05 00:18:43
AFAICS they have to have same fixity
phadej 2017-02-05 00:18:55
(otherwise it would be confusing)
pavonia 2017-02-05 00:30:26
This is more an algorithm question, but I can't seem to come up with how to transform a list L of 2k elements into 2k-1 sublists of k pairs (order doesn't matter) such that a) each sublist includes all elements of L, b) there's no duplicate pair in all the sublists, and c) all possible pairs are present in all the sublists
pavonia 2017-02-05 00:31:08
e.g. [0,1,2,3] would become [[(0,1),(2,3)], [(0,2),(1,3)], [(0,3),(1,2)]]
dramforever 2017-02-05 00:34:40
the_2nd: catMaybes
dramforever 2017-02-05 00:34:48
But you're gone?
dramforever 2017-02-05 00:34:53
:t catMaybes
lambdabot 2017-02-05 00:34:55
[Maybe a] -> [a]
dramforever 2017-02-05 00:35:18
:t sequence -- sorry I meant this
lambdabot 2017-02-05 00:35:29
(Traversable t, Monad m) => t (m a) -> m (t a)
tfc 2017-02-05 00:35:42
dramforever: i was also about to answer sequence. but he was gone already.
dramforever 2017-02-05 00:36:19
Let's hope he figured it out
tfc 2017-02-05 00:42:14
dramforever: got to love the feature of hoogle to query for types of functions. :D
dramforever 2017-02-05 00:43:17
If this were javascript I would never figure this out
dramforever 2017-02-05 00:43:29
BECAUSE practically no types
tfc 2017-02-05 00:43:43
dramforever: i hate all languages with dynamic types. it's just not for me.
tfc 2017-02-05 00:44:06
i've built complex things in python and shoot in my foot all the time for the same reasons: type errors
systadmin 2017-02-05 00:53:20
Hi
dramforever 2017-02-05 00:57:00
systadmin: Hi :)
dramforever 2017-02-05 00:57:48
If you've got any questions just ask and you'll get answers if someone knows and sees you :)
ph88 2017-02-05 00:59:36
i'm not sure how to read this https://hackage.haskell.org/package/base-4.9.1.0/docs/src/GHC.Unicode.html#isSpace could anyone tell me if it matches 0x202f unicode for NARROW NO-BREAK SPACE ?
ph88 2017-02-05 01:00:08
let me try, d0h
dramforever 2017-02-05 01:00:32
> isSpace '\x202f'
lambdabot 2017-02-05 01:00:34
True
dramforever 2017-02-05 01:00:38
Yes it is space
ph88 2017-02-05 01:00:45
oh it does
dramforever 2017-02-05 01:00:45
> isSpace '\x203f' -- sanity check
lambdabot 2017-02-05 01:00:48
False
ph88 2017-02-05 01:00:53
o_O
dramforever 2017-02-05 01:00:54
Looks good enough
ph88 2017-02-05 01:01:04
ok
xa0 2017-02-05 01:15:18
any difference between break isSpace and head.lex
xa0 2017-02-05 01:15:36
oh, wtf, what a timely coincidence you're already talking about it
xa0 2017-02-05 01:16:15
whutevs
dramforever 2017-02-05 01:17:53
> lex "1,2,3,4,5"
lambdabot 2017-02-05 01:17:56
[("1",",2,3,4,5")]
dramforever 2017-02-05 01:18:06
> break isSpace "1,2,3,4,5"
lambdabot 2017-02-05 01:18:08
("1,2,3,4,5","")
dramforever 2017-02-05 01:18:14
xa0: yes, obviously
xa0 2017-02-05 01:19:47
oh right yeah
xa0 2017-02-05 01:20:00
i forgot what lex did
