Newest at the top
| 2025-02-03 14:37:25 +0100 | Square2 | (~Square4@user/square) (Ping timeout: 248 seconds) |
| 2025-02-03 14:24:31 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) L29Ah |
| 2025-02-03 14:13:34 +0100 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) (Quit: WeeChat 4.4.2) |
| 2025-02-03 14:13:29 +0100 | sprotte24 | (~sprotte24@p200300d16f26a80008f1d39836015ac5.dip0.t-ipconnect.de) (Quit: Leaving) |
| 2025-02-03 14:12:35 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 252 seconds) |
| 2025-02-03 14:08:28 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-02-03 13:46:32 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-02-03 13:44:34 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 260 seconds) |
| 2025-02-03 13:44:17 +0100 | rvalue- | rvalue |
| 2025-02-03 13:40:47 +0100 | <int-e> | and it's unsafe precisely because of that |
| 2025-02-03 13:40:45 +0100 | <mreh> | oh, handy |
| 2025-02-03 13:40:36 +0100 | <int-e> | there's unsafeNew that skips that step |
| 2025-02-03 13:40:34 +0100 | <mreh> | thanks again! |
| 2025-02-03 13:40:32 +0100 | <mreh> | int-e: yeah, just trying to grok that now |
| 2025-02-03 13:40:21 +0100 | <mreh> | it doesn't matter, I'm going to write to every element, thanks everyone |
| 2025-02-03 13:40:19 +0100 | <int-e> | mreh: it initializes all bytes to 0, https://hackage.haskell.org/package/vector-0.13.2.0/docs/src/Data.Vector.Storable.Mutable.html#sto… |
| 2025-02-03 13:39:35 +0100 | <mreh> | apparently storables have a zero |
| 2025-02-03 13:38:57 +0100 | <merijn> | And/or return garbage |
| 2025-02-03 13:37:51 +0100 | <merijn> | mreh: Crash, presumably :p |
| 2025-02-03 13:37:24 +0100 | <mreh> | if ST is deterministic what does Data-Vector-Storable-Mutable.new do with unitialised memory? |
| 2025-02-03 13:36:33 +0100 | rvalue | (~rvalue@user/rvalue) (Ping timeout: 248 seconds) |
| 2025-02-03 13:35:40 +0100 | rvalue- | (~rvalue@user/rvalue) rvalue |
| 2025-02-03 13:35:26 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) (Read error: Connection timed out) |
| 2025-02-03 13:34:59 +0100 | <mreh> | thanks |
| 2025-02-03 13:34:54 +0100 | <mreh> | int-e: I immediately went to unboxed arrays, for some reason, but this is a good idea |
| 2025-02-03 13:33:17 +0100 | <lxsameer> | mauke: is that for me? |
| 2025-02-03 13:32:38 +0100 | <mauke> | is that a yes or a no? |
| 2025-02-03 13:32:29 +0100 | <lxsameer> | mreh: maybe. thank you |
| 2025-02-03 13:32:12 +0100 | <int-e> | mreh: and mutable arrays of vectors |
| 2025-02-03 13:32:01 +0100 | <int-e> | mreh: sure, that's why you want to use ST (or IO) |
| 2025-02-03 13:31:59 +0100 | <mreh> | lxsameer: Multiparameter type class? |
| 2025-02-03 13:31:28 +0100 | <mreh> | int-e: I guess I'm trying to avoid doing allocations for every pixel |
| 2025-02-03 13:31:24 +0100 | <lxsameer> | mauke: I have two type A and B, I want foo to accept either of them as input |
| 2025-02-03 13:30:20 +0100 | <mauke> | what, like show? |
| 2025-02-03 13:29:53 +0100 | <lxsameer> | is there any way to write a polymorphic function like foo :: a -> Text but limit a to only couple of types? |
| 2025-02-03 13:28:44 +0100 | <int-e> | mreh: ^ |
| 2025-02-03 13:28:37 +0100 | <int-e> | Ah. Hrm. I'd think the low-level API is Storable. Maybe Data.Vector.Storable.Mutable is a good higher level abstraction for your purposes? |
| 2025-02-03 13:28:13 +0100 | <smiesner> | what is Hydra exactly? https://hackage.haskell.org/package/hydra. What do I transform with it? models? meta models? |
| 2025-02-03 13:24:34 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 252 seconds) |
| 2025-02-03 13:23:17 +0100 | <mreh> | there might be a lower level API, just checking |
| 2025-02-03 13:23:04 +0100 | <mreh> | ...which give you a `Ptr a` for a chunk of mapped memory for use in buffers |
| 2025-02-03 13:22:11 +0100 | <mreh> | int-e: It's a little above the FFI, I'm using Vulkan bindings someone else wrote. |
| 2025-02-03 13:20:24 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-02-03 13:19:03 +0100 | <int-e> | mreh: if this is just at the FFI boundary, GHC has an extension to pass ByteArray# variants as pointers, so you don't have to convert to Addr# or Ptr a at all: https://ghc.gitlab.haskell.org/ghc/doc/users_guide/exts/ffi.html#unlifted-ffi-types |
| 2025-02-03 13:13:20 +0100 | CiaoSen | (~Jura@2a05:5800:26f:a800:ca4b:d6ff:fec1:99da) CiaoSen |
| 2025-02-03 13:10:38 +0100 | monochrm | monochrom |
| 2025-02-03 13:10:38 +0100 | monochrom | (trebla@216.138.220.146) (Ping timeout: 252 seconds) |
| 2025-02-03 13:09:00 +0100 | monochrm | (trebla@216.138.220.146) |
| 2025-02-03 13:06:09 +0100 | SlackCoder | (~SlackCode@64-94-63-8.ip.weststar.net.ky) SlackCoder |
| 2025-02-03 13:03:33 +0100 | <mreh> | so I figured STUArray was the way to go |