12345678910111213141516171819202122232425262728293031
// 根据优先级推入队列export class PriorityList<T> {  #priorityList: PriorityNode<T>[] = [];
  //  出队  dequeue() {    return this.#priorityList.shift()!.node;  }
  // 入队  enqueue(node: T, priority: number = 0) {    let flag = false;    this.#priorityList.some((el, index) => {      if (el.priority > priority) {        this.#priorityList.splice(index, 0, { node, priority });        return (flag = true);      }    });    !flag && this.#priorityList.push({ node, priority });  }
  *[Symbol.iterator]() {    while (this.#priorityList.length !== 0) yield this.dequeue();  }}
export type PriorityNode<T> = {  priority: number;  node: T;};