Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

Putting a key and a value in the hash table

Now that we have our hashCode function, we can implement the put method, as follows:

put(key, value) {  if (key != null && value != null) { // {1}    const position = this.hashCode(key); // {2}     this.table[position] = new ValuePair(key, value); // {3}    return true;  }  return false;}

The put method has a similar logic as the set method from the Dictionary class. We could name this method set as well, however, most of the programming languages use the put method for the HashTable data structure, so we will follow the same naming convention.

First, we will verify whether the key and value are valid ({1}), and in case they are not valid, we return false to indicate the value was not added (or updated). For ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content