Been making position independent versions of the data structures.
So far : freelist, stack, queue (unbounded many many), queue (unbounded single single).
Made tests for the position independent stack, they pass.
Need to make tests for the rest, and also make the position indepenent btree and lists.
Have to think about the freelist elimination array and position independence (I think it’s just okay – works no changes) and have to think about position independence and the SMR methods.
Again, I think they just work – have to switch them over to offsets internally, but that’s all – so it should be possible to make position independent versions of the SMR-using data structures.
The next thing though will be a quick extra benchmark for the freelist, to properly benchmark the elimination array. Gym first though 🙂