@nodef/extra-bit 2.4.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +100 -0
- package/deno.lock +37 -0
- package/index.d.ts +85 -0
- package/index.js +233 -0
- package/index.test.ts +239 -0
- package/package.json +15 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2020-26 Subhajit Sahu
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/README.md
ADDED
|
@@ -0,0 +1,100 @@
|
|
|
1
|
+
The [bit] is a basic unit of information in information theory, computing.<br>
|
|
2
|
+
|
|
3
|
+
▌
|
|
4
|
+
📦 [JSR](https://jsr.io/@nodef/extra-bit),
|
|
5
|
+
📦 [NPM](https://www.npmjs.com/package/@nodef/extra-bit),
|
|
6
|
+
📰 [Docs](https://jsr.io/@nodef/extra-bit/doc).
|
|
7
|
+
|
|
8
|
+
The concept of a **bit**, which stands for *binary digit*, has been a
|
|
9
|
+
fundamental unit of information in the fields of information theory and
|
|
10
|
+
computing. Bitwise operations are used to manipulate and process data at the bit
|
|
11
|
+
level, and these operations are *crucial for efficient programming* in a variety
|
|
12
|
+
of domains, such as computer graphics and cryptography. JavaScript converts a
|
|
13
|
+
`Number` (a *64-bit floating* *point number*) to a *32-bit integer* when bitwise
|
|
14
|
+
operators (such as `|`) are applied. All bitwise operations are performed on
|
|
15
|
+
**32-bit integers**. This package includes [bit twiddling hacks] by *Sean Eron*
|
|
16
|
+
*Anderson* and many others.
|
|
17
|
+
|
|
18
|
+
[bit]: https://en.wikipedia.org/wiki/Bit
|
|
19
|
+
[bit twiddling hacks]: https://graphics.stanford.edu/~seander/bithacks.html
|
|
20
|
+
|
|
21
|
+
<br>
|
|
22
|
+
|
|
23
|
+
```javascript
|
|
24
|
+
import * as xbit from "jsr:@nodef/extra-bit";
|
|
25
|
+
|
|
26
|
+
xbit.count(7);
|
|
27
|
+
// → 3 (111 ⇒ 3)
|
|
28
|
+
|
|
29
|
+
xbit.parity(8, 2);
|
|
30
|
+
// → 2 (10,00 ⇒ 10)
|
|
31
|
+
|
|
32
|
+
xbit.swap(6, 1, 0);
|
|
33
|
+
// → 5 (110 ⇒ 101)
|
|
34
|
+
|
|
35
|
+
xbit.reverse(0xFFFF0000);
|
|
36
|
+
// → 65535 (0x0000FFFF)
|
|
37
|
+
|
|
38
|
+
xbit.signExtend(15, 4);
|
|
39
|
+
// → -1
|
|
40
|
+
```
|
|
41
|
+
|
|
42
|
+
<br>
|
|
43
|
+
<br>
|
|
44
|
+
|
|
45
|
+
|
|
46
|
+
## Index
|
|
47
|
+
|
|
48
|
+
| Property | Description |
|
|
49
|
+
| ---- | ---- |
|
|
50
|
+
| [get] | Get bits at specified index. |
|
|
51
|
+
| [getAs] | Get bits as per mask. |
|
|
52
|
+
| [set] | Set bits at specified index. |
|
|
53
|
+
| [setAs] | Set bits as per mask. |
|
|
54
|
+
| [toggle] | Toggle bits at specified index. |
|
|
55
|
+
| [toggleAs] | Toggle bits as per mask. |
|
|
56
|
+
| [swap] | Swap bit sequences at specified indices. |
|
|
57
|
+
| [scan] | Find index of first set bit from LSB. |
|
|
58
|
+
| [scanReverse] | Find index of first set bit from MSB. |
|
|
59
|
+
| [count] | Count bits set. |
|
|
60
|
+
| [parity] | Calculate n-bit parity. |
|
|
61
|
+
| [rotate] | Rotate bits by a certain amount. |
|
|
62
|
+
| [reverse] | Reverse all bits. |
|
|
63
|
+
| [merge] | Merge bits as per mask. |
|
|
64
|
+
| [interleave] | Interleave bits of two int16s. |
|
|
65
|
+
| [signExtend] | Sign extend variable bit-width integer. |
|
|
66
|
+
|
|
67
|
+
<br>
|
|
68
|
+
<br>
|
|
69
|
+
|
|
70
|
+
|
|
71
|
+
## References
|
|
72
|
+
|
|
73
|
+
- [Bit Twiddling Hacks by Sean Eron Anderson](https://graphics.stanford.edu/~seander/bithacks.html)
|
|
74
|
+
- [bit-twiddle package by @mikolalysenko](https://www.npmjs.com/package/bit-twiddle)
|
|
75
|
+
|
|
76
|
+
<br>
|
|
77
|
+
<br>
|
|
78
|
+
|
|
79
|
+
|
|
80
|
+
[](https://wolfram77.github.io)<br>
|
|
81
|
+
[](https://nodef.github.io)
|
|
82
|
+

|
|
83
|
+
|
|
84
|
+
|
|
85
|
+
[get]: https://jsr.io/@nodef/extra-bit/doc/~/get
|
|
86
|
+
[getAs]: https://jsr.io/@nodef/extra-bit/doc/~/getAs
|
|
87
|
+
[set]: https://jsr.io/@nodef/extra-bit/doc/~/set
|
|
88
|
+
[setAs]: https://jsr.io/@nodef/extra-bit/doc/~/setAs
|
|
89
|
+
[toggle]: https://jsr.io/@nodef/extra-bit/doc/~/toggle
|
|
90
|
+
[toggleAs]: https://jsr.io/@nodef/extra-bit/doc/~/toggleAs
|
|
91
|
+
[swap]: https://jsr.io/@nodef/extra-bit/doc/~/swap
|
|
92
|
+
[scan]: https://jsr.io/@nodef/extra-bit/doc/~/scan
|
|
93
|
+
[scanReverse]: https://jsr.io/@nodef/extra-bit/doc/~/scanReverse
|
|
94
|
+
[count]: https://jsr.io/@nodef/extra-bit/doc/~/count
|
|
95
|
+
[parity]: https://jsr.io/@nodef/extra-bit/doc/~/parity
|
|
96
|
+
[rotate]: https://jsr.io/@nodef/extra-bit/doc/~/rotate
|
|
97
|
+
[reverse]: https://jsr.io/@nodef/extra-bit/doc/~/reverse
|
|
98
|
+
[merge]: https://jsr.io/@nodef/extra-bit/doc/~/merge
|
|
99
|
+
[interleave]: https://jsr.io/@nodef/extra-bit/doc/~/interleave
|
|
100
|
+
[signExtend]: https://jsr.io/@nodef/extra-bit/doc/~/signExtend
|
package/deno.lock
ADDED
|
@@ -0,0 +1,37 @@
|
|
|
1
|
+
{
|
|
2
|
+
"version": "5",
|
|
3
|
+
"specifiers": {
|
|
4
|
+
"jsr:@std/assert@^1.0.19": "1.0.19",
|
|
5
|
+
"jsr:@std/cli@^1.0.32": "1.0.32",
|
|
6
|
+
"jsr:@std/fmt@^1.0.10": "1.0.10",
|
|
7
|
+
"jsr:@std/internal@^1.0.12": "1.0.14",
|
|
8
|
+
"jsr:@std/internal@^1.0.14": "1.0.14"
|
|
9
|
+
},
|
|
10
|
+
"jsr": {
|
|
11
|
+
"@std/assert@1.0.19": {
|
|
12
|
+
"integrity": "eaada96ee120cb980bc47e040f82814d786fe8162ecc53c91d8df60b8755991e",
|
|
13
|
+
"dependencies": [
|
|
14
|
+
"jsr:@std/internal@^1.0.12"
|
|
15
|
+
]
|
|
16
|
+
},
|
|
17
|
+
"@std/cli@1.0.32": {
|
|
18
|
+
"integrity": "188b3a100d6202d64e3f5bd3d799c7fa4f6d77f92cc65eb7f641c1fa0aa92a66",
|
|
19
|
+
"dependencies": [
|
|
20
|
+
"jsr:@std/fmt",
|
|
21
|
+
"jsr:@std/internal@^1.0.14"
|
|
22
|
+
]
|
|
23
|
+
},
|
|
24
|
+
"@std/fmt@1.0.10": {
|
|
25
|
+
"integrity": "90dfba288802ac6de82fb31d0917eb9e4450b9925b954d5e51fc29ac07419db5"
|
|
26
|
+
},
|
|
27
|
+
"@std/internal@1.0.14": {
|
|
28
|
+
"integrity": "291516b3d4c35024d6ffbc0a9df5bf4c64116e05b50012cf846710152d2ffdf7"
|
|
29
|
+
}
|
|
30
|
+
},
|
|
31
|
+
"workspace": {
|
|
32
|
+
"dependencies": [
|
|
33
|
+
"jsr:@std/assert@^1.0.19",
|
|
34
|
+
"jsr:@std/cli@^1.0.32"
|
|
35
|
+
]
|
|
36
|
+
}
|
|
37
|
+
}
|
package/index.d.ts
ADDED
|
@@ -0,0 +1,85 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Get bits at specified index.
|
|
3
|
+
* @param x an int32
|
|
4
|
+
* @param i bit index
|
|
5
|
+
* @param w bit width [1]
|
|
6
|
+
*/ export declare function get(x: number, i: number, w?: number): number;
|
|
7
|
+
/**
|
|
8
|
+
* Get bits as per mask.
|
|
9
|
+
* @param x an int32
|
|
10
|
+
* @param m bit mask
|
|
11
|
+
*/ export declare function getAs(x: number, m: number): number;
|
|
12
|
+
/**
|
|
13
|
+
* Set bits at specified index.
|
|
14
|
+
* @param x an int32
|
|
15
|
+
* @param i bit index
|
|
16
|
+
* @param v bit value [1]
|
|
17
|
+
* @param w bit width [1]
|
|
18
|
+
*/ export declare function set(x: number, i: number, v?: number, w?: number): number;
|
|
19
|
+
/**
|
|
20
|
+
* Set bits as per mask.
|
|
21
|
+
* @param x an int32
|
|
22
|
+
* @param m bit mask
|
|
23
|
+
* @param f bit value [1]
|
|
24
|
+
*/ export declare function setAs(x: number, m: number, f?: number): number;
|
|
25
|
+
/**
|
|
26
|
+
* Toggle bits at specified index.
|
|
27
|
+
* @param x an int32
|
|
28
|
+
* @param i bit index
|
|
29
|
+
* @param w bit width [1]
|
|
30
|
+
*/ export declare function toggle(x: number, i: number, w?: number): number;
|
|
31
|
+
/**
|
|
32
|
+
* Toggle bits as per mask.
|
|
33
|
+
* @param x an int32
|
|
34
|
+
* @param m bit mask
|
|
35
|
+
*/ export declare function toggleAs(x: number, m: number): number;
|
|
36
|
+
/**
|
|
37
|
+
* Swap bit sequences at specified indices.
|
|
38
|
+
* @param x an int32
|
|
39
|
+
* @param i first bit index
|
|
40
|
+
* @param j second bit index
|
|
41
|
+
* @param w bit width [1]
|
|
42
|
+
*/ export declare function swap(x: number, i: number, j: number, w?: number): number;
|
|
43
|
+
/**
|
|
44
|
+
* Find index of first set bit from LSB.
|
|
45
|
+
* @param x an int32
|
|
46
|
+
*/ export declare function scan(x: number): number;
|
|
47
|
+
/**
|
|
48
|
+
* Find index of first set bit from MSB.
|
|
49
|
+
* @param x an int32
|
|
50
|
+
*/ export declare function scanReverse(x: number): number;
|
|
51
|
+
/**
|
|
52
|
+
* Count bits set.
|
|
53
|
+
* @param x an int32
|
|
54
|
+
*/ export declare function count(x: number): number;
|
|
55
|
+
/**
|
|
56
|
+
* Calculate n-bit parity.
|
|
57
|
+
* @param x an int32
|
|
58
|
+
* @param n number of bits [1]
|
|
59
|
+
*/ export declare function parity(x: number, n?: number): number;
|
|
60
|
+
/**
|
|
61
|
+
* Rotate bits by a certain amount.
|
|
62
|
+
* @param x an int32
|
|
63
|
+
* @param n rotate amount (+ve: left, -ve: right)
|
|
64
|
+
*/ export declare function rotate(x: number, n?: number): number;
|
|
65
|
+
/**
|
|
66
|
+
* Reverse all bits.
|
|
67
|
+
* @param x an int32
|
|
68
|
+
*/ export declare function reverse(x: number): number;
|
|
69
|
+
/**
|
|
70
|
+
* Merge bits as per mask.
|
|
71
|
+
* @param x first int32
|
|
72
|
+
* @param y second int32
|
|
73
|
+
* @param m bit mask (0 ⇒ from x)
|
|
74
|
+
*/ export declare function merge(x: number, y: number, m: number): number;
|
|
75
|
+
/**
|
|
76
|
+
* Interleave bits of two int16s.
|
|
77
|
+
* @param x first int16
|
|
78
|
+
* @param y second int16
|
|
79
|
+
* @returns int32
|
|
80
|
+
*/ export declare function interleave(x: number, y: number): number;
|
|
81
|
+
/**
|
|
82
|
+
* Sign extend variable bit-width integer.
|
|
83
|
+
* @param x variable bit-width integer
|
|
84
|
+
* @param w bit width (32)
|
|
85
|
+
*/ export declare function signExtend(x: number, w?: number): number;
|
package/index.js
ADDED
|
@@ -0,0 +1,233 @@
|
|
|
1
|
+
// METHODS
|
|
2
|
+
// =======
|
|
3
|
+
// Get integer with 1s of specified width in bits.
|
|
4
|
+
function ones(w) {
|
|
5
|
+
return (1 << w) - 1;
|
|
6
|
+
}
|
|
7
|
+
/**
|
|
8
|
+
* Get bits at specified index.
|
|
9
|
+
* @param x an int32
|
|
10
|
+
* @param i bit index
|
|
11
|
+
* @param w bit width [1]
|
|
12
|
+
*/ export function get(x, i, w = 1) {
|
|
13
|
+
return x >>> i & ones(w);
|
|
14
|
+
}
|
|
15
|
+
/**
|
|
16
|
+
* Get bits as per mask.
|
|
17
|
+
* @param x an int32
|
|
18
|
+
* @param m bit mask
|
|
19
|
+
*/ export function getAs(x, m) {
|
|
20
|
+
return x & m;
|
|
21
|
+
}
|
|
22
|
+
/**
|
|
23
|
+
* Set bits at specified index.
|
|
24
|
+
* @param x an int32
|
|
25
|
+
* @param i bit index
|
|
26
|
+
* @param v bit value [1]
|
|
27
|
+
* @param w bit width [1]
|
|
28
|
+
*/ export function set(x, i, v = 1, w = 1) {
|
|
29
|
+
return x & ~(ones(w) << i) | v << i;
|
|
30
|
+
}
|
|
31
|
+
/**
|
|
32
|
+
* Set bits as per mask.
|
|
33
|
+
* @param x an int32
|
|
34
|
+
* @param m bit mask
|
|
35
|
+
* @param f bit value [1]
|
|
36
|
+
*/ export function setAs(x, m, f = 1) {
|
|
37
|
+
return x & ~m | -f & m;
|
|
38
|
+
}
|
|
39
|
+
/**
|
|
40
|
+
* Toggle bits at specified index.
|
|
41
|
+
* @param x an int32
|
|
42
|
+
* @param i bit index
|
|
43
|
+
* @param w bit width [1]
|
|
44
|
+
*/ export function toggle(x, i, w = 1) {
|
|
45
|
+
return x ^ ones(w) << i;
|
|
46
|
+
}
|
|
47
|
+
/**
|
|
48
|
+
* Toggle bits as per mask.
|
|
49
|
+
* @param x an int32
|
|
50
|
+
* @param m bit mask
|
|
51
|
+
*/ export function toggleAs(x, m) {
|
|
52
|
+
return x ^ m;
|
|
53
|
+
}
|
|
54
|
+
/**
|
|
55
|
+
* Swap bit sequences at specified indices.
|
|
56
|
+
* @param x an int32
|
|
57
|
+
* @param i first bit index
|
|
58
|
+
* @param j second bit index
|
|
59
|
+
* @param w bit width [1]
|
|
60
|
+
*/ export function swap(x, i, j, w = 1) {
|
|
61
|
+
const t = (x >>> i ^ x >>> j) & ones(w);
|
|
62
|
+
return x ^ (t << i | t << j);
|
|
63
|
+
}
|
|
64
|
+
const MOD37_POS32 = [
|
|
65
|
+
32,
|
|
66
|
+
0,
|
|
67
|
+
1,
|
|
68
|
+
26,
|
|
69
|
+
2,
|
|
70
|
+
23,
|
|
71
|
+
27,
|
|
72
|
+
0,
|
|
73
|
+
3,
|
|
74
|
+
16,
|
|
75
|
+
24,
|
|
76
|
+
30,
|
|
77
|
+
28,
|
|
78
|
+
11,
|
|
79
|
+
0,
|
|
80
|
+
13,
|
|
81
|
+
4,
|
|
82
|
+
7,
|
|
83
|
+
17,
|
|
84
|
+
0,
|
|
85
|
+
25,
|
|
86
|
+
22,
|
|
87
|
+
31,
|
|
88
|
+
15,
|
|
89
|
+
29,
|
|
90
|
+
10,
|
|
91
|
+
12,
|
|
92
|
+
6,
|
|
93
|
+
0,
|
|
94
|
+
21,
|
|
95
|
+
14,
|
|
96
|
+
9,
|
|
97
|
+
5,
|
|
98
|
+
20,
|
|
99
|
+
8,
|
|
100
|
+
19,
|
|
101
|
+
18
|
|
102
|
+
];
|
|
103
|
+
/**
|
|
104
|
+
* Find index of first set bit from LSB.
|
|
105
|
+
* @param x an int32
|
|
106
|
+
*/ export function scan(x) {
|
|
107
|
+
return MOD37_POS32[(-x & x) % 37];
|
|
108
|
+
}
|
|
109
|
+
const DEBRUIJN_POS32 = [
|
|
110
|
+
0,
|
|
111
|
+
9,
|
|
112
|
+
1,
|
|
113
|
+
10,
|
|
114
|
+
13,
|
|
115
|
+
21,
|
|
116
|
+
2,
|
|
117
|
+
29,
|
|
118
|
+
11,
|
|
119
|
+
14,
|
|
120
|
+
16,
|
|
121
|
+
18,
|
|
122
|
+
22,
|
|
123
|
+
25,
|
|
124
|
+
3,
|
|
125
|
+
30,
|
|
126
|
+
8,
|
|
127
|
+
12,
|
|
128
|
+
20,
|
|
129
|
+
28,
|
|
130
|
+
15,
|
|
131
|
+
17,
|
|
132
|
+
24,
|
|
133
|
+
7,
|
|
134
|
+
19,
|
|
135
|
+
27,
|
|
136
|
+
23,
|
|
137
|
+
6,
|
|
138
|
+
26,
|
|
139
|
+
5,
|
|
140
|
+
4,
|
|
141
|
+
31
|
|
142
|
+
];
|
|
143
|
+
/**
|
|
144
|
+
* Find index of first set bit from MSB.
|
|
145
|
+
* @param x an int32
|
|
146
|
+
*/ export function scanReverse(x) {
|
|
147
|
+
x |= x >>> 1;
|
|
148
|
+
x |= x >>> 2;
|
|
149
|
+
x |= x >>> 4;
|
|
150
|
+
x |= x >>> 8;
|
|
151
|
+
x |= x >>> 16;
|
|
152
|
+
return DEBRUIJN_POS32[x * 0x07C4ACDD >>> 27];
|
|
153
|
+
}
|
|
154
|
+
/**
|
|
155
|
+
* Count bits set.
|
|
156
|
+
* @param x an int32
|
|
157
|
+
*/ export function count(x) {
|
|
158
|
+
x = x - (x >>> 1 & 0x55555555);
|
|
159
|
+
x = (x & 0x33333333) + (x >>> 2 & 0x33333333);
|
|
160
|
+
return (x + (x >>> 4) & 0x0F0F0F0F) * 0x01010101 >>> 24;
|
|
161
|
+
}
|
|
162
|
+
// Calculate 1-bit parity.
|
|
163
|
+
function parity1(x) {
|
|
164
|
+
x ^= x >>> 16;
|
|
165
|
+
x ^= x >>> 8;
|
|
166
|
+
x ^= x >>> 4;
|
|
167
|
+
x &= 0xF;
|
|
168
|
+
return 0x6996 >>> x & 1;
|
|
169
|
+
}
|
|
170
|
+
/**
|
|
171
|
+
* Calculate n-bit parity.
|
|
172
|
+
* @param x an int32
|
|
173
|
+
* @param n number of bits [1]
|
|
174
|
+
*/ export function parity(x, n = 1) {
|
|
175
|
+
if (n === 1) return parity1(x);
|
|
176
|
+
const m = (1 << n) - 1;
|
|
177
|
+
let a = 0 | 0;
|
|
178
|
+
while(x){
|
|
179
|
+
a ^= x & m;
|
|
180
|
+
x >>>= n;
|
|
181
|
+
}
|
|
182
|
+
return a;
|
|
183
|
+
}
|
|
184
|
+
/**
|
|
185
|
+
* Rotate bits by a certain amount.
|
|
186
|
+
* @param x an int32
|
|
187
|
+
* @param n rotate amount (+ve: left, -ve: right)
|
|
188
|
+
*/ export function rotate(x, n = 0) {
|
|
189
|
+
return n < 0 ? x << 32 + n | x >>> -n : x << n | x >> 32 - n;
|
|
190
|
+
}
|
|
191
|
+
/**
|
|
192
|
+
* Reverse all bits.
|
|
193
|
+
* @param x an int32
|
|
194
|
+
*/ export function reverse(x) {
|
|
195
|
+
x = x >>> 1 & 0x55555555 | (x & 0x55555555) << 1;
|
|
196
|
+
x = x >>> 2 & 0x33333333 | (x & 0x33333333) << 2;
|
|
197
|
+
x = x >>> 4 & 0x0F0F0F0F | (x & 0x0F0F0F0F) << 4;
|
|
198
|
+
x = x >>> 8 & 0x00FF00FF | (x & 0x00FF00FF) << 8;
|
|
199
|
+
return x >>> 16 | x << 16;
|
|
200
|
+
}
|
|
201
|
+
/**
|
|
202
|
+
* Merge bits as per mask.
|
|
203
|
+
* @param x first int32
|
|
204
|
+
* @param y second int32
|
|
205
|
+
* @param m bit mask (0 ⇒ from x)
|
|
206
|
+
*/ export function merge(x, y, m) {
|
|
207
|
+
return x ^ (x ^ y) & m;
|
|
208
|
+
}
|
|
209
|
+
/**
|
|
210
|
+
* Interleave bits of two int16s.
|
|
211
|
+
* @param x first int16
|
|
212
|
+
* @param y second int16
|
|
213
|
+
* @returns int32
|
|
214
|
+
*/ export function interleave(x, y) {
|
|
215
|
+
x = (x | x << 8) & 0x00FF00FF;
|
|
216
|
+
x = (x | x << 4) & 0x0F0F0F0F;
|
|
217
|
+
x = (x | x << 2) & 0x33333333;
|
|
218
|
+
x = (x | x << 1) & 0x55555555;
|
|
219
|
+
y = (y | y << 8) & 0x00FF00FF;
|
|
220
|
+
y = (y | y << 4) & 0x0F0F0F0F;
|
|
221
|
+
y = (y | y << 2) & 0x33333333;
|
|
222
|
+
y = (y | y << 1) & 0x55555555;
|
|
223
|
+
return y | x << 1;
|
|
224
|
+
}
|
|
225
|
+
/**
|
|
226
|
+
* Sign extend variable bit-width integer.
|
|
227
|
+
* @param x variable bit-width integer
|
|
228
|
+
* @param w bit width (32)
|
|
229
|
+
*/ export function signExtend(x, w = 32) {
|
|
230
|
+
w = 32 - w;
|
|
231
|
+
return x << w >> w;
|
|
232
|
+
}
|
|
233
|
+
//# sourceMappingURL=data:application/json;base64,{"version":3,"sources":["file:///home/runner/work/extra-bit/extra-bit/index.ts"],"sourcesContent":["// METHODS\n// =======\n\n// Get integer with 1s of specified width in bits.\nfunction ones(w: number) {\n  return (1<<w) - 1;\n}\n\n\n/**\n * Get bits at specified index.\n * @param x an int32\n * @param i bit index\n * @param w bit width [1]\n */\nexport function get(x: number, i: number, w: number=1): number {\n  return (x>>>i) & ones(w);\n}\n\n\n/**\n * Get bits as per mask.\n * @param x an int32\n * @param m bit mask\n */\nexport function getAs(x: number, m: number): number {\n  return x & m;\n}\n\n\n/**\n * Set bits at specified index.\n * @param x an int32\n * @param i bit index\n * @param v bit value [1]\n * @param w bit width [1]\n */\nexport function set(x: number, i: number, v: number=1, w: number=1): number {\n  return (x & ~(ones(w)<<i)) | (v<<i);\n}\n\n\n/**\n * Set bits as per mask.\n * @param x an int32\n * @param m bit mask\n * @param f bit value [1]\n */\nexport function setAs(x: number, m: number, f: number=1): number {\n  return (x & ~m) | (-f & m);\n}\n\n\n/**\n * Toggle bits at specified index.\n * @param x an int32\n * @param i bit index\n * @param w bit width [1]\n */\nexport function toggle(x: number, i: number, w: number=1): number {\n  return x ^ (ones(w)<<i);\n}\n\n\n/**\n * Toggle bits as per mask.\n * @param x an int32\n * @param m bit mask\n */\nexport function toggleAs(x: number, m: number): number {\n  return x ^ m;\n}\n\n\n/**\n * Swap bit sequences at specified indices.\n * @param x an int32\n * @param i first bit index\n * @param j second bit index\n * @param w bit width [1]\n */\nexport function swap(x: number, i: number, j: number, w: number=1): number {\n  const t = ((x>>>i)^(x>>>j)) & ones(w);\n  return x ^ ((t<<i)|(t<<j));\n}\n\n\nconst MOD37_POS32: number[] = [\n  32, 0, 1, 26, 2, 23, 27, 0, 3, 16, 24, 30, 28, 11, 0, 13, 4, 7, 17, 0,\n  25, 22, 31, 15, 29, 10, 12, 6, 0, 21, 14, 9, 5, 20, 8, 19, 18\n];\n\n\n/**\n * Find index of first set bit from LSB.\n * @param x an int32\n */\nexport function scan(x: number): number {\n  return MOD37_POS32[(-x & x) % 37];\n}\n\n\nconst DEBRUIJN_POS32: number[] = [\n  0,  9,  1, 10, 13, 21,  2, 29, 11, 14, 16, 18, 22, 25,  3, 30,\n  8, 12, 20, 28, 15, 17, 24,  7, 19, 27, 23,  6, 26,  5,  4, 31\n];\n\n\n/**\n * Find index of first set bit from MSB.\n * @param x an int32\n */\nexport function scanReverse(x: number): number {\n  x |= x>>>1;\n  x |= x>>>2;\n  x |= x>>>4;\n  x |= x>>>8;\n  x |= x>>>16;\n  return DEBRUIJN_POS32[(x*0x07C4ACDD)>>>27];\n}\n\n\n/**\n * Count bits set.\n * @param x an int32\n */\nexport function count(x: number): number {\n  x = x - ((x>>>1) & 0x55555555);\n  x = (x & 0x33333333) + ((x>>>2) & 0x33333333);\n  return ((x + (x>>>4) & 0x0F0F0F0F) * 0x01010101)>>>24;\n}\n\n\n// Calculate 1-bit parity.\nfunction parity1(x: number): number {\n  x ^= x>>>16;\n  x ^= x>>>8;\n  x ^= x>>>4;\n  x &= 0xF;\n  return (0x6996>>>x) & 1;\n}\n\n/**\n * Calculate n-bit parity.\n * @param x an int32\n * @param n number of bits [1]\n */\nexport function parity(x: number, n: number=1): number {\n  if (n===1) return parity1(x);\n  const m = (1<<n)-1; let a = 0|0;\n  while (x) {\n    a ^= x&m;\n    x >>>= n;\n  }\n  return a;\n}\n\n\n/**\n * Rotate bits by a certain amount.\n * @param x an int32\n * @param n rotate amount (+ve: left, -ve: right)\n */\nexport function rotate(x: number, n: number=0): number {\n  return n<0? x<<32+n | x>>>-n : x<<n | x>>32-n;\n}\n\n\n/**\n * Reverse all bits.\n * @param x an int32\n */\nexport function reverse(x: number): number {\n  x = ((x>>>1) & 0x55555555) | ((x & 0x55555555)<<1);\n  x = ((x>>>2) & 0x33333333) | ((x & 0x33333333)<<2);\n  x = ((x>>>4) & 0x0F0F0F0F) | ((x & 0x0F0F0F0F)<<4);\n  x = ((x>>>8) & 0x00FF00FF) | ((x & 0x00FF00FF)<<8);\n  return (x>>>16) | (x<<16);\n}\n\n\n/**\n * Merge bits as per mask.\n * @param x first int32\n * @param y second int32\n * @param m bit mask (0 ⇒ from x)\n */\nexport function merge(x: number, y: number, m: number): number {\n  return x ^ ((x^y) & m);\n}\n\n\n/**\n * Interleave bits of two int16s.\n * @param x first int16\n * @param y second int16\n * @returns int32\n */\nexport function interleave(x: number, y: number): number {\n  x = (x | (x<<8)) & 0x00FF00FF;\n  x = (x | (x<<4)) & 0x0F0F0F0F;\n  x = (x | (x<<2)) & 0x33333333;\n  x = (x | (x<<1)) & 0x55555555;\n  y = (y | (y<<8)) & 0x00FF00FF;\n  y = (y | (y<<4)) & 0x0F0F0F0F;\n  y = (y | (y<<2)) & 0x33333333;\n  y = (y | (y<<1)) & 0x55555555;\n  return y | (x<<1);\n}\n\n\n/**\n * Sign extend variable bit-width integer.\n * @param x variable bit-width integer\n * @param w bit width (32)\n */\nexport function signExtend(x: number, w: number=32): number {\n  w = 32-w;\n  return (x<<w)>>w;\n}\n"],"names":[],"mappings":"AAAA,UAAU;AACV,UAAU;AAEV,kDAAkD;AAClD,SAAS,KAAK,CAAS;EACrB,OAAO,CAAC,KAAG,CAAC,IAAI;AAClB;AAGA;;;;;CAKC,GACD,OAAO,SAAS,IAAI,CAAS,EAAE,CAAS,EAAE,IAAU,CAAC;EACnD,OAAO,AAAC,MAAI,IAAK,KAAK;AACxB;AAGA;;;;CAIC,GACD,OAAO,SAAS,MAAM,CAAS,EAAE,CAAS;EACxC,OAAO,IAAI;AACb;AAGA;;;;;;CAMC,GACD,OAAO,SAAS,IAAI,CAAS,EAAE,CAAS,EAAE,IAAU,CAAC,EAAE,IAAU,CAAC;EAChE,OAAO,AAAC,IAAI,CAAC,CAAC,KAAK,MAAI,CAAC,IAAM,KAAG;AACnC;AAGA;;;;;CAKC,GACD,OAAO,SAAS,MAAM,CAAS,EAAE,CAAS,EAAE,IAAU,CAAC;EACrD,OAAO,AAAC,IAAI,CAAC,IAAM,CAAC,IAAI;AAC1B;AAGA;;;;;CAKC,GACD,OAAO,SAAS,OAAO,CAAS,EAAE,CAAS,EAAE,IAAU,CAAC;EACtD,OAAO,IAAK,KAAK,MAAI;AACvB;AAGA;;;;CAIC,GACD,OAAO,SAAS,SAAS,CAAS,EAAE,CAAS;EAC3C,OAAO,IAAI;AACb;AAGA;;;;;;CAMC,GACD,OAAO,SAAS,KAAK,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,IAAU,CAAC;EAC/D,MAAM,IAAI,CAAC,AAAC,MAAI,IAAI,MAAI,CAAE,IAAI,KAAK;EACnC,OAAO,IAAI,CAAC,AAAC,KAAG,IAAI,KAAG,CAAE;AAC3B;AAGA,MAAM,cAAwB;EAC5B;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EACpE;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;CAC5D;AAGD;;;CAGC,GACD,OAAO,SAAS,KAAK,CAAS;EAC5B,OAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG;AACnC;AAGA,MAAM,iBAA2B;EAC/B;EAAI;EAAI;EAAG;EAAI;EAAI;EAAK;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAK;EAAG;EAC3D;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAAK;EAAG;EAAI;EAAI;EAAK;EAAG;EAAK;EAAI;EAAG;CAC5D;AAGD;;;CAGC,GACD,OAAO,SAAS,YAAY,CAAS;EACnC,KAAK,MAAI;EACT,KAAK,MAAI;EACT,KAAK,MAAI;EACT,KAAK,MAAI;EACT,KAAK,MAAI;EACT,OAAO,cAAc,CAAC,AAAC,IAAE,eAAc,GAAG;AAC5C;AAGA;;;CAGC,GACD,OAAO,SAAS,MAAM,CAAS;EAC7B,IAAI,IAAI,CAAC,AAAC,MAAI,IAAK,UAAU;EAC7B,IAAI,CAAC,IAAI,UAAU,IAAI,CAAC,AAAC,MAAI,IAAK,UAAU;EAC5C,OAAO,AAAC,CAAC,IAAI,CAAC,MAAI,CAAC,IAAI,UAAU,IAAI,eAAc;AACrD;AAGA,0BAA0B;AAC1B,SAAS,QAAQ,CAAS;EACxB,KAAK,MAAI;EACT,KAAK,MAAI;EACT,KAAK,MAAI;EACT,KAAK;EACL,OAAO,AAAC,WAAS,IAAK;AACxB;AAEA;;;;CAIC,GACD,OAAO,SAAS,OAAO,CAAS,EAAE,IAAU,CAAC;EAC3C,IAAI,MAAI,GAAG,OAAO,QAAQ;EAC1B,MAAM,IAAI,CAAC,KAAG,CAAC,IAAE;EAAG,IAAI,IAAI,IAAE;EAC9B,MAAO,EAAG;IACR,KAAK,IAAE;IACP,OAAO;EACT;EACA,OAAO;AACT;AAGA;;;;CAIC,GACD,OAAO,SAAS,OAAO,CAAS,EAAE,IAAU,CAAC;EAC3C,OAAO,IAAE,IAAG,KAAG,KAAG,IAAI,MAAI,CAAC,IAAI,KAAG,IAAI,KAAG,KAAG;AAC9C;AAGA;;;CAGC,GACD,OAAO,SAAS,QAAQ,CAAS;EAC/B,IAAI,AAAE,MAAI,IAAK,aAAe,CAAC,IAAI,UAAU,KAAG;EAChD,IAAI,AAAE,MAAI,IAAK,aAAe,CAAC,IAAI,UAAU,KAAG;EAChD,IAAI,AAAE,MAAI,IAAK,aAAe,CAAC,IAAI,UAAU,KAAG;EAChD,IAAI,AAAE,MAAI,IAAK,aAAe,CAAC,IAAI,UAAU,KAAG;EAChD,OAAO,AAAC,MAAI,KAAO,KAAG;AACxB;AAGA;;;;;CAKC,GACD,OAAO,SAAS,MAAM,CAAS,EAAE,CAAS,EAAE,CAAS;EACnD,OAAO,IAAK,CAAC,IAAE,CAAC,IAAI;AACtB;AAGA;;;;;CAKC,GACD,OAAO,SAAS,WAAW,CAAS,EAAE,CAAS;EAC7C,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,IAAI,CAAC,IAAK,KAAG,CAAE,IAAI;EACnB,OAAO,IAAK,KAAG;AACjB;AAGA;;;;CAIC,GACD,OAAO,SAAS,WAAW,CAAS,EAAE,IAAU,EAAE;EAChD,IAAI,KAAG;EACP,OAAO,AAAC,KAAG,KAAI;AACjB"}
|
package/index.test.ts
ADDED
|
@@ -0,0 +1,239 @@
|
|
|
1
|
+
import {assertEquals} from "@std/assert";
|
|
2
|
+
import {
|
|
3
|
+
get,
|
|
4
|
+
getAs,
|
|
5
|
+
set,
|
|
6
|
+
setAs,
|
|
7
|
+
toggle,
|
|
8
|
+
toggleAs,
|
|
9
|
+
swap,
|
|
10
|
+
scan,
|
|
11
|
+
scanReverse,
|
|
12
|
+
count,
|
|
13
|
+
parity,
|
|
14
|
+
rotate,
|
|
15
|
+
reverse,
|
|
16
|
+
merge,
|
|
17
|
+
interleave,
|
|
18
|
+
signExtend,
|
|
19
|
+
} from "./index.ts";
|
|
20
|
+
|
|
21
|
+
|
|
22
|
+
|
|
23
|
+
|
|
24
|
+
Deno.test("example1", () => {
|
|
25
|
+
let a;
|
|
26
|
+
a = count(7);
|
|
27
|
+
assertEquals(a, 3);
|
|
28
|
+
// → 3 (111 ⇒ 3)
|
|
29
|
+
|
|
30
|
+
a = parity(8, 2);
|
|
31
|
+
assertEquals(a, 2);
|
|
32
|
+
// → 2 (10,00 ⇒ 10)
|
|
33
|
+
|
|
34
|
+
a = swap(6, 1, 0);
|
|
35
|
+
assertEquals(a, 5);
|
|
36
|
+
// → 5 (110 ⇒ 101)
|
|
37
|
+
|
|
38
|
+
a = reverse(0xFFFF0000);
|
|
39
|
+
assertEquals(a, 65535);
|
|
40
|
+
// → 65535 (0x0000FFFF)
|
|
41
|
+
|
|
42
|
+
a = signExtend(15, 4);
|
|
43
|
+
assertEquals(a, -1);
|
|
44
|
+
// → -1
|
|
45
|
+
});
|
|
46
|
+
|
|
47
|
+
|
|
48
|
+
|
|
49
|
+
|
|
50
|
+
// Get bits at specified index.
|
|
51
|
+
Deno.test("get", () => {
|
|
52
|
+
let a;
|
|
53
|
+
a = get(6, 0);
|
|
54
|
+
assertEquals(a, 0); // 110,0 ⇒ 0
|
|
55
|
+
a = get(6, 1);
|
|
56
|
+
assertEquals(a, 1); // 110,1 ⇒ 1
|
|
57
|
+
a = get(6, 2);
|
|
58
|
+
assertEquals(a, 1); // 110,2 ⇒ 1
|
|
59
|
+
});
|
|
60
|
+
|
|
61
|
+
|
|
62
|
+
// Get bits as per mask.
|
|
63
|
+
Deno.test("getAs", () => {
|
|
64
|
+
let a;
|
|
65
|
+
a = getAs(6, 4);
|
|
66
|
+
assertEquals(a, 4); // 110,100 ⇒ 100
|
|
67
|
+
a = getAs(6, 7);
|
|
68
|
+
assertEquals(a, 6); // 110,111 ⇒ 110
|
|
69
|
+
a = getAs(6, 5);
|
|
70
|
+
assertEquals(a, 4); // 110,101 ⇒ 100
|
|
71
|
+
});
|
|
72
|
+
|
|
73
|
+
|
|
74
|
+
// Set bits at specified index.
|
|
75
|
+
Deno.test("set", () => {
|
|
76
|
+
let a;
|
|
77
|
+
a = set(6, 0, 1);
|
|
78
|
+
assertEquals(a, 7); // 110,0,1 ⇒ 111
|
|
79
|
+
a = set(6, 2, 1);
|
|
80
|
+
assertEquals(a, 6); // 110,2,1 ⇒ 110
|
|
81
|
+
a = set(6, 2, 0);
|
|
82
|
+
assertEquals(a, 2); // 110,2,0 ⇒ 010
|
|
83
|
+
});
|
|
84
|
+
|
|
85
|
+
|
|
86
|
+
// Set bits as per mask.
|
|
87
|
+
Deno.test("setAs", () => {
|
|
88
|
+
let a;
|
|
89
|
+
a = setAs(8, 2, 1);
|
|
90
|
+
assertEquals(a, 10); // 0x8 set 0x2 ⇒ 0xA
|
|
91
|
+
a = setAs(15, 3, 0);
|
|
92
|
+
assertEquals(a, 12); // 0xF clear 0x3 ⇒ 0xC
|
|
93
|
+
a = setAs(0x1234, 0x430, 1);
|
|
94
|
+
assertEquals(a, 5684); // 0x1234 set 0x430 ⇒ 0x1634
|
|
95
|
+
});
|
|
96
|
+
|
|
97
|
+
|
|
98
|
+
// Toggle bits at specified index.
|
|
99
|
+
Deno.test("toggle", () => {
|
|
100
|
+
let a;
|
|
101
|
+
a = toggle(6, 0);
|
|
102
|
+
assertEquals(a, 7); // 110,0 ⇒ 111
|
|
103
|
+
a = toggle(6, 1);
|
|
104
|
+
assertEquals(a, 4); // 110,1 ⇒ 100
|
|
105
|
+
a = toggle(6, 2);
|
|
106
|
+
assertEquals(a, 2); // 110,2 ⇒ 010
|
|
107
|
+
});
|
|
108
|
+
|
|
109
|
+
|
|
110
|
+
// Toggle bits as per mask.
|
|
111
|
+
Deno.test("toggleAs", () => {
|
|
112
|
+
let a;
|
|
113
|
+
a = toggleAs(6, 1);
|
|
114
|
+
assertEquals(a, 7); // 110,000 ⇒ 111
|
|
115
|
+
a = toggleAs(6, 7);
|
|
116
|
+
assertEquals(a, 1); // 110,111 ⇒ 001
|
|
117
|
+
a = toggleAs(6, 3);
|
|
118
|
+
assertEquals(a, 5); // 110,011 ⇒ 101
|
|
119
|
+
});
|
|
120
|
+
|
|
121
|
+
|
|
122
|
+
// Swap bit sequences at specified indices.
|
|
123
|
+
Deno.test("swap", () => {
|
|
124
|
+
let a;
|
|
125
|
+
a = swap(6, 1, 0);
|
|
126
|
+
assertEquals(a, 5); // 110 ⇒ 101
|
|
127
|
+
a = swap(0x1234, 8, 4, 4);
|
|
128
|
+
assertEquals(a, 4900); // 0x1234 ⇒ 0x1324
|
|
129
|
+
a = swap(0x4AAB, 8, 0, 8);
|
|
130
|
+
assertEquals(a, 43850); // 0x4AAB ⇒ 0xAB4A
|
|
131
|
+
});
|
|
132
|
+
|
|
133
|
+
|
|
134
|
+
// Find index of first set bit from LSB.
|
|
135
|
+
Deno.test("scan", () => {
|
|
136
|
+
let a;
|
|
137
|
+
a = scan(7);
|
|
138
|
+
assertEquals(a, 0); // 111 ⇒ 0
|
|
139
|
+
a = scan(12);
|
|
140
|
+
assertEquals(a, 2); // 1100 ⇒ 2
|
|
141
|
+
a = scan(64);
|
|
142
|
+
assertEquals(a, 6); // 1000000 ⇒ 6
|
|
143
|
+
});
|
|
144
|
+
|
|
145
|
+
|
|
146
|
+
// Find index of first set bit from MSB.
|
|
147
|
+
Deno.test("scanReverse", () => {
|
|
148
|
+
let a;
|
|
149
|
+
a = scanReverse(13);
|
|
150
|
+
assertEquals(a, 3); // 1101 ⇒ 3
|
|
151
|
+
a = scanReverse(5);
|
|
152
|
+
assertEquals(a, 2); // 101 ⇒ 2
|
|
153
|
+
a = scanReverse(1);
|
|
154
|
+
assertEquals(a, 0); // 1 ⇒ 0
|
|
155
|
+
});
|
|
156
|
+
|
|
157
|
+
|
|
158
|
+
// Count bits set.
|
|
159
|
+
Deno.test("count", () => {
|
|
160
|
+
let a;
|
|
161
|
+
a = count(7);
|
|
162
|
+
assertEquals(a, 3); // 111 ⇒ 3
|
|
163
|
+
a = count(12);
|
|
164
|
+
assertEquals(a, 2); // 1100 ⇒ 2
|
|
165
|
+
a = count(63);
|
|
166
|
+
assertEquals(a, 6); // 111111 ⇒ 6
|
|
167
|
+
});
|
|
168
|
+
|
|
169
|
+
|
|
170
|
+
// Calculate n-bit parity.
|
|
171
|
+
Deno.test("parity", () => {
|
|
172
|
+
let a;
|
|
173
|
+
a = parity(7);
|
|
174
|
+
assertEquals(a, 1); // 1,1,1 ⇒ 1
|
|
175
|
+
a = parity(5);
|
|
176
|
+
assertEquals(a, 0); // 1,0,1 ⇒ 0
|
|
177
|
+
a = parity(8, 2);
|
|
178
|
+
assertEquals(a, 2); // 10,00 ⇒ 10
|
|
179
|
+
a = parity(63, 4);
|
|
180
|
+
assertEquals(a, 12); // 11,1111 ⇒ 1100
|
|
181
|
+
});
|
|
182
|
+
|
|
183
|
+
|
|
184
|
+
// Rotate bits by a certain amount.
|
|
185
|
+
Deno.test("rotate", () => {
|
|
186
|
+
let a;
|
|
187
|
+
a = rotate(0x11112222, 4);
|
|
188
|
+
assertEquals(a, 286401057); // 0x11122221
|
|
189
|
+
a = rotate(0x11112222, -4);
|
|
190
|
+
assertEquals(a, 554766882); // 0x21111222
|
|
191
|
+
});
|
|
192
|
+
|
|
193
|
+
|
|
194
|
+
// Reverse all bits.
|
|
195
|
+
Deno.test("reverse", () => {
|
|
196
|
+
let a;
|
|
197
|
+
a = reverse(0xFFFF0000);
|
|
198
|
+
assertEquals(a, 65535); // 0x0000FFFF
|
|
199
|
+
a = reverse(0x00AABBCC);
|
|
200
|
+
assertEquals(a, 870143232); // 0x33DD5500
|
|
201
|
+
a = reverse(0x1234);
|
|
202
|
+
assertEquals(a, 742916096); // 0x2C480000
|
|
203
|
+
});
|
|
204
|
+
|
|
205
|
+
|
|
206
|
+
// Merge bits as per mask.
|
|
207
|
+
Deno.test("merge", () => {
|
|
208
|
+
let a;
|
|
209
|
+
a = merge(0x12, 0x24, 0x0F);
|
|
210
|
+
assertEquals(a, 20); // 0x14
|
|
211
|
+
a = merge(0x1234, 0xABCD, 0x0F0F);
|
|
212
|
+
assertEquals(a, 6973); // 0x1B3D
|
|
213
|
+
a = merge(0xAAAA, 0xBBBB, 0x3333);
|
|
214
|
+
assertEquals(a, 48059); // 0xBBBB
|
|
215
|
+
});
|
|
216
|
+
|
|
217
|
+
|
|
218
|
+
// Interleave bits of two int16s.
|
|
219
|
+
Deno.test("interleave", () => {
|
|
220
|
+
let a;
|
|
221
|
+
a = interleave(0x0000, 0xFFFF);
|
|
222
|
+
assertEquals(a, 1431655765); // 0x55555555
|
|
223
|
+
a = interleave(0x1234, 0x1234);
|
|
224
|
+
assertEquals(a, 51121968); // 0x030C0F30
|
|
225
|
+
a = interleave(0x1234, 0x4321);
|
|
226
|
+
assertEquals(a, 302845473); // 0x120D0E21
|
|
227
|
+
});
|
|
228
|
+
|
|
229
|
+
|
|
230
|
+
// Sign extend variable bit-width integer.
|
|
231
|
+
Deno.test("signExtend", () => {
|
|
232
|
+
let a;
|
|
233
|
+
a = signExtend(15, 4);
|
|
234
|
+
assertEquals(a, -1); // 1111 ⇒ -1
|
|
235
|
+
a = signExtend(3, 3);
|
|
236
|
+
assertEquals(a, 3); // 011 ⇒ 3
|
|
237
|
+
a = signExtend(4, 3);
|
|
238
|
+
assertEquals(a, -4); // 100 ⇒ -4
|
|
239
|
+
});
|
package/package.json
ADDED
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
{
|
|
2
|
+
"name": "@nodef/extra-bit",
|
|
3
|
+
"version": "2.4.1",
|
|
4
|
+
"type": "module",
|
|
5
|
+
"license": "MIT",
|
|
6
|
+
"main": "./index.js",
|
|
7
|
+
"types": "./index.d.ts",
|
|
8
|
+
"exports": {
|
|
9
|
+
".": {
|
|
10
|
+
"types": "./index.d.ts",
|
|
11
|
+
"import": "./index.js",
|
|
12
|
+
"default": "./index.js"
|
|
13
|
+
}
|
|
14
|
+
}
|
|
15
|
+
}
|