feat:node-modules

This commit is contained in:
houjunxiang
2025-11-24 10:26:18 +08:00
parent 753766893b
commit 8a3e48d856
8825 changed files with 567399 additions and 1 deletions

View File

@@ -0,0 +1,8 @@
export var bitAndDocs = {
name: 'bitAnd',
category: 'Bitwise',
syntax: ['x & y', 'bitAnd(x, y)'],
description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',
examples: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],
seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
};

View File

@@ -0,0 +1,8 @@
export var bitNotDocs = {
name: 'bitNot',
category: 'Bitwise',
syntax: ['~x', 'bitNot(x)'],
description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',
examples: ['~1', '~2', 'bitNot([2, -3, 4])'],
seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
};

View File

@@ -0,0 +1,8 @@
export var bitOrDocs = {
name: 'bitOr',
category: 'Bitwise',
syntax: ['x | y', 'bitOr(x, y)'],
description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',
examples: ['5 | 3', 'bitOr([1, 2, 3], 4)'],
seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
};

View File

@@ -0,0 +1,8 @@
export var bitXorDocs = {
name: 'bitXor',
category: 'Bitwise',
syntax: ['bitXor(x, y)'],
description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',
examples: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']
};

View File

@@ -0,0 +1,8 @@
export var leftShiftDocs = {
name: 'leftShift',
category: 'Bitwise',
syntax: ['x << y', 'leftShift(x, y)'],
description: 'Bitwise left logical shift of a value x by y number of bits.',
examples: ['4 << 1', '8 >> 1'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']
};

View File

@@ -0,0 +1,8 @@
export var rightArithShiftDocs = {
name: 'rightArithShift',
category: 'Bitwise',
syntax: ['x >> y', 'rightArithShift(x, y)'],
description: 'Bitwise right arithmetic shift of a value x by y number of bits.',
examples: ['8 >> 1', '4 << 1', '-12 >> 2'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']
};

View File

@@ -0,0 +1,8 @@
export var rightLogShiftDocs = {
name: 'rightLogShift',
category: 'Bitwise',
syntax: ['x >>> y', 'rightLogShift(x, y)'],
description: 'Bitwise right logical shift of a value x by y number of bits.',
examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']
};