Persistent data structure

In <a href="/facts/Computing/Kghtm9fX">computing</a>, a persistent data structure or not ephemeral data structure is a <a href="/facts/Data_structure/yNsNvL1I">data structure</a> that always preserves the previous version of itself when it is modified. Such data structures are effectively <a href="/facts/Immutable_object/Gsoq1bba">immutable</a>, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. The term was introduced in Driscoll, Sarnak, Sleator, and Tarjan's 1986 article.
A data structure is partially persistent if all versions can be accessed but only the newest version can be modified. The data structure is fully persistent if every version can be both accessed and modified. If there is also a meld or merge operation that can create a new version from two previous versions, the data structure is called confluently persistent. Structures that are not persistent are called ephemeral.
These types of data structures are particularly common in <a href="/facts/Logic_programming/Xgh8lj3F">logical</a> and <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a>, as languages in those paradigms discourage (or fully forbid) the use of mutable data.

Persistent data structure open-in-new

Persistent data structure