compact-array seems like a specialization of a rope, with the tree structure arbitrarily capped at depth=2, and without the benefits of O(log(n)) insertion.
Capping the depth gives you O(1) gets and sets though. Note that compact-arrays grow breadth-wise whereas ropes grow depth-wise. Breadth-wise growth trades insertion speed for random access speed.