From 9bce51f651aad297ef9eb6df832bfdaf1de05d84 Mon Sep 17 00:00:00 2001
From: WXL <wl_5969728@163.com>
Date: 星期三, 22 四月 2026 14:27:54 +0800
Subject: [PATCH] 青岛推送
---
node_modules/webpack/lib/util/binarySearchBounds.js | 28 ++++++++++++++++++----------
1 files changed, 18 insertions(+), 10 deletions(-)
diff --git a/node_modules/webpack/lib/util/binarySearchBounds.js b/node_modules/webpack/lib/util/binarySearchBounds.js
index 040e9bc..e9bcc4d 100644
--- a/node_modules/webpack/lib/util/binarySearchBounds.js
+++ b/node_modules/webpack/lib/util/binarySearchBounds.js
@@ -8,8 +8,8 @@
/* cspell:disable-next-line */
// Refactor: Peter Somogyvari @petermetz
-/** @typedef {">=" | "<=" | "<" | ">" | "-" } BinarySearchPredicate */
-/** @typedef {"GE" | "GT" | "LT" | "LE" | "EQ" } SearchPredicateSuffix */
+/** @typedef {">=" | "<=" | "<" | ">" | "-"} BinarySearchPredicate */
+/** @typedef {"GE" | "GT" | "LT" | "LE" | "EQ"} SearchPredicateSuffix */
/**
* Helper function for compiling binary search functions.
@@ -65,6 +65,12 @@
};
/**
+ * Defines the search type used by this module.
+ * @template T
+ * @typedef {(items: T[], start: number, compareFn?: number | ((item: T, needle: number) => number), l?: number, h?: number) => number} Search
+ */
+
+/**
* This helper functions generate code for two binary search functions:
* A(): Performs a binary search on an array using the comparison operator specified.
* P(): Performs a binary search on an array using a _custom comparison function_
@@ -74,7 +80,7 @@
* @param {boolean} reversed Whether the search should be reversed.
* @param {SearchPredicateSuffix} suffix The suffix to be used in the function name.
* @param {boolean=} earlyOut Whether the search should return as soon as a match is found.
- * @returns {(items: T[], start: number, compareFn?: number | ((item: T, needle: number) => number), l?: number, h?: number) => number} The compiled binary search function.
+ * @returns {Search<T>} The compiled binary search function.
*/
const compileBoundsSearch = (predicate, reversed, suffix, earlyOut) => {
const arg1 = compileSearch("A", `x${predicate}y`, reversed, ["y"], earlyOut);
@@ -106,6 +112,14 @@
return result();
};
+const fns = {
+ ge: compileBoundsSearch(">=", false, "GE"),
+ gt: compileBoundsSearch(">", false, "GT"),
+ lt: compileBoundsSearch("<", true, "LT"),
+ le: compileBoundsSearch("<=", true, "LE"),
+ eq: compileBoundsSearch("-", true, "EQ", true)
+};
+
/**
* These functions are used to perform binary searches on arrays.
* @example
@@ -120,10 +134,4 @@
* const index2 = le(arr, 5); // index2 === 4
* ```
*/
-module.exports = {
- ge: compileBoundsSearch(">=", false, "GE"),
- gt: compileBoundsSearch(">", false, "GT"),
- lt: compileBoundsSearch("<", true, "LT"),
- le: compileBoundsSearch("<=", true, "LE"),
- eq: compileBoundsSearch("-", true, "EQ", true)
-};
+module.exports = fns;
--
Gitblit v1.9.3