File Manager

Current Path: Root / node_modules_old/ webpack/ lib/ util

Parent Directory

Name	Size	Last Modified
[D]hash/	-	2022-10-02 10:08:08
[F]ArrayHelpers.js Edit	1.45 KB	2022-10-02 10:07:50
[F]ArrayQueue.js Edit	2.15 KB	2022-10-02 10:07:51
[F]AsyncQueue.js Edit	9.41 KB	2022-10-02 10:07:53
[F]Hash.js Edit	925 bytes	2022-10-02 10:08:03
[F]IterableHelpers.js Edit	962 bytes	2022-10-02 10:08:04
[F]LazyBucketSortedSet.js Edit	5.60 KB	2022-10-02 10:08:04
[F]LazySet.js Edit	4.46 KB	2022-10-02 10:08:04
[F]MapHelpers.js Edit	472 bytes	2022-10-02 10:08:05
[F]ParallelismFactorCalculator.js Edit	1.49 KB	2022-10-02 10:08:06
[F]Queue.js Edit	1.02 KB	2022-10-02 10:08:07
[F]Semaphore.js Edit	1008 bytes	2022-10-02 10:08:07
[F]SetHelpers.js Edit	2.26 KB	2022-10-02 10:08:07
[F]SortableSet.js Edit	3.55 KB	2022-10-02 10:08:07
[F]StackedCacheMap.js Edit	2.23 KB	2022-10-02 10:08:08
[F]StackedMap.js Edit	3.37 KB	2022-10-02 10:08:08
[F]StringXor.js Edit	1.09 KB	2022-10-02 10:08:08
[F]TupleQueue.js Edit	1.29 KB	2022-10-02 10:08:08
[F]TupleSet.js Edit	2.84 KB	2022-10-02 10:08:08
[F]URLAbsoluteSpecifier.js Edit	2.49 KB	2022-10-02 10:08:08
[F]WeakTupleMap.js Edit	3.36 KB	2022-10-02 10:08:08
[F]binarySearchBounds.js Edit	1.86 KB	2022-10-02 10:07:55
[F]cleverMerge.js Edit	16.15 KB	2022-10-02 10:07:57
[F]comparators.js Edit	12.15 KB	2022-10-02 10:07:58
[F]compileBooleanMatcher.js Edit	5.68 KB	2022-10-02 10:07:58
[F]create-schema-validation.js Edit	711 bytes	2022-10-02 10:08:00
[F]createHash.js Edit	4.71 KB	2022-10-02 10:08:00
[F]deprecation.js Edit	6.30 KB	2022-10-02 10:08:01
[F]deterministicGrouping.js Edit	13.44 KB	2022-10-02 10:08:01
[F]extractUrlAndGlobal.js Edit	531 bytes	2022-10-02 10:08:02
[F]findGraphRoots.js Edit	5.97 KB	2022-10-02 10:08:02
[F]fs.js Edit	11.15 KB	2022-10-02 10:08:02
[F]identifier.js Edit	10.79 KB	2022-10-02 10:08:03
[F]internalSerializables.js Edit	10.53 KB	2022-10-02 10:08:04
[F]makeSerializable.js Edit	640 bytes	2022-10-02 10:08:05
[F]memoize.js Edit	604 bytes	2022-10-02 10:08:05
[F]nonNumericOnlyHash.js Edit	556 bytes	2022-10-02 10:08:06
[F]numberHash.js Edit	1.04 KB	2022-10-02 10:08:06
[F]objectToMap.js Edit	346 bytes	2022-10-02 10:08:06
[F]processAsyncTree.js Edit	1.45 KB	2022-10-02 10:08:07
[F]propertyAccess.js Edit	1.16 KB	2022-10-02 10:08:07
[F]registerExternalSerializer.js Edit	7.73 KB	2022-10-02 10:08:07
[F]runtime.js Edit	14.26 KB	2022-10-02 10:08:07
[F]semver.js Edit	15.36 KB	2022-10-02 10:08:07
[F]serialization.js Edit	3.92 KB	2022-10-02 10:08:07
[F]smartGrouping.js Edit	5.15 KB	2022-10-02 10:08:07
[F]source.js Edit	1.72 KB	2022-10-02 10:08:07

Editing: binarySearchBounds.js

/*
	MIT License http://www.opensource.org/licenses/mit-license.php
	Author Mikola Lysenko @mikolalysenko
*/

"use strict";

/* cspell:disable-next-line */
// Refactor: Peter Somogyvari @petermetz

const compileSearch = (funcName, predicate, reversed, extraArgs, earlyOut) => {
	const code = [
		"function ",
		funcName,
		"(a,l,h,",
		extraArgs.join(","),
		"){",
		earlyOut ? "" : "var i=",
		reversed ? "l-1" : "h+1",
		";while(l<=h){var m=(l+h)>>>1,x=a[m]"
	];

if (earlyOut) {
		if (predicate.indexOf("c") < 0) {
			code.push(";if(x===y){return m}else if(x<=y){");
		} else {
			code.push(";var p=c(x,y);if(p===0){return m}else if(p<=0){");
		}
	} else {
		code.push(";if(", predicate, "){i=m;");
	}
	if (reversed) {
		code.push("l=m+1}else{h=m-1}");
	} else {
		code.push("h=m-1}else{l=m+1}");
	}
	code.push("}");
	if (earlyOut) {
		code.push("return -1};");
	} else {
		code.push("return i};");
	}
	return code.join("");
};

const compileBoundsSearch = (predicate, reversed, suffix, earlyOut) => {
	const arg1 = compileSearch(
		"A",
		"x" + predicate + "y",
		reversed,
		["y"],
		earlyOut
	);

const arg2 = compileSearch(
		"P",
		"c(x,y)" + predicate + "0",
		reversed,
		["y", "c"],
		earlyOut
	);

const fnHeader = "function dispatchBinarySearch";

const fnBody =
		"(a,y,c,l,h){\
if(typeof(c)==='function'){\
return P(a,(l===void 0)?0:l|0,(h===void 0)?a.length-1:h|0,y,c)\
}else{\
return A(a,(c===void 0)?0:c|0,(l===void 0)?a.length-1:l|0,y)\
}}\
return dispatchBinarySearch";

const fnArgList = [arg1, arg2, fnHeader, suffix, fnBody, suffix];
	const fnSource = fnArgList.join("");
	const result = new Function(fnSource);
	return result();
};

module.exports = {
	ge: compileBoundsSearch(">=", false, "GE"),
	gt: compileBoundsSearch(">", false, "GT"),
	lt: compileBoundsSearch("<", true, "LT"),
	le: compileBoundsSearch("<=", true, "LE"),
	eq: compileBoundsSearch("-", true, "EQ", true)
};

Cancel

File Explorer

Navigation

File Manager

Editing: binarySearchBounds.js

File Explorer

Navigation

File Manager

Editing: binarySearchBounds.js

Confirm Deletion

Rename Item

Change Permissions (Chmod)