Oh oracle of the interwebs –
I am writing a GPCE paper, and one of the contributions is a model of sequences (AKA collections) that has stable unshifting positions. Standard collections use an array abstraction where access is by integer ordinal position, which shifts under insertion and deletion. This manifests as the fact that iterators are broken by insertion and deletion operations. Linked list iterators also break under deletion.
Does anyone know of alternative proposals with stable positions/iterators? I don’t know of any, but I can’t be the first person to do this. Continue reading “Collections with stable iterators”