Breaking News: Grepper is joining You.com. Read the official announcement!

circular queue implementation using js

Aayush answered on May 13, 2021 Popularity 8/10 Helpfulness 4/10

answer circular queue implementation using js

related Circular Queue in javascript

circular queue implementation using js

Comment

class CircularQueue {
    constructor(size) {
        this.element = [];
        this.size = size 
        this.length = 0 
        this.front = 0 
        this.back = -1
    }
    isEmpty() {
        return (this.length == 0)
    }
    enqueue(element) {
        if (this.length >= this.size) 
            throw (new Error("Maximum length exceeded")) 
        this.back++
        this.element[this.back % this.size] = element 
        this.length++
    }
    dequeue() {
        if (this.isEmpty())
                throw (new Error("No elements in the queue"))
        const value = this.getFront()
        this.element[this.front % this.size] = null 
        this.front++
        this.length--
        return value
    }
    getFront() {
        if (this.isEmpty()) 
            throw (new Error("No elements in the queue")) 
        return this.element[this.front % this.size]
    }
    clear() {
        this.element = new Array();
        this.length = 0 
        this.back = 0 
        this.front = -1
    }
}

Popularity 8/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: circular-queue implementation javascript using

Link to this answer
Share Copy Link

Contributed on Mar 07 2022

Aayush

0 Answers Avg Quality 2/10

Closely Related Answers

Circular Queue in javascript

Comment

class CircularQueue { constructor(size) {  this.element = [];  this.size = size  this.length = 0  this.front = 0  this.back = -1 }isEmpty() {  return (this.length == 0) }enqueue(element) {  if (this.length >= this.size) throw (new Error("Maximum length exceeded"))  this.back++   this.element[this.back % this.size] = element  this.length++ }dequeue() {  if (this.isEmpty()) throw (new Error("No elements in the queue"))  const value = this.getFront()  this.element[this.front % this.size] = null  this.front++  this.length--  return value }getFront() {  if (this.isEmpty()) throw (new Error("No elements in the queue"))  return this.element[this.front % this.size] }clear() {  this.element = new Array()  this.length = 0  this.back = 0  this.front = -1 }}

Popularity 8/10 Helpfulness 2/10 Language javascript

Source: medium.com

Tags: javascript circular-queue

Link to this answer
Share Copy Link

Contributed on May 13 2021

nikky

0 Answers Avg Quality 2/10

circular queue implementation using js

Contents

More Related Answers

circular queue implementation using js

Closely Related Answers

Circular Queue in javascript

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.