Spaces:
Sleeping
Sleeping
File size: 5,808 Bytes
78c921d |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 |
"use strict";
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
Object.defineProperty(exports, "__esModule", { value: true });
exports.popcnt_uint32 = exports.popcnt_array = exports.popcnt_bit_range = exports.BitIterator = exports.packBools = exports.truncateBitmap = exports.setBool = exports.getBit = exports.getBool = void 0;
/** @ignore */
function getBool(_data, _index, byte, bit) {
return (byte & 1 << bit) !== 0;
}
exports.getBool = getBool;
/** @ignore */
function getBit(_data, _index, byte, bit) {
return (byte & 1 << bit) >> bit;
}
exports.getBit = getBit;
/** @ignore */
function setBool(bytes, index, value) {
return value ?
!!(bytes[index >> 3] |= (1 << (index % 8))) || true :
!(bytes[index >> 3] &= ~(1 << (index % 8))) && false;
}
exports.setBool = setBool;
/** @ignore */
function truncateBitmap(offset, length, bitmap) {
const alignedSize = (bitmap.byteLength + 7) & ~7;
if (offset > 0 || bitmap.byteLength < alignedSize) {
const bytes = new Uint8Array(alignedSize);
// If the offset is a multiple of 8 bits, it's safe to slice the bitmap
bytes.set(offset % 8 === 0 ? bitmap.subarray(offset >> 3) :
// Otherwise iterate each bit from the offset and return a new one
packBools(new BitIterator(bitmap, offset, length, null, getBool)).subarray(0, alignedSize));
return bytes;
}
return bitmap;
}
exports.truncateBitmap = truncateBitmap;
/** @ignore */
function packBools(values) {
const xs = [];
let i = 0, bit = 0, byte = 0;
for (const value of values) {
value && (byte |= 1 << bit);
if (++bit === 8) {
xs[i++] = byte;
byte = bit = 0;
}
}
if (i === 0 || bit > 0) {
xs[i++] = byte;
}
const b = new Uint8Array((xs.length + 7) & ~7);
b.set(xs);
return b;
}
exports.packBools = packBools;
/** @ignore */
class BitIterator {
constructor(bytes, begin, length, context, get) {
this.bytes = bytes;
this.length = length;
this.context = context;
this.get = get;
this.bit = begin % 8;
this.byteIndex = begin >> 3;
this.byte = bytes[this.byteIndex++];
this.index = 0;
}
next() {
if (this.index < this.length) {
if (this.bit === 8) {
this.bit = 0;
this.byte = this.bytes[this.byteIndex++];
}
return {
value: this.get(this.context, this.index++, this.byte, this.bit++)
};
}
return { done: true, value: null };
}
[Symbol.iterator]() {
return this;
}
}
exports.BitIterator = BitIterator;
/**
* Compute the population count (the number of bits set to 1) for a range of bits in a Uint8Array.
* @param vector The Uint8Array of bits for which to compute the population count.
* @param lhs The range's left-hand side (or start) bit
* @param rhs The range's right-hand side (or end) bit
*/
/** @ignore */
function popcnt_bit_range(data, lhs, rhs) {
if (rhs - lhs <= 0) {
return 0;
}
// If the bit range is less than one byte, sum the 1 bits in the bit range
if (rhs - lhs < 8) {
let sum = 0;
for (const bit of new BitIterator(data, lhs, rhs - lhs, data, getBit)) {
sum += bit;
}
return sum;
}
// Get the next lowest multiple of 8 from the right hand side
const rhsInside = rhs >> 3 << 3;
// Get the next highest multiple of 8 from the left hand side
const lhsInside = lhs + (lhs % 8 === 0 ? 0 : 8 - lhs % 8);
return (
// Get the popcnt of bits between the left hand side, and the next highest multiple of 8
popcnt_bit_range(data, lhs, lhsInside) +
// Get the popcnt of bits between the right hand side, and the next lowest multiple of 8
popcnt_bit_range(data, rhsInside, rhs) +
// Get the popcnt of all bits between the left and right hand sides' multiples of 8
popcnt_array(data, lhsInside >> 3, (rhsInside - lhsInside) >> 3));
}
exports.popcnt_bit_range = popcnt_bit_range;
/** @ignore */
function popcnt_array(arr, byteOffset, byteLength) {
let cnt = 0, pos = Math.trunc(byteOffset);
const view = new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
const len = byteLength === void 0 ? arr.byteLength : pos + byteLength;
while (len - pos >= 4) {
cnt += popcnt_uint32(view.getUint32(pos));
pos += 4;
}
while (len - pos >= 2) {
cnt += popcnt_uint32(view.getUint16(pos));
pos += 2;
}
while (len - pos >= 1) {
cnt += popcnt_uint32(view.getUint8(pos));
pos += 1;
}
return cnt;
}
exports.popcnt_array = popcnt_array;
/** @ignore */
function popcnt_uint32(uint32) {
let i = Math.trunc(uint32);
i = i - ((i >>> 1) & 0x55555555);
i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
return (((i + (i >>> 4)) & 0x0F0F0F0F) * 0x01010101) >>> 24;
}
exports.popcnt_uint32 = popcnt_uint32;
//# sourceMappingURL=bit.js.map
|