Metraipolis › archive › dc_8bee764e275d

Persistent data structure — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Persistent_data_structure
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T01:00:08.563Z
SHA-256 of the archived text
ac7409c962e4f1413ac4ddce9a7fd6872fdcaa38c77256ea2fcd56bc8d716985
Stable URL of this page
https://metraipolis.com/documento/dc_8bee764e275d

How to cite

Persistent data structure — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Persistent_data_structure (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8bee764e275d (Metraipolis archive dc_8bee764e275d, sha256 ac7409c962e4f1413ac4ddce9a7fd6872fdcaa38c77256ea2fcd56bc8d716985)
BibTeX
@misc{dc8bee764e275d,
  title = {Persistent data structure — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Persistent_data_structure},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8bee764e275d; sha256 ac7409c962e4f1413ac4ddce9a7fd6872fdcaa38c77256ea2fcd56bc8d716985},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Persistent_data_structure. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, 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 logical and functional programming, as languages in those paradigms discourage (or fully forbid) the use of mutable data.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «transparency log»).
Fonte: Wikipedia in inglese, voce «Persistent data structure» — https://en.wikipedia.org/wiki/Persistent_data_structure
Wikidata Q2427787: «data structure that always preserves the previous version of itself when it is modified» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2427787
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Persistent_data_structure?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376706289, consultata il 2026-10-06T00:17:49.677Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ab3441ab51319c005a2a8249ad5a9685b2ecf99464236ac8ad7927b3822b6511