Skip to content
This repository has been archived by the owner on Aug 31, 2022. It is now read-only.

Internals

Jump to bottom
intsuc edited this page Feb 1, 2022 · 1 revision

Memory

Heap uses list-mapped trie to achieve random access in Ω(logN)-O(log²N) time.

Allocator

Heap uses ring queue to keep track of free cells.

Garbage collector

Heap uses incremental reference counting to automatically deallocate unreachable weak cells.

Clone this wiki locally