Add sortedInsert utility for message inserts

Author: MarkH817

src/stores/channel.ts

@@ -1,5 +1,5 @@
 import type { Channel, Message } from '#models';
-import { parseNick } from '#utils';
+import { parseNick, sortedInsert } from '#utils';
 import { defineStore } from 'pinia';
 import { computed, reactive, readonly, ref, watch } from 'vue';
 import useIrcStore from './irc';
@@ -161,10 +161,9 @@ const useChannelStore = defineStore('channel', () => {
             tags: tags ?? {},
           };
           // TODO: Cap messages per channel (100)
-          // TODO: Sort-insert messages based on `time` value
           // TODO: Prevent duplicate message insertions with `id` value
           log.debug('new message:', newMessage);
-          channel.messages.push(newMessage);
+          sortedInsert(channel.messages, newMessage, (a, b) => a.time - b.time);
 
           if (typeof newMessage.tags.batch === 'string') {
             // Don't trigger notifications on chat history playback

src/stores/irc.ts

@@ -67,7 +67,7 @@ const useIrcStore = defineStore('irc', () => {
 
     const ircClient = new Client({
       host: import.meta.env.VITE_APP_SERVER_URL!,
-      port: import.meta.env.VITE_APP_SERVER_PORT!,
+      port: import.meta.env.VITE_APP_SERVER_PORT,
       ssl: import.meta.env.VITE_APP_SSL === 'true',
       nick,
       username: uid,

src/utils/list.ts

@@ -1,3 +1,38 @@
 export function random<Item>(list: Item[]): Item {
   return list[Math.floor(Math.random() * list.length)];
 }
+
+/**
+ * @param list Assumed to be already sorted
+ */
+export function sortedInsert<Item>(
+  list: Item[],
+  item: Item,
+  comparatorFn: (a: Item, b: Item) => number,
+): void {
+  if (list.length === 0 || comparatorFn(item, list.at(-1)!) >= 0) {
+    // Quickly insert if list is empty or item belongs at the end
+    list.push(item);
+    return;
+  } else if (comparatorFn(item, list.at(0)!) < 0) {
+    // Quickly insert if item belongs at the start
+    list.unshift(item);
+    return;
+  }
+
+  // Find the insertion position if item belongs in the middle
+  let low = 0;
+  let high = list.length;
+  while (low < high) {
+    const mid = (low + high) >>> 1;
+
+    if (comparatorFn(item, list[mid]) < 0) {
+      high = mid;
+    } else {
+      low = mid + 1;
+    }
+  }
+
+  // Insert item into found position
+  list.splice(low, 0, item);
+}