!VRULIdgoKmKPzJZzjj:nixos.org

Nix Hackers

898 Members
For people hacking on the Nix package manager itself191 Servers

Load older messages


SenderMessageTime
22 Oct 2024
@fernsehmuell:matrix.org@fernsehmuell:matrix.org set a profile picture.18:13:43
23 Oct 2024
@luna-null:matrix.org@luna-null:matrix.org changed their display name from Autumn to luna-null.09:49:18
@fernsehmuell:matrix.org@fernsehmuell:matrix.org left the room.19:11:39
@aktaboot:tchncs.deaktaboot changed their profile picture.19:53:57
@drewrypope:matrix.orgDrewry Pope joined the room.20:58:47
24 Oct 2024
@nerves:bark.lgbt@nerves:bark.lgbt joined the room.02:20:24
@connorbaker:matrix.orgconnor (burnt/out) (UTC-8) Caveat to my question: I’m not as familiar as I’d like to be with this aspect of interpreters or implementations of languages, so apologies if it doesn’t make sense.
From my understanding of how lists and attribute sets are implemented, they are not persistent data structures (I remember seeing a lot of memory allocations followed by calls to memcpy). Is that correct?
If it is, is it possible persistent data structures could improve evaluation performance by allowing reuse? Or is it already known it would not, either due to other properties of the implementation (like GC behavior).
To be clear, I’m not implying that this should be a goal for the team — it’s more of a question in general about interpreted functional languages with a GC.
16:59:01
@diveshmahajan:matrix.orgDivesh joined the room.18:04:34
25 Oct 2024
@lholh:matrix.orglholh joined the room.03:53:31
@Lucus:matrix.org@Lucus:matrix.org left the room.07:29:30
@oak:universumi.fioak 🏳️‍🌈♥️ joined the room.08:02:33
@mel05saq:inphima.de@mel05saq:inphima.de joined the room.08:02:39
@mel05saq:inphima.de@mel05saq:inphima.de set a profile picture.15:17:39
26 Oct 2024
@vimfn:matrix.orgvimfn joined the room.03:35:25
@plmh:matrix.orgplmh joined the room.05:18:46
@joerg:thalheim.ioMic92 connor (he/him) (UTC-7): that's also a hunch that I have. But I never tested/measured if it is true. I also found this library: https://sinusoid.es/immer/ which does even support boemgc (just like nix) 09:01:05
@joerg:thalheim.ioMic92It shouldn't be too complicated to try it out for attrsets I think09:01:28
@svrana:matrix.orgsvrana left the room.15:51:41
@svrana:matrix.orgsvrana joined the room.15:53:29
@ubalot:matrix.orgubalot joined the room.16:05:09
@numinit:matrix.orgMorgan (@numinit) left the room.23:46:30
@numinit:matrix.orgMorgan (@numinit) joined the room.23:47:43
27 Oct 2024
@numinit:matrix.orgMorgan (@numinit) set a profile picture.07:18:28
@rczb:envs.net@rczb:envs.net joined the room.08:08:26
@rczb:envs.net@rczb:envs.net left the room.08:09:18
@jolly.roberts:matrix.org@jolly.roberts:matrix.org joined the room.15:19:15
29 Oct 2024
@samuel:mnzn.devSamuel joined the room.03:18:06
@connorbaker:matrix.orgconnor (burnt/out) (UTC-8) I decided to start with lists hoping it’d be a smaller change
I have to say I don’t understand the rules governing lifetime of values
I also think the way Values are constructed (pointers and mutation) makes it difficult to use immer in an idiomatic way (at least, as far as I can infer from the docs)
At any rate, most of the tests pass so I’ll upload the work in progress hopefully today
09:01:13
@docbrown101:matrix.org@docbrown101:matrix.org left the room.10:35:44
@tazjin:matrix.orgtazjin

I have to say I don’t understand the rules governing lifetime of values

the rule is "YOLO"

12:11:38

Show newer messages


Back to Room ListRoom Version: 6