It includes algorithms for getting/inserting/removing an element at a particular index (in the case of arrays), and code for getting/inserting/removing an element in sorted order (for dictionaries and sets).
If anybody wants, I can translate the code from JavaScript to Arc.
---
* [1]: Adding in sorted arrays shouldn't be hard, but I haven't had any need for them yet.
