Bnaya Peretz
Bnaya Peretz
Support saving values as const values, means they will be nested-immutable, and contiguous memory as possible. Another idea: lock array & object structures, but allow updates that will use same...
There's a proposal to make [shared]arraybuffer resizeable in place, which is great for us https://github.com/tc39/proposal-resizablearraybuffer It's expected to be supported quite fast in all of the platforms that supports SharedArrayBuffer,...
I think we still have some places we use closures instead of explicit variables. We need to find them and refactor them out!
Our allocator impl is functional, but wrapped in a class (TransactionalAllocator) Why? - The previous allocator was class-based, with similar api - The transaction feature, that was much simpler to...
Possible optimizations umbrella 🚀 - [ ] #154 Iterative, non-blocking memory reclaim - [ ] #94 Refactor code flows that creating intermediate objects - [ ] #92 On the minified...
Current situation: The memory reclaim is a blocking operation, of walking on the graph collect addresses to free into an array, and then call allocator's free on them. This process...
Moving forward, seems like we need to implement self balancing binary search tree to be used for quite few parts of the library. The difficulty would be how to make...
Notes: We are using terser. There are static/const values as: `l.NUMBER, l.BIGINT_POSITIVE, l.BIGINT_NEGATIVE, l.STRING;` Or `Uint32Array.BYTES_PER_ELEMENT` that although statically known, not are not beaning inlined by terser. To see the...