[![npm version][npm-image-url]][npm-url]
[![license][license-image-url]](LICENSE-MIT)

[npm-image-url]: https://img.shields.io/npm/v/simple-hashtable.svg?style=flat-square
[npm-url]: http://npmjs.org/package/simple-hashtable
[license-image-url]: https://img.shields.io/npm/l/simple-hashtable.svg?style=flat-square

Simple Hash Table

> A javascript implementation of a hash table data structure.

Description

A hash table (or hash map) is a data structure used to implement an associative
array, a structure that can map keys to values. A hash table uses a hash
function to compute the index into an array of buckets, or slots, from which the
correct value can be found. This 'hashing' of the key makes a lookup very
efficient and independent of the number of items in the hash table.

This implementation uses the djb2 hash function which provides a good
distribution of hashed values (or indexes) to minimize collisions. A hash
collision occurs when two different keys hash to the same value. If the
collisions are not handled properly, the first value in the hash table will be
overwritten by the second.

Hash collisions can be handled using one of several techniques. One way is to
implement what is called separate
chaining. With
separate chaining, instead of assigning a single value to the index (or hash),
some type of additional data structure is assigned, say a linked-list for
example. Then the payload (key/value pair) is added to the data structure based
on the data structure's native API. So basically, the hash table becomes an
array of data structures--a data structure of data structures.

This project implements separate chaining to mitigate hash collisions.

Another method for resolving hash collisions is linear
probing. Linear probing is not
implemented in this project.

_For specific examples and documentation, see the below sections_

#### Environment:

Although this implementation is designed to be used with
Node.js, it could be used in other contexts with minor
modifications. This implementation does not have any external dependencies that
would preclude it from being used in the browser--just include it with a
simple-hashtable - npm explorer

`simple-hashtable`

v1.0.1

Javascript implementation of a simple hash table data structure

hash tableabstract data typedata structure

89/weekUpdated 3 years agoMITUnpacked: 30.4 KB

Published by Jason Jones

npm install simple-hashtable

RepositoryHomepagenpm

[![npm version][npm-image-url]][npm-url] [![license][license-image-url]](LICENSE-MIT)

[npm-image-url]: https://img.shields.io/npm/v/simple-hashtable.svg?style=flat-square [npm-url]: http://npmjs.org/package/simple-hashtable [license-image-url]: https://img.shields.io/npm/l/simple-hashtable.svg?style=flat-square

`Simple Hash Table`

> A javascript implementation of a hash table data structure.

`Description`

A hash table (or hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute the index into an array of buckets, or slots, from which the correct value can be found. This 'hashing' of the key makes a lookup very efficient and independent of the number of items in the hash table.

This implementation uses the djb2 hash function which provides a good distribution of hashed values (or indexes) to minimize collisions. A hash collision occurs when two different keys hash to the same value. If the collisions are not handled properly, the first value in the hash table will be overwritten by the second.

Hash collisions can be handled using one of several techniques. One way is to implement what is called separate chaining. With separate chaining, instead of assigning a single value to the index (or hash), some type of additional data structure is assigned, say a linked-list for example. Then the payload (key/value pair) is added to the data structure based on the data structure's native API. So basically, the hash table becomes an array of data structures--a data structure of data structures.

This project implements separate chaining to mitigate hash collisions.

Another method for resolving hash collisions is linear probing. Linear probing is not implemented in this project.

_For specific examples and documentation, see the below sections_

#### Environment:

Although this implementation is designed to be used with Node.js, it could be used in other contexts with minor modifications. This implementation does not have any external dependencies that would preclude it from being used in the browser--just include it with a