currently ping pong is used as a base class for sorters that use it to manage main memory - but the adaptive sorter rewrite requires both runs and memory to be managed with ping pong.
hack to get back on track (considering that adaptive isn't that important) - replicate that functionality by copying old code over.
better way of doing it for later: make an class for a ping-pong managed list, have three instances of this object rather than two classes with a built in version and an additional copy-pasted instance
currently ping pong is used as a base class for sorters that use it to manage main memory - but the adaptive sorter rewrite requires both runs and memory to be managed with ping pong.
hack to get back on track (considering that adaptive isn't that important) - replicate that functionality by copying old code over.
better way of doing it for later: make an class for a ping-pong managed list, have three instances of this object rather than two classes with a built in version and an additional copy-pasted instance