Persistent data structure
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 Tarjans' 1986 article. 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.
Wikipage disambiguates
Confluently persistent data structureData persistenceData structure persistanceData structure persistenceDestructive updateEphemeral data structureFully persistent data structureFunctional datastructurePartially persistent data structurePersistant data structurePersisted treePersistent data structure with confluencePersistent data structuresPersistent tree
Wikipage redirect
AVL treeAssignment (computer science)Athanasios TsakalidisBinary search treeBlock-level storageBrodal queueChris OkasakiClean (programming language)ClojureConfluently persistent data structureCopy-on-writeCtrieData persistenceData structureData structure persistanceData structure persistenceData systemDestructive updateDisjoint-set data structureDouble-ended queueElm (programming language)Enfilade (Xanadu)Ephemeral data structureFinger treeFirst-class functionFully persistent data structureFunctional datastructureFunctional programmingHash array mapped trieHash tree (persistent data structure)Immutable interfaceLinked listList of terms relating to algorithms and data structuresMetaobjectNumWorksOCamlOrder-maintenance problemPAM libraryParent pointer treePartially persistent data structure
Link from a Wikipage to another Wikipage
primaryTopic
Persistent data structure
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 Tarjans' 1986 article. 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.
has abstract
En computación, una estructura ...... ntar con recolector de basura.
@es
En informatique, une structure ...... istantes sont dites éphémères.
@fr
In ambito informatico, una str ...... re strutture dati persistenti.
@it
In computing, a persistent dat ...... rbid) the use of mutable data.
@en
Trwała struktura danych albo c ...... anych stworzona w 2002 przez .
@pl
在计算机编程中，可持久化数据结构（Persistent da ...... 构。 这些类型的数据结构在逻辑编程和函数式编程之中非常常见。
@zh
永続データ構造（えいぞくデータこうぞう、英: Persist ...... 考えられ、イミュータブルなデータ構造の構築に利用可能である。
@ja
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,024,266,782
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
En computación, una estructura ...... sistente, como un disco duro.)
@es
En informatique, une structure ...... raire de nouvelles structures.
@fr
In ambito informatico, una str ...... icato del termine persistente.
@it
In computing, a persistent dat ...... rbid) the use of mutable data.
@en
Trwała struktura danych albo c ...... zane znaczenie słowa "trwały".
@pl
在计算机编程中，可持久化数据结构（Persistent da ...... 构。 这些类型的数据结构在逻辑编程和函数式编程之中非常常见。
@zh
永続データ構造（えいぞくデータこうぞう、英: Persist ...... 考えられ、イミュータブルなデータ構造の構築に利用可能である。
@ja
label
Estructuras de datos persistentes
@es
Persistent data structure
@en
Persistência de dados
@pt
Structure de données persistante
@fr
Struttura dati persistente
@it
Trwała struktura danych
@pl
可持久化数据结构
@zh
永続データ構造
@ja