algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-07 02:05:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

merge: Improved the complexity of dequeue O(n) to O(1) (#1005)

Browse Source 
* feat: improved memoize function

used Map instead of object & used the JSON.stringfy method for generate a valid string as a key

* docs: modified documentation

* style: format with standard

* docs: modified stringify doc

* refactor: remove two repetition implementation

* feat: added validation, test codes

* chore: remove useless words

* feat: added types for jest

* chore: added link box

* feat: added new validation test casses & methods

* style: formated with standard

* feat: added parse method & test cases

* docs: added js docs

* chore: added default import export

* feat: imporved algorithm via replace method

* test: added two test cases

* feat: added jest type for suggestions

* feat: added `reduceRight` & `trim` method

* chore: added helper variable

* feat: added new rotation option

* Revert "chore: added helper variable"

This reverts commit 489544da0a3d479910fbea020d3be3d0d10681bf.

* remove: yarn lock

* chore: fix grammer

* feat: used replace method & added test case

* feat: remove revert

* chore: added new line

* feat: updated the Queue array to linkedlist DS

* chore: fixed grammer

* resolve: removed capacity related codes, & updated test cases

* feat: added length dicrease code on dequeue
This commit is contained in:
Fahim Faisaal
2022-05-06 22:20:55 +06:00
committed by GitHub
parent 03d0b1e0b8
commit e05b4432d8
2 changed files with 117 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

60
Data-Structures/Queue/test/Queue.test.js
View File

@ -1,48 +1,46 @@
import { Queue } from '../Queue'
import Queue from '../Queue'
describe('Queue', () => {
it('Check enqueue/dequeue', () => {
const queue = new Queue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(8)
queue.enqueue(9)
describe('Testing the Queue DS', () => {
const queue = new Queue()
it('Testing enqueue method', () => {
expect(queue.enqueue(1)).toBe(1)
expect(queue.enqueue(2)).toBe(2)
expect(queue.enqueue(8)).toBe(3)
expect(queue.enqueue(9)).toBe(4)
})
it('Testing length after enqueue', () => {
expect(queue.length).toBe(4)
})
it('Testing peekFirst & peekLast methods', () => {
expect(queue.peekFirst()).toBe(1)
expect(queue.peekLast()).toBe(9)
})
it('Testing toArray method', () => {
expect(queue.toArray()).toEqual([1, 2, 8, 9])
})
it('Testing dequeue method', () => {
expect(queue.dequeue()).toBe(1)
expect(queue.dequeue()).toBe(2)
})
it('Check length', () => {
const queue = new Queue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(8)
queue.enqueue(9)
expect(queue.length()).toBe(4)
it('Testing length after dequeue', () => {
expect(queue.length).toBe(2)
})
it('Check peek', () => {
it('Testing isEmpty method', () => {
const queue = new Queue()
expect(queue.isEmpty()).toBeTruthy()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(8)
queue.enqueue(9)
expect(queue.peek()).toBe(1)
})
it('Check empty', () => {
const queue = new Queue()
expect(queue.empty()).toBeTruthy()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(8)
queue.enqueue(9)
expect(queue.empty()).toBeFalsy()
expect(queue.isEmpty()).toBeFalsy()
})
})