@openclaw/matrix 2026.8.1-beta.2 → 2026.8.1

package/node_modules/markdown-it/node_modules/argparse/lib/difflib.js

@@ -0,0 +1,190 @@
+// Minimal port of Python's difflib used by argparse suggestions.
+
+'use strict'
+
+function calculate_ratio (matches, length) {
+    return length ? 2 * matches / length : 1
+}
+
+class SequenceMatcher {
+    constructor () {
+        this.a = []
+        this.b = []
+        this.b2j = new Map()
+        this.fullbcount = undefined
+        this.matching_blocks = undefined
+    }
+
+    set_seq1 (a) {
+        this.a = Array.from(a)
+        this.matching_blocks = undefined
+    }
+
+    set_seq2 (b) {
+        this.b = Array.from(b)
+        this.matching_blocks = undefined
+        this.fullbcount = undefined
+        this._chain_b()
+    }
+
+    _chain_b () {
+        const b2j = new Map()
+        for (const [i, element] of this.b.entries()) {
+            const indices = b2j.get(element) || []
+            indices.push(i)
+            b2j.set(element, indices)
+        }
+
+        const n = this.b.length
+        if (n >= 200) {
+            const ntest = Math.floor(n / 100) + 1
+            for (const [element, indices] of b2j) {
+                if (indices.length > ntest) b2j.delete(element)
+            }
+        }
+        this.b2j = b2j
+    }
+
+    find_longest_match (alo, ahi, blo, bhi) {
+        const { a, b, b2j } = this
+        let besti = alo
+        let bestj = blo
+        let bestsize = 0
+        let j2len = new Map()
+
+        for (let i = alo; i < ahi; i++) {
+            const newj2len = new Map()
+            for (const j of b2j.get(a[i]) || []) {
+                if (j < blo) continue
+                if (j >= bhi) break
+                const k = (j2len.get(j - 1) || 0) + 1
+                newj2len.set(j, k)
+                if (k > bestsize) {
+                    besti = i - k + 1
+                    bestj = j - k + 1
+                    bestsize = k
+                }
+            }
+            j2len = newj2len
+        }
+
+        while (besti > alo && bestj > blo && a[besti - 1] === b[bestj - 1]) {
+            besti--
+            bestj--
+            bestsize++
+        }
+        while (besti + bestsize < ahi && bestj + bestsize < bhi &&
+               a[besti + bestsize] === b[bestj + bestsize]) {
+            bestsize++
+        }
+
+        return [besti, bestj, bestsize]
+    }
+
+    get_matching_blocks () {
+        if (this.matching_blocks !== undefined) return this.matching_blocks
+
+        const la = this.a.length
+        const lb = this.b.length
+        const queue = [[0, la, 0, lb]]
+        const matching_blocks = []
+        while (queue.length) {
+            const [alo, ahi, blo, bhi] = queue.pop()
+            const match = this.find_longest_match(alo, ahi, blo, bhi)
+            const [i, j, k] = match
+            if (k) {
+                matching_blocks.push(match)
+                if (alo < i && blo < j) queue.push([alo, i, blo, j])
+                if (i + k < ahi && j + k < bhi) {
+                    queue.push([i + k, ahi, j + k, bhi])
+                }
+            }
+        }
+        matching_blocks.sort((x, y) => x[0] - y[0] || x[1] - y[1] || x[2] - y[2])
+
+        let i1 = 0
+        let j1 = 0
+        let k1 = 0
+        const non_adjacent = []
+        for (const [i2, j2, k2] of matching_blocks) {
+            if (i1 + k1 === i2 && j1 + k1 === j2) {
+                k1 += k2
+            } else {
+                if (k1) non_adjacent.push([i1, j1, k1])
+                i1 = i2
+                j1 = j2
+                k1 = k2
+            }
+        }
+        if (k1) non_adjacent.push([i1, j1, k1])
+        non_adjacent.push([la, lb, 0])
+        this.matching_blocks = non_adjacent
+        return non_adjacent
+    }
+
+    ratio () {
+        const matches = this.get_matching_blocks()
+            .reduce((total, match) => total + match[2], 0)
+        return calculate_ratio(matches, this.a.length + this.b.length)
+    }
+
+    quick_ratio () {
+        if (this.fullbcount === undefined) {
+            this.fullbcount = new Map()
+            for (const element of this.b) {
+                this.fullbcount.set(element, (this.fullbcount.get(element) || 0) + 1)
+            }
+        }
+
+        const avail = new Map()
+        let matches = 0
+        for (const element of this.a) {
+            const numb = avail.has(element)
+                ? avail.get(element)
+                : this.fullbcount.get(element) || 0
+            avail.set(element, numb - 1)
+            if (numb > 0) matches++
+        }
+        return calculate_ratio(matches, this.a.length + this.b.length)
+    }
+
+    real_quick_ratio () {
+        return calculate_ratio(
+            Math.min(this.a.length, this.b.length),
+            this.a.length + this.b.length)
+    }
+}
+
+function compare_strings (a, b) {
+    const ac = Array.from(a)
+    const bc = Array.from(b)
+    for (let i = 0; i < Math.min(ac.length, bc.length); i++) {
+        const difference = ac[i].codePointAt(0) - bc[i].codePointAt(0)
+        if (difference) return difference
+    }
+    return ac.length - bc.length
+}
+
+function get_close_matches (word, possibilities, n = 3, cutoff = 0.6) {
+    if (!(n > 0)) throw new TypeError(`n must be > 0: ${n}`)
+    if (!(cutoff >= 0 && cutoff <= 1)) {
+        throw new TypeError(`cutoff must be in [0.0, 1.0]: ${cutoff}`)
+    }
+
+    const result = []
+    const matcher = new SequenceMatcher()
+    matcher.set_seq2(word)
+    for (const possibility of possibilities) {
+        matcher.set_seq1(possibility)
+        if (matcher.real_quick_ratio() >= cutoff &&
+            matcher.quick_ratio() >= cutoff &&
+            matcher.ratio() >= cutoff) {
+            result.push([matcher.ratio(), possibility])
+        }
+    }
+
+    result.sort((a, b) => b[0] - a[0] || -compare_strings(a[1], b[1]))
+    return result.slice(0, n).map(match => match[1])
+}
+
+module.exports = { get_close_matches }

package/node_modules/markdown-it/node_modules/argparse/lib/sub.js

@@ -6,10 +6,10 @@
 const { inspect } = require('util')
 
 
-module.exports = function sub(pattern, ...values) {
-    let regex = /%(?:(%)|(-)?(\*)?(?:\((\w+)\))?([A-Za-z]))/g
+module.exports = function sub (pattern, ...values) {
+    const regex = /%(?:(%)|(-)?(\*)?(?:\((\w+)\))?([A-Za-z]))/g
 
-    let result = pattern.replace(regex, function (_, is_literal, is_left_align, is_padded, name, format) {
+    const result = pattern.replace(regex, function (_, is_literal, is_left_align, is_padded, name, format) {
         if (is_literal) return '%'
 
         let padded_count = 0
@@ -21,7 +21,7 @@ module.exports = function sub(pattern, ...values) {
 
         let str
         if (name !== undefined) {
-            let dict = values[0]
+            const dict = values[0]
             if (typeof dict !== 'object' || dict === null) throw new TypeError('format requires a mapping')
             if (!(name in dict)) throw new TypeError(`no such key: '${name}'`)
             str = dict[name]

package/node_modules/markdown-it/node_modules/argparse/lib/textwrap.js

@@ -71,8 +71,8 @@ class TextWrapper {
      *      Append to the last line of truncated text.
      */
 
-    constructor(options = {}) {
-        let {
+    constructor (options = {}) {
+        const {
             width = 70,
             initial_indent = '',
             subsequent_indent = '',
@@ -84,7 +84,7 @@ class TextWrapper {
             break_on_hyphens = true,
             tabsize = 8,
             max_lines = undefined,
-            placeholder=' [...]'
+            placeholder = ' [...]'
         } = options
 
         this.width = width
@@ -105,7 +105,7 @@ class TextWrapper {
     // -- Private methods -----------------------------------------------
     // (possibly useful for subclasses to override)
 
-    _munge_whitespace(text) {
+    _munge_whitespace (text) {
         /*
          *  _munge_whitespace(text : string) -> string
          *
@@ -122,7 +122,7 @@ class TextWrapper {
         return text
     }
 
-    _split(text) {
+    _split (text) {
         /*
          *  _split(text : string) -> [string]
          *
@@ -143,7 +143,7 @@ class TextWrapper {
         return chunks
     }
 
-    _handle_long_word(reversed_chunks, cur_line, cur_len, width) {
+    _handle_long_word (reversed_chunks, cur_line, cur_len, width) {
         /*
          *  _handle_long_word(chunks : [string],
          *                    cur_line : [string],
@@ -181,7 +181,7 @@ class TextWrapper {
         // devoted to the long word that we can't handle right now.
     }
 
-    _wrap_chunks(chunks) {
+    _wrap_chunks (chunks) {
         /*
          *  _wrap_chunks(chunks : [string]) -> [string]
          *
@@ -195,7 +195,7 @@ class TextWrapper {
          *  Whitespace chunks will be removed from the beginning and end of
          *  lines, but apart from that whitespace is preserved.
          */
-        let lines = []
+        const lines = []
         let indent
         if (this.width <= 0) {
             throw Error(`invalid width ${this.width} (must be > 0)`)
@@ -219,7 +219,7 @@ class TextWrapper {
 
             // Start the list of chunks that will make up the current line.
             // cur_len is just the length of all the chunks in cur_line.
-            let cur_line = []
+            const cur_line = []
             let cur_len = 0
 
             // Figure out which static string will prefix this line.
@@ -231,7 +231,7 @@ class TextWrapper {
             }
 
             // Maximum width for this line.
-            let width = this.width - indent.length
+            const width = this.width - indent.length
 
             // First chunk on line is whitespace -- drop it, unless this
             // is the very beginning of the text (ie. no lines started yet).
@@ -240,7 +240,7 @@ class TextWrapper {
             }
 
             while (chunks.length > 0) {
-                let l = chunks[chunks.length - 1].length
+                const l = chunks[chunks.length - 1].length
 
                 // Can at least squeeze this chunk onto the current line.
                 if (cur_len + l <= width) {
@@ -291,7 +291,7 @@ class TextWrapper {
                     }
                     if (!had_break) {
                         if (lines) {
-                            let prev_line = lines[lines.length - 1].trimEnd()
+                            const prev_line = lines[lines.length - 1].trimEnd()
                             if (prev_line.length + this.placeholder.length <=
                                     this.width) {
                                 lines[lines.length - 1] = prev_line + this.placeholder
@@ -308,14 +308,14 @@ class TextWrapper {
         return lines
     }
 
-    _split_chunks(text) {
+    _split_chunks (text) {
         text = this._munge_whitespace(text)
         return this._split(text)
     }
 
     // -- Public interface ----------------------------------------------
 
-    wrap(text) {
+    wrap (text) {
         /*
          *  wrap(text : string) -> [string]
          *
@@ -325,15 +325,15 @@ class TextWrapper {
          *  and all other whitespace characters (including newline) are
          *  converted to space.
          */
-        let chunks = this._split_chunks(text)
+        const chunks = this._split_chunks(text)
         // not implemented in js
-        //if (this.fix_sentence_endings) {
+        // if (this.fix_sentence_endings) {
         //    this._fix_sentence_endings(chunks)
-        //}
+        // }
         return this._wrap_chunks(chunks)
     }
 
-    fill(text) {
+    fill (text) {
         /*
          *  fill(text : string) -> string
          *
@@ -348,7 +348,7 @@ class TextWrapper {
 
 // -- Convenience interface ---------------------------------------------
 
-function wrap(text, options = {}) {
+function wrap (text, options = {}) {
     /*
      *  Wrap a single paragraph of text, returning a list of wrapped lines.
      *
@@ -359,12 +359,12 @@ function wrap(text, options = {}) {
      *  space.  See TextWrapper class for available keyword args to customize
      *  wrapping behaviour.
      */
-    let { width = 70, ...kwargs } = options
-    let w = new TextWrapper(Object.assign({ width }, kwargs))
+    const { width = 70, ...kwargs } = options
+    const w = new TextWrapper(Object.assign({ width }, kwargs))
     return w.wrap(text)
 }
 
-function fill(text, options = {}) {
+function fill (text, options = {}) {
     /*
      *  Fill a single paragraph of text, returning a new string.
      *
@@ -374,17 +374,17 @@ function fill(text, options = {}) {
      *  whitespace characters converted to space.  See TextWrapper class for
      *  available keyword args to customize wrapping behaviour.
      */
-    let { width = 70, ...kwargs } = options
-    let w = new TextWrapper(Object.assign({ width }, kwargs))
+    const { width = 70, ...kwargs } = options
+    const w = new TextWrapper(Object.assign({ width }, kwargs))
     return w.fill(text)
 }
 
 // -- Loosely related functionality -------------------------------------
 
-let _whitespace_only_re = /^[ \t]+$/mg
-let _leading_whitespace_re = /(^[ \t]*)(?:[^ \t\n])/mg
+const _whitespace_only_re = /^[ \t]+$/mg
+const _leading_whitespace_re = /(^[ \t]*)(?:[^ \t\n])/mg
 
-function dedent(text) {
+function dedent (text) {
     /*
      *  Remove any common leading whitespace from every line in `text`.
      *
@@ -402,7 +402,7 @@ function dedent(text) {
     // all lines.
     let margin = undefined
     text = text.replace(_whitespace_only_re, '')
-    let indents = text.match(_leading_whitespace_re) || []
+    const indents = text.match(_leading_whitespace_re) || []
     for (let indent of indents) {
         indent = indent.slice(0, -1)
 

package/node_modules/markdown-it/node_modules/argparse/package.json

@@ -1,7 +1,7 @@
 {
   "name": "argparse",
   "description": "CLI arguments parser. Native port of python's argparse.",
-  "version": "2.0.1",
+  "version": "3.0.0",
   "keywords": [
     "cli",
     "parser",
@@ -9,23 +9,30 @@
     "option",
     "args"
   ],
-  "main": "argparse.js",
+  "main": "lib/argparse.js",
+  "types": "lib/argparse.d.ts",
   "files": [
-    "argparse.js",
     "lib/"
   ],
   "license": "Python-2.0",
   "repository": "nodeca/argparse",
+  "funding": [
+    {
+      "type": "github",
+      "url": "https://github.com/sponsors/puzrin"
+    },
+    {
+      "type": "github",
+      "url": "https://github.com/sponsors/nodeca"
+    }
+  ],
   "scripts": {
     "lint": "eslint .",
-    "test": "npm run lint && nyc mocha",
-    "coverage": "npm run test && nyc report --reporter html"
+    "test": "npm run lint && node --test",
+    "coverage": "c8 --reporter html npm test"
   },
   "devDependencies": {
-    "@babel/eslint-parser": "^7.11.0",
-    "@babel/plugin-syntax-class-properties": "^7.10.4",
-    "eslint": "^7.5.0",
-    "mocha": "^8.0.1",
-    "nyc": "^15.1.0"
+    "c8": "^11.0.0",
+    "neostandard": "^0.13.0"
   }
 }

package/node_modules/markdown-it/node_modules/entities/dist/decode-codepoint.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Replace the given code point with a replacement character if it is a
+ * surrogate or is outside the valid range. Otherwise return the code
+ * point unchanged.
+ * @param codePoint Unicode code point to convert.
+ */
+export declare function replaceCodePoint(codePoint: number): number;
+//# sourceMappingURL=decode-codepoint.d.ts.map

package/node_modules/markdown-it/node_modules/entities/dist/decode-codepoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decode-codepoint.d.ts","sourceRoot":"","sources":["../src/decode-codepoint.ts"],"names":[],"mappings":"AAkCA;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAS1D"}

package/node_modules/markdown-it/node_modules/entities/dist/decode-codepoint.js

@@ -0,0 +1,46 @@
+// Adapted from https://github.com/mathiasbynens/he/blob/36afe179392226cf1b6ccdb16ebbb7a5a844d93a/src/he.js#L106-L134
+const decodeMap = new Map([
+    [0, 65_533],
+    // C1 Unicode control character reference replacements
+    [128, 8364],
+    [130, 8218],
+    [131, 402],
+    [132, 8222],
+    [133, 8230],
+    [134, 8224],
+    [135, 8225],
+    [136, 710],
+    [137, 8240],
+    [138, 352],
+    [139, 8249],
+    [140, 338],
+    [142, 381],
+    [145, 8216],
+    [146, 8217],
+    [147, 8220],
+    [148, 8221],
+    [149, 8226],
+    [150, 8211],
+    [151, 8212],
+    [152, 732],
+    [153, 8482],
+    [154, 353],
+    [155, 8250],
+    [156, 339],
+    [158, 382],
+    [159, 376],
+]);
+/**
+ * Replace the given code point with a replacement character if it is a
+ * surrogate or is outside the valid range. Otherwise return the code
+ * point unchanged.
+ * @param codePoint Unicode code point to convert.
+ */
+export function replaceCodePoint(codePoint) {
+    if ((codePoint >= 0xd8_00 && codePoint <= 0xdf_ff) ||
+        codePoint > 0x10_ff_ff) {
+        return 0xff_fd;
+    }
+    return decodeMap.get(codePoint) ?? codePoint;
+}
+//# sourceMappingURL=decode-codepoint.js.map

package/node_modules/markdown-it/node_modules/entities/dist/decode-codepoint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decode-codepoint.js","sourceRoot":"","sources":["../src/decode-codepoint.ts"],"names":[],"mappings":"AAAA,qHAAqH;AAErH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACtB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,sDAAsD;IACtD,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,IAAI,CAAC;IACX,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,CAAC,GAAG,EAAE,GAAG,CAAC;CACb,CAAC,CAAC;AAEH;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAiB;IAC9C,IACI,CAAC,SAAS,IAAI,OAAO,IAAI,SAAS,IAAI,OAAO,CAAC;QAC9C,SAAS,GAAG,UAAU,EACxB,CAAC;QACC,OAAO,OAAO,CAAC;IACnB,CAAC;IAED,OAAO,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC;AACjD,CAAC"}