| 词条 | Hash tree (persistent data structure) |
| 释义 |
In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables in purely functional programming. In its basic form, a hash tree stores the hashes of its keys, regarded as strings of bits, in a trie, with the actual keys and (optional) values stored at the trie's "final" nodes.[1] Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.[1]References1. ^1 {{cite report|title=Ideal Hash Trees|author=Phil Bagwell|publisher=Infoscience Department, École Polytechnique Fédérale de Lausanne|url=http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf|year=2000}} {{CS-Trees}}{{Data structures}}{{compu-prog-stub}} 2 : Functional data structures|Hashing |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。