Revision as of 14:16, 26 February 2020 edit 72.139.121.186 (talk) →Ensuring that a data structure is purely functional ← Previous edit		Revision as of 12:35, 21 April 2020 edit undo 83.202.87.71 (talk) →Examples Next edit →
Line 26: * Random access list, implemented as a skew-binary random access list * [[Hash consing]] * [[Zipper (data structure)]] ==Design and implementation==

Purely functional data structure: Difference between revisions