Linux ubuntu22 5.15.0-133-generic #144-Ubuntu SMP Fri Feb 7 20:47:38 UTC 2025 x86_64
nginx/1.18.0
: 128.199.27.159 | : 216.73.216.159
Cant Read [ /etc/named.conf ]
8.1.31
www-data
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
home /
amatya /
quiz1 /
node_modules /
webpack /
lib /
util /
[ HOME SHELL ]
Name
Size
Permission
Action
hash
[ DIR ]
dr-xr-xr-x
ArrayHelpers.js
1.5
KB
-rw-rw-rw-
ArrayQueue.js
1.93
KB
-rw-rw-rw-
AsyncQueue.js
10.27
KB
-rw-rw-rw-
Hash.js
925
B
-rw-rw-rw-
IterableHelpers.js
958
B
-rw-rw-rw-
LazyBucketSortedSet.js
5.88
KB
-rw-rw-rw-
LazySet.js
5.01
KB
-rw-rw-rw-
MapHelpers.js
1.06
KB
-rw-rw-rw-
ParallelismFactorCalculator.js
1.73
KB
-rw-rw-rw-
Queue.js
1.04
KB
-rw-rw-rw-
Semaphore.js
1
KB
-rw-rw-rw-
SetHelpers.js
2.31
KB
-rw-rw-rw-
SortableSet.js
3.63
KB
-rw-rw-rw-
StackedCacheMap.js
3.31
KB
-rw-rw-rw-
StackedMap.js
3.34
KB
-rw-rw-rw-
StringXor.js
2.97
KB
-rw-rw-rw-
TupleQueue.js
1.3
KB
-rw-rw-rw-
TupleSet.js
3.05
KB
-rw-rw-rw-
URLAbsoluteSpecifier.js
2.48
KB
-rw-rw-rw-
WeakTupleMap.js
3.99
KB
-rw-rw-rw-
binarySearchBounds.js
4.12
KB
-rw-rw-rw-
chainedImports.js
4.18
KB
-rw-rw-rw-
cleverMerge.js
17.6
KB
-rw-rw-rw-
comparators.js
13.6
KB
-rw-rw-rw-
compileBooleanMatcher.js
6.45
KB
-rw-rw-rw-
concatenate.js
6.65
KB
-rw-rw-rw-
conventions.js
2.89
KB
-rw-rw-rw-
create-schema-validation.js
1.16
KB
-rw-rw-rw-
createHash.js
5.46
KB
-rw-rw-rw-
deprecation.js
8.13
KB
-rw-rw-rw-
deterministicGrouping.js
14.56
KB
-rw-rw-rw-
extractUrlAndGlobal.js
531
B
-rw-rw-rw-
findGraphRoots.js
6.02
KB
-rw-rw-rw-
fs.js
22.84
KB
-rw-rw-rw-
identifier.js
11.75
KB
-rw-rw-rw-
internalSerializables.js
10.87
KB
-rw-rw-rw-
magicComment.js
567
B
-rw-rw-rw-
makeSerializable.js
1.79
KB
-rw-rw-rw-
memoize.js
678
B
-rw-rw-rw-
nonNumericOnlyHash.js
562
B
-rw-rw-rw-
numberHash.js
2.86
KB
-rw-rw-rw-
objectToMap.js
343
B
-rw-rw-rw-
processAsyncTree.js
1.55
KB
-rw-rw-rw-
propertyAccess.js
727
B
-rw-rw-rw-
propertyName.js
1.31
KB
-rw-rw-rw-
registerExternalSerializer.js
7.72
KB
-rw-rw-rw-
runtime.js
15.79
KB
-rw-rw-rw-
semver.js
17.46
KB
-rw-rw-rw-
serialization.js
4.6
KB
-rw-rw-rw-
smartGrouping.js
5.14
KB
-rw-rw-rw-
source.js
1.72
KB
-rw-rw-rw-
Delete
Unzip
Zip
${this.title}
Close
Code Editor : StringXor.js
/* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ "use strict"; /** @typedef {import("../util/Hash")} Hash */ /** * StringXor class provides methods for performing * [XOR operations](https://en.wikipedia.org/wiki/Exclusive_or) on strings. In this context * we operating on the character codes of two strings, which are represented as * [Buffer](https://nodejs.org/api/buffer.html) objects. * * We use [StringXor in webpack](https://github.com/webpack/webpack/commit/41a8e2ea483a544c4ccd3e6217bdfb80daffca39) * to create a hash of the current state of the compilation. By XOR'ing the Module hashes, it * doesn't matter if the Module hashes are sorted or not. This is useful because it allows us to avoid sorting the * Module hashes. * @example * ```js * const xor = new StringXor(); * xor.add('hello'); * xor.add('world'); * console.log(xor.toString()); * ``` * @example * ```js * const xor = new StringXor(); * xor.add('foo'); * xor.add('bar'); * const hash = createHash('sha256'); * hash.update(xor.toString()); * console.log(hash.digest('hex')); * ``` */ class StringXor { constructor() { /** @type {Buffer|undefined} */ this._value = undefined; } /** * Adds a string to the current StringXor object. * @param {string} str string * @returns {void} */ add(str) { const len = str.length; const value = this._value; if (value === undefined) { /** * We are choosing to use Buffer.allocUnsafe() because it is often faster than Buffer.alloc() because * it allocates a new buffer of the specified size without initializing the memory. */ const newValue = (this._value = Buffer.allocUnsafe(len)); for (let i = 0; i < len; i++) { newValue[i] = str.charCodeAt(i); } return; } const valueLen = value.length; if (valueLen < len) { const newValue = (this._value = Buffer.allocUnsafe(len)); let i; for (i = 0; i < valueLen; i++) { newValue[i] = value[i] ^ str.charCodeAt(i); } for (; i < len; i++) { newValue[i] = str.charCodeAt(i); } } else { for (let i = 0; i < len; i++) { value[i] = value[i] ^ str.charCodeAt(i); } } } /** * Returns a string that represents the current state of the StringXor object. We chose to use "latin1" encoding * here because "latin1" encoding is a single-byte encoding that can represent all characters in the * [ISO-8859-1 character set](https://en.wikipedia.org/wiki/ISO/IEC_8859-1). This is useful when working * with binary data that needs to be represented as a string. * @returns {string} Returns a string that represents the current state of the StringXor object. */ toString() { const value = this._value; return value === undefined ? "" : value.toString("latin1"); } /** * Updates the hash with the current state of the StringXor object. * @param {Hash} hash Hash instance */ updateHash(hash) { const value = this._value; if (value !== undefined) hash.update(value); } } module.exports = StringXor;
Close