web 3d图形渲染器
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

64 lines
2.0 KiB

  1. # yocto-queue [![](https://badgen.net/bundlephobia/minzip/yocto-queue)](https://bundlephobia.com/result?p=yocto-queue)
  2. > Tiny queue data structure
  3. You should use this package instead of an array if you do a lot of `Array#push()` and `Array#shift()` on large arrays, since `Array#shift()` has [linear time complexity](https://medium.com/@ariel.salem1989/an-easy-to-use-guide-to-big-o-time-complexity-5dcf4be8a444#:~:text=O(N)%E2%80%94Linear%20Time) *O(n)* while `Queue#dequeue()` has [constant time complexity](https://medium.com/@ariel.salem1989/an-easy-to-use-guide-to-big-o-time-complexity-5dcf4be8a444#:~:text=O(1)%20%E2%80%94%20Constant%20Time) *O(1)*. That makes a huge difference for large arrays.
  4. > A [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is an ordered list of elements where an element is inserted at the end of the queue and is removed from the front of the queue. A queue works based on the first-in, first-out ([FIFO](https://en.wikipedia.org/wiki/FIFO_(computing_and_electronics))) principle.
  5. ## Install
  6. ```
  7. $ npm install yocto-queue
  8. ```
  9. ## Usage
  10. ```js
  11. const Queue = require('yocto-queue');
  12. const queue = new Queue();
  13. queue.enqueue('🦄');
  14. queue.enqueue('🌈');
  15. console.log(queue.size);
  16. //=> 2
  17. console.log(...queue);
  18. //=> '🦄 🌈'
  19. console.log(queue.dequeue());
  20. //=> '🦄'
  21. console.log(queue.dequeue());
  22. //=> '🌈'
  23. ```
  24. ## API
  25. ### `queue = new Queue()`
  26. The instance is an [`Iterable`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols), which means you can iterate over the queue front to back with a “for…of” loop, or use spreading to convert the queue to an array. Don't do this unless you really need to though, since it's slow.
  27. #### `.enqueue(value)`
  28. Add a value to the queue.
  29. #### `.dequeue()`
  30. Remove the next value in the queue.
  31. Returns the removed value or `undefined` if the queue is empty.
  32. #### `.clear()`
  33. Clear the queue.
  34. #### `.size`
  35. The size of the queue.
  36. ## Related
  37. - [quick-lru](https://github.com/sindresorhus/quick-lru) - Simple “Least Recently Used” (LRU) cache