Tyson Andre
Tyson Andre
Idea: Immutable lists with modifications returning new lists - look into Relaxed Radix Binary Trees
Google searching mentioned Relaxed Radix Binary Trees, an immutable datastructure surprisingly claiming performance near arrays in most operations. https://hypirion.com/musings/thesis https://github.com/hyPiRion/c-rrb - gc may be difficult, immutable lists should either contain...
E.g. avoid performance issues such as https://www.php.net/manual/en/info.configuration.php#ini.max-input-vars - use a random seed chosen at startup
Similar to https://www.cplusplus.com/reference/map/map/erase/ which supports removal of `iterator`
Similar to unique_values in using `===` Different from https://www.php.net/manual/en/function.array-intersect.php which casts to string
Keep a doubly linked list of iterators?
E.g. first 5 elements, last 5 elements.
(For arrays, these are guaranteed to be unique keys)