1. A lock-free implementation of a shared object: that is population-oblivious, for which consumption of storage is adaptive independent of any historical maximum, and for which failure of a thread does not prevent all future reclamation of the storage by a non-failed thread, wherein the adaptivity of storage consumption is achieved through explicit reclamation and without resort to garbage collection.