From d3adc16a08d95d6e331de55d7d3bf05a66a874a8 Mon Sep 17 00:00:00 2001
From: pack <pack@packgekko.xyz>
Date: Sun, 9 Aug 2026 10:54:08 +0000
Subject: stop tracking node_modules/

---
 node_modules/abbrev/lib/index.js | 53 ----------------------------------------
 1 file changed, 53 deletions(-)
 delete mode 100644 node_modules/abbrev/lib/index.js

(limited to 'node_modules/abbrev/lib/index.js')

diff --git a/node_modules/abbrev/lib/index.js b/node_modules/abbrev/lib/index.js
deleted file mode 100644
index f7bee0c..0000000
--- a/node_modules/abbrev/lib/index.js
+++ /dev/null
@@ -1,53 +0,0 @@
-module.exports = abbrev
-
-function abbrev (...args) {
-  let list = args
-  if (args.length === 1 && (Array.isArray(args[0]) || typeof args[0] === 'string')) {
-    list = [].concat(args[0])
-  }
-
-  for (let i = 0, l = list.length; i < l; i++) {
-    list[i] = typeof list[i] === 'string' ? list[i] : String(list[i])
-  }
-
-  // sort them lexicographically, so that they're next to their nearest kin
-  list = list.sort(lexSort)
-
-  // walk through each, seeing how much it has in common with the next and previous
-  const abbrevs = {}
-  let prev = ''
-  for (let ii = 0, ll = list.length; ii < ll; ii++) {
-    const current = list[ii]
-    const next = list[ii + 1] || ''
-    let nextMatches = true
-    let prevMatches = true
-    if (current === next) {
-      continue
-    }
-    let j = 0
-    const cl = current.length
-    for (; j < cl; j++) {
-      const curChar = current.charAt(j)
-      nextMatches = nextMatches && curChar === next.charAt(j)
-      prevMatches = prevMatches && curChar === prev.charAt(j)
-      if (!nextMatches && !prevMatches) {
-        j++
-        break
-      }
-    }
-    prev = current
-    if (j === cl) {
-      abbrevs[current] = current
-      continue
-    }
-    for (let a = current.slice(0, j); j <= cl; j++) {
-      abbrevs[a] = current
-      a += current.charAt(j)
-    }
-  }
-  return abbrevs
-}
-
-function lexSort (a, b) {
-  return a === b ? 0 : a > b ? 1 : -1
-}
-- 
cgit v1.2.3