Talk:Persistent array
Latest comment: 1 year ago by B52481 in topic Tree of Modifications
This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
"Backers trick" should probably be "Baker's trick", since it is most likely referring to "Henry G. Baker. Shallow binding makes functional arrays fast. SIGPLAN Not., 26(8):145–147, 1991.". Per Mildner (talk) 19:57, 22 December 2020 (UTC)
Tree of Modifications
editI removed the second implementation from the main article (attached below) since the time complexity of lookups appears to be in the worst case, which is much worse than the other implementations. Perhaps this implementation can be re-added if accompanied by an explanation of why this implementation is preferred over the others.
Update: I added it back (with a note about the worst case time complexity).