Currently, certain operations on arrays (e.g., shift and splice) are very expensive since they result in many keys being mutated. We could do things more efficiently by representing arrays as subtrees, and by keeping track of an index offset which gets incremented for each shift.
Currently, certain operations on arrays (e.g., shift and splice) are very expensive since they result in many keys being mutated. We could do things more efficiently by representing arrays as subtrees, and by keeping track of an index offset which gets incremented for each shift.