1. /**
  2. * Simple Queue Implementation (for temporary use)
  3. */
  4. class Queue {
  5. constructor() {
  6. this.items = []; // Use an array to store queue elements
  7. }
  9. /**
  10. * Enqueues an element to the end of the queue.
  11. * @param {any} element - The element to enqueue.
  12. */
  13. enqueue(element) {
  14. this.items.push(element);
  15. }
  17. /**
  18. * Dequeues and returns the element at the front of the queue.
  19. * Returns undefined if the queue is empty.
  20. * @returns {any} The dequeued element.
  21. */
  22. dequeue() {
  23. if (this.isEmpty()) {
  24. return undefined;
  25. }
  26. return this.items.shift(); // Remove and return the first element
  27. }
  29. /**
  30. * Returns the element at the front of the queue without removing it.
  31. * Returns undefined if the queue is empty.
  32. * @returns {any} The element at the front.
  33. */
  34. peek() {
  35. if (this.isEmpty()) {
  36. return undefined;
  37. }
  38. return this.items[0];
  39. }
  41. /**
  42. * Checks if the queue is empty.
  43. * @returns {boolean} True if the queue is empty, false otherwise.
  44. */
  45. isEmpty() {
  46. return this.items.length === 0;
  47. }
  49. /**
  50. * Returns the number of elements in the queue.
  51. * @returns {number} The queue's size.
  52. */
  53. size() {
  54. return this.items.length;
  55. }
  56. }
  58. // Export the Queue class (for use in other modules)
  59. export default Queue;

Add your comment