Queue_js.txt

/*implementing queue*/

class Queue {
  constructor() {
    this.elements = [];
    this.elem_count = 0;
    this.count_after_pop=-1;
  }
  push(item) {
    this.elements[this.elem_count] = item;
    ++this.elem_count;
  }
  pop() {
    if (this.elem_count-this.count_after_pop === 0)
      return "underflow";
    else {
      let poped_elem = this.elements[this.count_after_pop];
      ++this.count_after_pop;
      delete this.elements[this.count_after_pop];
      return poped_elem;
    }
  }
  peek() {
    if (this.elem_count === 0)
      return "underflow";
    else
      return this.elements[this.elem_count - 1];
  }
  reverse() {
    let reverced_arr = [];
    for (let i = this.count_after_pop; i < this.elem_count; ++i) {
      reverced_arr[i] = this.elements[this.elem_count - i - 1];
    }
    this.elements = reverced_arr;
  }
  empty() {
    return this.elem_count === 0;
  }
}