chore: avoid unnecessary sort to get smallest value

This changes getEarliestTimestamp() to walk the list a single time,
instead of performing a full sort, as a sorted list is not needed, just
the smallest value.

Author: isaacs

packages/replay-internal/src/eventBuffer/EventBufferArray.ts

@@ -73,13 +73,10 @@ export class EventBufferArray implements EventBuffer {
 
   /** @inheritdoc */
   public getEarliestTimestamp(): number | null {
-    //oxlint-disable-next-line require-array-sort-compare
-    const timestamp = this.events.map(event => event.timestamp).sort()[0];
-
-    if (!timestamp) {
-      return null;
+    let ts: number | null = null;
+    for (const { timestamp } of this.events) {
+      if (ts === null || timestamp < ts) ts = timestamp;
     }
-
-    return timestampToMs(timestamp);
+    return ts === null ? ts : timestampToMs(ts);
   }
 }