Newest at the top
2025-03-20 11:18:42 +0100 | yin | (~z@user/zero) (Ping timeout: 244 seconds) |
2025-03-20 11:15:27 +0100 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) (Quit: WeeChat 4.5.2) |
2025-03-20 11:14:36 +0100 | sprotte24 | (~sprotte24@p200300d16f3eed002d97e289dca6fdd9.dip0.t-ipconnect.de) |
2025-03-20 11:09:31 +0100 | merijn | (~merijn@77.242.116.146) merijn |
2025-03-20 11:00:32 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 272 seconds) |
2025-03-20 10:59:43 +0100 | ubert | (~Thunderbi@2a02:8109:ab8a:5a00:8edc:7567:8376:630e) ubert |
2025-03-20 10:58:15 +0100 | kuribas | (~user@ip-188-118-57-242.reverse.destiny.be) kuribas |
2025-03-20 10:54:45 +0100 | krei-se | (~krei-se@p3ee0faf4.dip0.t-ipconnect.de) krei-se |
2025-03-20 10:51:21 +0100 | merijn | (~merijn@77.242.116.146) merijn |
2025-03-20 10:46:38 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 245 seconds) |
2025-03-20 10:43:00 +0100 | krei-se | (~krei-se@p3ee0faf4.dip0.t-ipconnect.de) (Quit: ZNC 1.9.1 - https://znc.in) |
2025-03-20 10:42:28 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 245 seconds) |
2025-03-20 10:41:44 +0100 | merijn | (~merijn@77.242.116.146) merijn |
2025-03-20 10:41:09 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 265 seconds) |
2025-03-20 10:39:49 +0100 | <[exa]> | well sounds to me like I'm FFIing to C :D |
2025-03-20 10:38:13 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
2025-03-20 10:23:48 +0100 | dhil | (~dhil@2a0c:b381:52e:3600:f2d3:292b:64f1:45c9) dhil |
2025-03-20 10:20:19 +0100 | <tomsmeding> | hah |
2025-03-20 10:20:02 +0100 | <Athas> | Clearly the best solution must be https://hackage.haskell.org/package/futhark-server |
2025-03-20 10:18:49 +0100 | <tomsmeding> | sigh |
2025-03-20 10:18:21 +0100 | mange | (~user@user/mange) (Quit: Zzz...) |
2025-03-20 10:18:18 +0100 | <Athas> | And looks completely sequential. |
2025-03-20 10:18:09 +0100 | <Athas> | [exa]: 'tally' sorts the array. |
2025-03-20 10:13:11 +0100 | ash3en | (~Thunderbi@ip1f10cbd6.dynamic.kabel-deutschland.de) (Ping timeout: 268 seconds) |
2025-03-20 10:11:57 +0100 | <[exa]> | yeah good catch, let's take that apart |
2025-03-20 10:11:44 +0100 | <[exa]> | tomsmeding: it's very similar, and I actually need counting |
2025-03-20 10:11:13 +0100 | j1n37- | (~j1n37@user/j1n37) j1n37 |
2025-03-20 10:11:11 +0100 | <tomsmeding> | [exa]: does massiv's `tally` do what you want? |
2025-03-20 10:11:01 +0100 | j1n37 | (~j1n37@user/j1n37) (Ping timeout: 244 seconds) |
2025-03-20 10:10:49 +0100 | <tomsmeding> | correction, it's parallel |
2025-03-20 10:10:17 +0100 | <tomsmeding> | also, repa has no sort, only massiv seems to, and that sequential |
2025-03-20 10:09:59 +0100 | <Athas> | Yeah, but it's slow as hell unless you have a really snappy sort. |
2025-03-20 10:09:59 +0100 | <[exa]> | Athas: my data is too fat to get sorted efficiently (you'd die on memory throughput of the sort) |
2025-03-20 10:09:37 +0100 | <tomsmeding> | but at least you can do so! |
2025-03-20 10:09:28 +0100 | <tomsmeding> | and then write your own segmented reduction because none are provided |
2025-03-20 10:09:05 +0100 | <Athas> | Here's a solution you won't like: sorting followed by a segmented reduction is asymptotically optimal. |
2025-03-20 10:08:57 +0100 | econo_ | (uid147250@id-147250.tinside.irccloud.com) (Quit: Connection closed for inactivity) |
2025-03-20 10:08:08 +0100 | alecs | (~alecs@nat16.software.imdea.org) alecs |
2025-03-20 10:07:18 +0100 | k_hachig | (~k_hachig@2607:fea8:351d:ef0:7025:bda8:57fd:1c3b) (Ping timeout: 252 seconds) |
2025-03-20 10:05:26 +0100 | <[exa]> | need the sparsity here, unfortunately |
2025-03-20 10:05:16 +0100 | <[exa]> | Athas: I've got a bit too many bins which are huge |
2025-03-20 10:05:04 +0100 | <tomsmeding> | with a fold per bin, right |
2025-03-20 10:04:53 +0100 | <Athas> | If you have few bins, just do an outer loop over all bins. |
2025-03-20 10:04:30 +0100 | <[exa]> | :D |
2025-03-20 10:04:29 +0100 | ljdarj | (~Thunderbi@user/ljdarj) ljdarj |
2025-03-20 10:04:22 +0100 | <tomsmeding> | it's extremely hard to do so OK if you get zero primitives for them. :P |
2025-03-20 10:04:13 +0100 | <Athas> | But my experience is that they don't crop up so often. |
2025-03-20 10:04:04 +0100 | <Athas> | It's not so easy to do efficiently, but it's not so hard to do OK. |
2025-03-20 10:03:41 +0100 | <tomsmeding> | Athas: you don't happen to know this, do you? |
2025-03-20 10:03:29 +0100 | <tomsmeding> | I'm very confused why neither repa nor massiv seem to have a histogram operation of any kind |