3 ms·
Julia's garbage collector is quite good. > I know that you shouldn't produce garbage, but I happen to like immutable data structures and those work better with
by eigenspace 6y ago
Julia's garbage collector is quite good.
> I know that you shouldn't produce garbage, but I happen to like immutable data structures and those work better with optimised GCs.
If you use immutable data-structures in julia, you're rather unlikely to end up with any heap allocations at all. Unlike Java, Julia is very capable of stack allocating user defined types.
- dan-robertson 6y agoI think that’s true for small structs made of floats but not true for something like an immutable lisp-style linked list.
- DNF2 6y agoNot just floats, and I'm not sure they have to be that small. All sorts of structs containing bitstypes/value types can be stack allocated. In fact, even some structs with pointers to heap-allocated memory can be stack-allocated (such as array views.) I don't know about linked lists, though.