185 lines
5.0 KiB
TypeScript
185 lines
5.0 KiB
TypeScript
/*
|
|
* https://github.com/morethanwords/tweb
|
|
* Copyright (C) 2019-2021 Eduard Kuzmenko
|
|
* https://github.com/morethanwords/tweb/blob/master/LICENSE
|
|
*
|
|
* Originally from:
|
|
* https://github.com/zhukov/webogram
|
|
* Copyright (C) 2014 Igor Zhukov <igor.beatle@gmail.com>
|
|
* https://github.com/zhukov/webogram/blob/master/LICENSE
|
|
*/
|
|
|
|
export function bytesToHex(bytes: ArrayLike<number>) {
|
|
const arr: string[] = new Array(bytes.length);
|
|
for(let i = 0; i < bytes.length; ++i) {
|
|
arr[i] = (bytes[i] < 16 ? '0' : '') + (bytes[i] || 0).toString(16);
|
|
}
|
|
return arr.join('');
|
|
}
|
|
|
|
export function bytesFromHex(hexString: string) {
|
|
const len = hexString.length;
|
|
const bytes = new Uint8Array(Math.ceil(len / 2));
|
|
let start = 0;
|
|
|
|
if(len % 2) { // read 0x581 as 0x0581
|
|
bytes[start++] = parseInt(hexString.charAt(0), 16);
|
|
}
|
|
|
|
for(let i = start; i < len; i += 2) {
|
|
bytes[start++] = parseInt(hexString.substr(i, 2), 16);
|
|
}
|
|
|
|
return bytes;
|
|
}
|
|
|
|
export function bytesToBase64(bytes: number[] | Uint8Array) {
|
|
let mod3: number;
|
|
let result = '';
|
|
|
|
for(let nLen = bytes.length, nUint24 = 0, nIdx = 0; nIdx < nLen; ++nIdx) {
|
|
mod3 = nIdx % 3;
|
|
nUint24 |= bytes[nIdx] << (16 >>> mod3 & 24);
|
|
if(mod3 === 2 || nLen - nIdx === 1) {
|
|
result += String.fromCharCode(
|
|
uint6ToBase64(nUint24 >>> 18 & 63),
|
|
uint6ToBase64(nUint24 >>> 12 & 63),
|
|
uint6ToBase64(nUint24 >>> 6 & 63),
|
|
uint6ToBase64(nUint24 & 63)
|
|
);
|
|
nUint24 = 0;
|
|
}
|
|
}
|
|
|
|
return result.replace(/A(?=A$|$)/g, '=');
|
|
}
|
|
|
|
export function uint6ToBase64(nUint6: number) {
|
|
return nUint6 < 26
|
|
? nUint6 + 65
|
|
: nUint6 < 52
|
|
? nUint6 + 71
|
|
: nUint6 < 62
|
|
? nUint6 - 4
|
|
: nUint6 === 62
|
|
? 43
|
|
: nUint6 === 63
|
|
? 47
|
|
: 65;
|
|
}
|
|
|
|
export function bytesCmp(bytes1: number[] | Uint8Array, bytes2: number[] | Uint8Array) {
|
|
const len = bytes1.length;
|
|
if(len !== bytes2.length) {
|
|
return false;
|
|
}
|
|
|
|
for(let i = 0; i < len; ++i) {
|
|
if(bytes1[i] !== bytes2[i]) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
export function bytesXor(bytes1: Uint8Array, bytes2: Uint8Array) {
|
|
const len = bytes1.length;
|
|
const bytes = new Uint8Array(len);
|
|
|
|
for(let i = 0; i < len; ++i) {
|
|
bytes[i] = bytes1[i] ^ bytes2[i];
|
|
}
|
|
|
|
return bytes;
|
|
}
|
|
|
|
/* export function bytesToArrayBuffer(b: number[]) {
|
|
return (new Uint8Array(b)).buffer;
|
|
}
|
|
|
|
export function convertToArrayBuffer(bytes: any | ArrayBuffer | Uint8Array) {
|
|
// Be careful with converting subarrays!!
|
|
if(bytes instanceof ArrayBuffer) {
|
|
return bytes;
|
|
}
|
|
if(bytes.buffer !== undefined &&
|
|
bytes.buffer.byteLength === bytes.length * bytes.BYTES_PER_ELEMENT) {
|
|
return bytes.buffer;
|
|
}
|
|
return bytesToArrayBuffer(bytes);
|
|
} */
|
|
|
|
export function convertToUint8Array(bytes: Uint8Array | ArrayBuffer | number[] | string): Uint8Array {
|
|
if(bytes instanceof Uint8Array) {
|
|
return bytes;
|
|
} else if(typeof(bytes) === 'string') {
|
|
return new TextEncoder().encode(bytes);
|
|
}
|
|
|
|
return new Uint8Array(bytes);
|
|
}
|
|
|
|
/* export function bytesFromArrayBuffer(buffer: ArrayBuffer) {
|
|
const len = buffer.byteLength;
|
|
const byteView = new Uint8Array(buffer);
|
|
const bytes: number[] = [];
|
|
|
|
for(let i = 0; i < len; ++i) {
|
|
bytes[i] = byteView[i];
|
|
}
|
|
|
|
return bytes;
|
|
}
|
|
|
|
export function bufferConcat(buffer1: any, buffer2: any) {
|
|
const l1 = buffer1.byteLength || buffer1.length;
|
|
const l2 = buffer2.byteLength || buffer2.length;
|
|
const tmp = new Uint8Array(l1 + l2);
|
|
tmp.set(buffer1 instanceof ArrayBuffer ? new Uint8Array(buffer1) : buffer1, 0);
|
|
tmp.set(buffer2 instanceof ArrayBuffer ? new Uint8Array(buffer2) : buffer2, l1);
|
|
|
|
return tmp.buffer;
|
|
} */
|
|
|
|
export function bufferConcats(...args: (ArrayBuffer | Uint8Array | number[])[]) {
|
|
const length = args.reduce((acc, v) => acc + ((v as ArrayBuffer).byteLength || (v as Uint8Array).length), 0);
|
|
|
|
const tmp = new Uint8Array(length);
|
|
|
|
let lastLength = 0;
|
|
args.forEach(b => {
|
|
tmp.set(b instanceof ArrayBuffer ? new Uint8Array(b) : b, lastLength);
|
|
lastLength += (b as ArrayBuffer).byteLength || (b as Uint8Array).length;
|
|
});
|
|
|
|
return tmp/* .buffer */;
|
|
}
|
|
|
|
export function bytesFromWordss(input: Uint32Array) {
|
|
const o = new Uint8Array(input.byteLength);
|
|
for(let i = 0, length = input.length * 4; i < length; ++i) {
|
|
o[i] = ((input[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff);
|
|
}
|
|
|
|
return o;
|
|
}
|
|
|
|
export function bytesToWordss(input: Parameters<typeof convertToUint8Array>[0]) {
|
|
const bytes = convertToUint8Array(input);
|
|
|
|
const words: number[] = [];
|
|
for(let i = 0, len = bytes.length; i < len; ++i) {
|
|
words[i >>> 2] |= bytes[i] << (24 - (i % 4) * 8);
|
|
}
|
|
|
|
return new Uint32Array(words);
|
|
}
|
|
|
|
// * https://stackoverflow.com/a/52827031
|
|
/* export const isBigEndian = (() => {
|
|
const array = new Uint8Array(4);
|
|
const view = new Uint32Array(array.buffer);
|
|
return !((view[0] = 1) & array[0]);
|
|
})(); */
|