Search results
5 packages found
Train a fast (FIFO) queue with a rollback mechanism. Behind the scenes it uses 2 arrays to simulate and perform fast shifting and popping operations without using the Array#shift() method..
Like a stack, the queue is a linear data structure that stores items in either a First In First Out (FIFO) or Last In First Out (LIFO) manner. With FIFO, the least recently added item is removed first, while with LIFO, the most recently added item is remo
- flag
- move
- babel
- callbind
- Push
- defineProperty
- phone
- command
- stateless
- RegExp.prototype.flags
- typedarray
- String.prototype.trim
- call-bind
- negative
- View more
Like a stack, the queue is a linear data structure that stores items in either a First In First Out (FIFO) or Last In First Out (LIFO) manner. With FIFO, the least recently added item is removed first, while with LIFO, the most recently added item is remo
Circular buffer.
- stdlib
- stdutils
- stdutil
- utilities
- utility
- utils
- util
- data structures
- data structure
- data
- structure
- collection
- circular
- buffer
- View more
Efficient Circular FIFO Buffer Implementation.