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

Verifying whether the queue is empty and its size

The next method is the isEmpty method, which returns true if the queue is empty, and false otherwise:

isEmpty() {  return this.count - this.lowestCount === 0;} 

To calculate how many elements there are in the queue, we simply calculate the difference between the key count and the lowestCount

Suppose the count property has value 2 and the lowestCount has value 0. This means we have two elements in the queue. Next, we remove one element from the queue. The property lowestCount will be updated to value 1 and count will continue with value 2. Now the queue has only one element, and so on.

So to implement the size method, we simply return this difference:

size() { return this.count - this.lowestCount; ...
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