Logs: freenode/#haskell
| 2020-10-13 02:26:20 | → | Saukk joins (~Saukk@2001:998:f1:3966:96a6:dee2:2e9:fdf3) |
| 2020-10-13 02:27:05 | × | theDon quits (~td@muedsl-82-207-238-192.citykom.de) (Ping timeout: 240 seconds) |
| 2020-10-13 02:28:59 | → | vicfred_ joins (~vicfred@unaffiliated/vicfred) |
| 2020-10-13 02:29:02 | → | theDon joins (~td@muedsl-82-207-238-211.citykom.de) |
| 2020-10-13 02:29:34 | × | solonarv quits (~solonarv@anancy-651-1-202-101.w109-217.abo.wanadoo.fr) (Ping timeout: 258 seconds) |
| 2020-10-13 02:31:36 | × | vicfred quits (~vicfred@unaffiliated/vicfred) (Ping timeout: 272 seconds) |
| 2020-10-13 02:35:39 | × | dftxbs3e quits (~dftxbs3e@unaffiliated/dftxbs3e) (Remote host closed the connection) |
| 2020-10-13 02:36:24 | → | justanotheruser joins (~justanoth@unaffiliated/justanotheruser) |
| 2020-10-13 02:36:29 | → | dftxbs3e joins (~dftxbs3e@unaffiliated/dftxbs3e) |
| 2020-10-13 02:39:15 | → | merijn joins (~merijn@83-160-49-249.ip.xs4all.nl) |
| 2020-10-13 02:46:07 | × | machinedgod quits (~machinedg@24.105.81.50) (Ping timeout: 256 seconds) |
| 2020-10-13 02:46:25 | <koz_> | ski: I think they meant an invariant functor. |
| 2020-10-13 02:47:38 | → | thir joins (~thir@p200300f27f02580060eb7dde324e54c8.dip0.t-ipconnect.de) |
| 2020-10-13 02:48:22 | → | dyeplexer joins (~lol@unaffiliated/terpin) |
| 2020-10-13 02:51:55 | × | thir quits (~thir@p200300f27f02580060eb7dde324e54c8.dip0.t-ipconnect.de) (Ping timeout: 240 seconds) |
| 2020-10-13 02:53:25 | × | fresheyeball quits (~isaac@c-71-237-105-37.hsd1.co.comcast.net) (Quit: WeeChat 2.7.1) |
| 2020-10-13 02:53:57 | → | topos joins (sid467876@gateway/web/irccloud.com/x-gyqsqvcawuyxkhnv) |
| 2020-10-13 03:00:01 | × | ccallahan1 quits (~ccallahan@185.204.1.185) () |
| 2020-10-13 03:03:28 | × | darjeeli1 quits (~darjeelin@122.245.210.138) (Ping timeout: 256 seconds) |
| 2020-10-13 03:04:52 | → | Stanley00 joins (~stanley00@unaffiliated/stanley00) |
| 2020-10-13 03:05:10 | × | SupaYoshi quits (~supayoshi@213-10-140-13.fixed.kpn.net) (Ping timeout: 272 seconds) |
| 2020-10-13 03:05:14 | → | SupaYoshii joins (~supayoshi@213-10-140-13.fixed.kpn.net) |
| 2020-10-13 03:09:07 | <Axman6> | gentauro, justsomeguy: IIRC Indian numbers are often divided in a way similar to what I did, I don't remember the details but think it was something like four digits and then the rest are grouped by two digits |
| 2020-10-13 03:10:33 | <Axman6> | looks like it's three, then twos |
| 2020-10-13 03:11:50 | <Axman6> | Crore => 1,00,00,000, Lakh Crore => 10,00,00,00,00,000 |
| 2020-10-13 03:13:25 | × | merijn quits (~merijn@83-160-49-249.ip.xs4all.nl) (Ping timeout: 264 seconds) |
| 2020-10-13 03:15:56 | → | nyaomi joins (~naomi@cpe-74-75-6-125.maine.res.rr.com) |
| 2020-10-13 03:16:25 | → | darjeeli1 joins (~darjeelin@122.245.216.36) |
| 2020-10-13 03:21:09 | → | vincenz joins (~chris@104-1-91-5.lightspeed.sntcca.sbcglobal.net) |
| 2020-10-13 03:21:15 | vincenz | waves |
| 2020-10-13 03:23:20 | <Axman6> | o/ |
| 2020-10-13 03:23:37 | → | xerox_ joins (~xerox@unaffiliated/xerox) |
| 2020-10-13 03:25:23 | <jackdk> | Is there a library which provides a convenient function of this type: `HashMap k1 (HashMap k2 v) -> HashMap k2 (HashMap k1 v)`? It felt like `distributive`, but that package doesn't seem to do instances for things in `containers` and I may have misunderstood its theory |
| 2020-10-13 03:25:53 | × | ericsagnes quits (~ericsagne@2405:6580:0:5100:fd7f:2256:81b3:b295) (Ping timeout: 246 seconds) |
| 2020-10-13 03:26:10 | <ski> | yea, i realized, koz_ |
| 2020-10-13 03:26:22 | <vincenz> | Hi ski |
| 2020-10-13 03:26:29 | <ski> | hello vincenz |
| 2020-10-13 03:27:25 | × | Tario quits (~Tario@201.192.165.173) (Ping timeout: 240 seconds) |
| 2020-10-13 03:27:27 | <ski> | jackdk : looks like a kind of "transposition". perhaps you can find one that first goes to `HashMap (k1,k2) v' ? |
| 2020-10-13 03:29:01 | × | xerox_ quits (~xerox@unaffiliated/xerox) (Ping timeout: 264 seconds) |
| 2020-10-13 03:29:22 | → | dave_uy joins (~david@108.61.193.26) |
| 2020-10-13 03:30:36 | → | bcmiller joins (~bm3719@66.42.95.185) |
| 2020-10-13 03:30:40 | → | byorgey joins (~byorgey@155.138.238.211) |
| 2020-10-13 03:34:15 | <vincenz> | ski been a while |
| 2020-10-13 03:35:04 | × | wroathe quits (~wroathe@c-68-54-25-135.hsd1.mn.comcast.net) (Quit: leaving) |
| 2020-10-13 03:36:23 | <jackdk> | ski: well sure: I can `fmap toList`, then toList, then rebuild the table. But that might not be quite what you're asking? |
| 2020-10-13 03:37:05 | × | da39a3ee5e6b4b0d quits (~textual@n11211935170.netvigator.com) (Quit: My MacBook has gone to sleep. ZZZzzz…) |
| 2020-10-13 03:38:30 | → | ericsagnes joins (~ericsagne@2405:6580:0:5100:9db:d3a4:6a7a:3b95) |
| 2020-10-13 03:38:54 | <Axman6> | :t Map.toList . fmap Map.toList |
| 2020-10-13 03:38:55 | <lambdabot> | error: |
| 2020-10-13 03:38:55 | <lambdabot> | Not in scope: ‘Map.toList’ |
| 2020-10-13 03:38:55 | <lambdabot> | Perhaps you meant one of these: |
| 2020-10-13 03:39:01 | <Axman6> | :t M.toList . fmap M.toList |
| 2020-10-13 03:39:03 | <lambdabot> | M.Map k1 (M.Map k2 a) -> [(k1, [(k2, a)])] |
| 2020-10-13 03:39:20 | → | drbean joins (~drbean@TC210-63-209-59.static.apol.com.tw) |
| 2020-10-13 03:40:39 | <Axman6> | jackdk: this feels like a thing that reflex would have implemented somewhere (with efficient observations n' stuff) |
| 2020-10-13 03:41:04 | <ski> | vincenz : yep |
| 2020-10-13 03:43:18 | → | falafel joins (~falafel@2605:e000:1527:d491:1ccf:5c8d:7928:e9cc) |
| 2020-10-13 03:43:30 | <jackdk> | so the reason we can't have Distributive and (and therefore not Representable either) is that you need an isomorphism to `(->) x` for some x. Which we don't have; we have like an isomorphism `HashMap k <-> Compose ((->) k) Maybe` or something |
| 2020-10-13 03:47:16 | → | merijn joins (~merijn@83-160-49-249.ip.xs4all.nl) |
| 2020-10-13 03:49:54 | <vincenz> | Is there a type for a vector of N values? |
| 2020-10-13 03:49:59 | <vincenz> | Where N is fixed |
| 2020-10-13 03:50:17 | → | Tario joins (~Tario@201.192.165.173) |
| 2020-10-13 03:51:33 | <jackdk> | https://hackage.haskell.org/package/vector-sized |
| 2020-10-13 03:51:35 | <jackdk> | maybe? |
| 2020-10-13 03:51:47 | × | polyrain_ quits (~polyrain@2001:8003:e501:6901:39c5:19e3:cc60:4fe5) (Quit: My MacBook has gone to sleep. ZZZzzz…) |
| 2020-10-13 03:51:59 | <jackdk> | the `linear` package also has some short vectors useful for 3D sort of work |
| 2020-10-13 03:52:40 | × | merijn quits (~merijn@83-160-49-249.ip.xs4all.nl) (Ping timeout: 272 seconds) |
| 2020-10-13 03:52:57 | <vincenz> | I'm trying to define a partial order on a pareto space |
| 2020-10-13 03:53:57 | <vincenz> | Thanks! jackdk, that seems better than the one I was looking ato |
| 2020-10-13 03:56:58 | <jackdk> | I don't know those mathswords but good luck |
| 2020-10-13 03:57:51 | <Axman6> | he's talking about the birds space pirates have |
| 2020-10-13 03:57:53 | → | ensyde joins (~ensyde@2600:1702:2e30:1a40:f09c:a012:516e:b253) |
| 2020-10-13 03:59:21 | <jackdk> | rawk |
| 2020-10-13 04:02:09 | <jackdk> | so there's not a map-specialised transposition function I'm aware of. Has anyone seen one like it for lists? `[(a,[(b,c)])] -> [(b,[(a,c)])]`? |
| 2020-10-13 04:02:41 | × | ensyde quits (~ensyde@2600:1702:2e30:1a40:f09c:a012:516e:b253) (Ping timeout: 272 seconds) |
| 2020-10-13 04:03:48 | → | Volt_ joins (~Volt_@c-73-145-164-70.hsd1.mi.comcast.net) |
| 2020-10-13 04:05:42 | × | falafel quits (~falafel@2605:e000:1527:d491:1ccf:5c8d:7928:e9cc) (Ping timeout: 260 seconds) |
| 2020-10-13 04:08:37 | × | balbirs quits (~balbirs__@ozlabs.org) (Ping timeout: 260 seconds) |
| 2020-10-13 04:10:38 | → | Jeanne-Kamikaze joins (~Jeanne-Ka@68.235.43.86) |
| 2020-10-13 04:10:39 | <Axman6> | should be pretty simple with a list comprehension |
| 2020-10-13 04:12:13 | × | geowiesnot quits (~user@87-89-181-157.abo.bbox.fr) (Ping timeout: 264 seconds) |
| 2020-10-13 04:14:08 | → | da39a3ee5e6b4b0d joins (~textual@n11211935170.netvigator.com) |
| 2020-10-13 04:14:40 | × | conal quits (~conal@64.71.133.70) (Quit: Computer has gone to sleep.) |
| 2020-10-13 04:15:08 | <dibblego> | https://github.com/qfpl/separated/blob/master/src/Data/Separated.hs#L902 |
| 2020-10-13 04:15:50 | <Axman6> | "[5,'x',6]" I beg your pardon what is this nonsense |
| 2020-10-13 04:16:19 | <jackdk> | I do not understand what I am looking at |
| 2020-10-13 04:16:29 | <Axman6> | :aliens: |
| 2020-10-13 04:16:35 | × | nbloomf quits (~nbloomf@2600:1700:83e0:1f40:842d:ee09:f1b5:9acd) (Quit: My MacBook has gone to sleep. ZZZzzz…) |
| 2020-10-13 04:17:04 | <dibblego> | actually it's a bit different to what you wrote |
| 2020-10-13 04:17:37 | → | conal joins (~conal@64.71.133.70) |
| 2020-10-13 04:18:22 | × | conal quits (~conal@64.71.133.70) (Client Quit) |
| 2020-10-13 04:18:47 | <Axman6> | :t lef f mmp = fold [ (k2,M.singleton k1 v) | (k1,vs) <- M.toList mmp, (k2,v) <- M.toList vs in f |
| 2020-10-13 04:18:49 | <lambdabot> | error: parse error on input ‘=’ |
| 2020-10-13 04:18:59 | × | da39a3ee5e6b4b0d quits (~textual@n11211935170.netvigator.com) (Ping timeout: 260 seconds) |
| 2020-10-13 04:19:05 | <Axman6> | :t let f mmp = fold [ (k2,M.singleton k1 v) | (k1,vs) <- M.toList mmp, (k2,v) <- M.toList vs] in f |
| 2020-10-13 04:19:07 | <lambdabot> | (Monoid a1, Ord k) => M.Map k (M.Map a1 a2) -> (a1, M.Map k a2) |
| 2020-10-13 04:19:37 | <Axman6> | :t let f mmp = M.fromListWith M.union [ (k2,M.singleton k1 v) | (k1,vs) <- M.toList mmp, (k2,v) <- M.toList vs] in f |
| 2020-10-13 04:19:39 | <lambdabot> | (Ord k1, Ord k2) => M.Map k2 (M.Map k1 a) -> M.Map k1 (M.Map k2 a) |
| 2020-10-13 04:19:40 | × | vicfred_ quits (~vicfred@unaffiliated/vicfred) (Quit: Leaving) |
All times are in UTC.