LinkedList optmizations about asynciterator HOT 3 CLOSED

// 100 iterators, with 1,000,000 push/read sequences of 0–4 items

console.time('LinkedList');
for (let a = 0; a < 100; a++) {
  const list = new LinkedList();
  for (let i = 0; i < 1_000_000; i++) {
    for (let j = randInt(0, 4); j > 0; j--)
      list.push(i);
    for (let j = randInt(0, 4); j > 0; j--)
      list.shift();
  }
}
console.timeEnd('LinkedList');

console.time('LinkedListNext');
for (let a = 0; a < 100; a++) {
  const list = new LinkedListNext();
  for (let i = 0; i < 1_000_000; i++) {
    for (let j = randInt(0, 4); j > 0; j--)
      list.push(i);
    for (let j = randInt(0, 4); j > 0; j--)
      list.shift();
  }
}
console.timeEnd('LinkedListNext');

function randInt(min: number, max: number) {
  return Math.floor(Math.random() * (max - min + 1)) + min;
}