{"componentChunkName":"component---src-templates-blog-post-js","path":"/implementation-of-hash-table-in-javascript/","result":{"data":{"markdownRemark":{"html":"

hashMap的数据结构的组成

\n

数组、链表、红黑树

\n

哈希函数的实现

\n
class HashMap{\n    constructor(size){\n        this.table = new Array(size)\n        this.simpleHash()\n    }\n    simpleHash(data){\n        return data % this.table.length\n    }\n    put(data){\n        let pos = this.simpleHash(data)\n        this.table[pos] = data\n    }\n    get(data){\n        let pos = this.simpleHash(data)\n        return this.table[pos]\n    }\n    show(){\n        console.log(this.table)\n    }\n}\nmodule.exports = HashMap
\n

冲突|碰撞的解决方法

\n\n

如果pos冲突,即在此位置创建二维数组或者链表？

\n\n

由于hashMap散列表是不规则的,冲突后查询下一个位置是否为空,直至结束,返回undefined

\n\n

当某个节点后出现过多的链表节点的时候,就会转化为红黑树以提升查询效率

","timeToRead":1,"frontmatter":{"title":"JavaScript的哈希表实现","date":"May 05, 2019","spoiler":null},"fields":{"slug":"/implementation-of-hash-table-in-javascript/"}}},"pageContext":{"slug":"/implementation-of-hash-table-in-javascript/","previous":{"fields":{"slug":"/new-features-of-http2/"},"frontmatter":{"title":"http2的新特性"}},"next":{"fields":{"slug":"/some-differences-between-http1.0-and-1.1/"},"frontmatter":{"title":"http1.0和1.1的一些区别"}}}},"staticQueryHashes":["3649515864","63159454"]}