Socket
Socket
Sign inDemoInstall

pvutils

Package Overview
Dependencies
Maintainers
2
Versions
20
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

pvutils - npm Package Compare versions

Comparing version 1.0.14 to 1.0.15

281

build/utils.js

@@ -60,9 +60,5 @@ "use strict";

*/
function bufferToHexCodes(inputBuffer) {
var inputOffset = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
var inputLength = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : inputBuffer.byteLength - inputOffset;
var insertSpace = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
function bufferToHexCodes(inputBuffer, inputOffset = 0, inputLength = inputBuffer.byteLength - inputOffset, insertSpace = false) {
let result = "";
var result = "";
var _iteratorNormalCompletion = true;

@@ -74,6 +70,6 @@ var _didIteratorError = false;

for (var _iterator = new Uint8Array(inputBuffer, inputOffset, inputLength)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
var item = _step.value;
const item = _step.value;
// noinspection ChainedFunctionCallJS
var str = item.toString(16).toUpperCase();
const str = item.toString(16).toUpperCase();

@@ -162,3 +158,3 @@ // noinspection ConstantOnRightSideOfComparisonJS, NonBlockStatementBodyJS

function utilFromBase(inputBuffer, inputBase) {
var result = 0;
let result = 0;

@@ -169,5 +165,5 @@ // noinspection ConstantOnRightSideOfComparisonJS, NonBlockStatementBodyJS

// noinspection ConstantOnRightSideOfComparisonJS, NonBlockStatementBodyJS
for (var i = inputBuffer.length - 1; i >= 0; i--) {
result += inputBuffer[inputBuffer.length - 1 - i] * Math.pow(2, inputBase * i);
}return result;
for (let i = inputBuffer.length - 1; i >= 0; i--) result += inputBuffer[inputBuffer.length - 1 - i] * Math.pow(2, inputBase * i);
return result;
}

@@ -183,15 +179,13 @@ //**************************************************************************************

*/
function utilToBase(value, base) {
var reserved = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : -1;
function utilToBase(value, base, reserved = -1) {
const internalReserved = reserved;
let internalValue = value;
var internalReserved = reserved;
var internalValue = value;
let result = 0;
let biggest = Math.pow(2, base);
var result = 0;
var biggest = Math.pow(2, base);
// noinspection ConstantOnRightSideOfComparisonJS
for (var i = 1; i < 8; i++) {
for (let i = 1; i < 8; i++) {
if (value < biggest) {
var retBuf = void 0;
let retBuf;

@@ -211,7 +205,7 @@ // noinspection ConstantOnRightSideOfComparisonJS

var retView = new Uint8Array(retBuf);
const retView = new Uint8Array(retBuf);
// noinspection ConstantOnRightSideOfComparisonJS
for (var j = i - 1; j >= 0; j--) {
var basis = Math.pow(2, j * base);
for (let j = i - 1; j >= 0; j--) {
const basis = Math.pow(2, j * base);

@@ -236,6 +230,6 @@ retView[result - j - 1] = Math.floor(internalValue / basis);

*/
function utilConcatBuf() {
function utilConcatBuf(...buffers) {
//region Initial variables
var outputLength = 0;
var prevLength = 0;
let outputLength = 0;
let prevLength = 0;
//endregion

@@ -246,7 +240,2 @@

// noinspection NonBlockStatementBodyJS
for (var _len = arguments.length, buffers = Array(_len), _key = 0; _key < _len; _key++) {
buffers[_key] = arguments[_key];
}
var _iteratorNormalCompletion2 = true;

@@ -258,3 +247,3 @@ var _didIteratorError2 = false;

for (var _iterator2 = buffers[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {
var buffer = _step2.value;
const buffer = _step2.value;

@@ -278,4 +267,4 @@ outputLength += buffer.byteLength;

var retBuf = new ArrayBuffer(outputLength);
var retView = new Uint8Array(retBuf);
const retBuf = new ArrayBuffer(outputLength);
const retView = new Uint8Array(retBuf);

@@ -288,7 +277,7 @@ var _iteratorNormalCompletion3 = true;

for (var _iterator3 = buffers[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {
var _buffer = _step3.value;
const buffer = _step3.value;
// noinspection NestedFunctionCallJS
retView.set(new Uint8Array(_buffer), prevLength);
prevLength += _buffer.byteLength;
retView.set(new Uint8Array(buffer), prevLength);
prevLength += buffer.byteLength;
}

@@ -318,6 +307,6 @@ } catch (err) {

*/
function utilConcatView() {
function utilConcatView(...views) {
//region Initial variables
var outputLength = 0;
var prevLength = 0;
let outputLength = 0;
let prevLength = 0;
//endregion

@@ -327,7 +316,2 @@

// noinspection NonBlockStatementBodyJS
for (var _len2 = arguments.length, views = Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
views[_key2] = arguments[_key2];
}
var _iteratorNormalCompletion4 = true;

@@ -339,3 +323,3 @@ var _didIteratorError4 = false;

for (var _iterator4 = views[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {
var view = _step4.value;
const view = _step4.value;

@@ -359,4 +343,4 @@ outputLength += view.length;

var retBuf = new ArrayBuffer(outputLength);
var retView = new Uint8Array(retBuf);
const retBuf = new ArrayBuffer(outputLength);
const retView = new Uint8Array(retBuf);

@@ -369,6 +353,6 @@ var _iteratorNormalCompletion5 = true;

for (var _iterator5 = views[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {
var _view = _step5.value;
const view = _step5.value;
retView.set(_view, prevLength);
prevLength += _view.length;
retView.set(view, prevLength);
prevLength += view.length;
}

@@ -400,3 +384,3 @@ } catch (err) {

function utilDecodeTC() {
var buf = new Uint8Array(this.valueHex);
const buf = new Uint8Array(this.valueHex);

@@ -406,5 +390,5 @@ // noinspection ConstantOnRightSideOfComparisonJS

//noinspection JSBitwiseOperatorUsage, ConstantOnRightSideOfComparisonJS, LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var condition1 = buf[0] === 0xFF && buf[1] & 0x80;
const condition1 = buf[0] === 0xFF && buf[1] & 0x80;
// noinspection ConstantOnRightSideOfComparisonJS, LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var condition2 = buf[0] === 0x00 && (buf[1] & 0x80) === 0x00;
const condition2 = buf[0] === 0x00 && (buf[1] & 0x80) === 0x00;

@@ -416,23 +400,23 @@ // noinspection NonBlockStatementBodyJS

//region Create big part of the integer
var bigIntBuffer = new ArrayBuffer(this.valueHex.byteLength);
var bigIntView = new Uint8Array(bigIntBuffer);
const bigIntBuffer = new ArrayBuffer(this.valueHex.byteLength);
const bigIntView = new Uint8Array(bigIntBuffer);
// noinspection NonBlockStatementBodyJS
for (var i = 0; i < this.valueHex.byteLength; i++) {
bigIntView[i] = 0;
} // noinspection MagicNumberJS, NonShortCircuitBooleanExpressionJS
for (let i = 0; i < this.valueHex.byteLength; i++) bigIntView[i] = 0;
// noinspection MagicNumberJS, NonShortCircuitBooleanExpressionJS
bigIntView[0] = buf[0] & 0x80; // mask only the biggest bit
var bigInt = utilFromBase(bigIntView, 8);
const bigInt = utilFromBase(bigIntView, 8);
//endregion
//region Create small part of the integer
var smallIntBuffer = new ArrayBuffer(this.valueHex.byteLength);
var smallIntView = new Uint8Array(smallIntBuffer);
const smallIntBuffer = new ArrayBuffer(this.valueHex.byteLength);
const smallIntView = new Uint8Array(smallIntBuffer);
// noinspection NonBlockStatementBodyJS
for (var j = 0; j < this.valueHex.byteLength; j++) {
smallIntView[j] = buf[j];
} // noinspection MagicNumberJS
for (let j = 0; j < this.valueHex.byteLength; j++) smallIntView[j] = buf[j];
// noinspection MagicNumberJS
smallIntView[0] &= 0x7F; // mask biggest bit
var smallInt = utilFromBase(smallIntView, 8);
const smallInt = utilFromBase(smallIntView, 8);
//endregion

@@ -451,23 +435,23 @@

// noinspection ConstantOnRightSideOfComparisonJS, ConditionalExpressionJS
var modValue = value < 0 ? value * -1 : value;
var bigInt = 128;
const modValue = value < 0 ? value * -1 : value;
let bigInt = 128;
// noinspection ConstantOnRightSideOfComparisonJS
for (var i = 1; i < 8; i++) {
for (let i = 1; i < 8; i++) {
if (modValue <= bigInt) {
// noinspection ConstantOnRightSideOfComparisonJS
if (value < 0) {
var smallInt = bigInt - modValue;
const smallInt = bigInt - modValue;
var _retBuf = utilToBase(smallInt, 8, i);
var _retView = new Uint8Array(_retBuf);
const retBuf = utilToBase(smallInt, 8, i);
const retView = new Uint8Array(retBuf);
// noinspection MagicNumberJS
_retView[0] |= 0x80;
retView[0] |= 0x80;
return _retBuf;
return retBuf;
}
var retBuf = utilToBase(modValue, 8, i);
var retView = new Uint8Array(retBuf);
let retBuf = utilToBase(modValue, 8, i);
let retView = new Uint8Array(retBuf);

@@ -477,4 +461,4 @@ //noinspection JSBitwiseOperatorUsage, MagicNumberJS, NonShortCircuitBooleanExpressionJS

//noinspection JSCheckFunctionSignatures
var tempBuf = retBuf.slice(0);
var tempView = new Uint8Array(tempBuf);
const tempBuf = retBuf.slice(0);
const tempView = new Uint8Array(tempBuf);

@@ -486,5 +470,5 @@ retBuf = new ArrayBuffer(retBuf.byteLength + 1);

// noinspection NonBlockStatementBodyJS
for (var k = 0; k < tempBuf.byteLength; k++) {
retView[k + 1] = tempView[k];
} // noinspection MagicNumberJS
for (let k = 0; k < tempBuf.byteLength; k++) retView[k + 1] = tempView[k];
// noinspection MagicNumberJS
retView[0] = 0x00;

@@ -514,7 +498,7 @@ }

// noinspection LocalVariableNamingConventionJS
var view1 = new Uint8Array(inputBuffer1);
const view1 = new Uint8Array(inputBuffer1);
// noinspection LocalVariableNamingConventionJS
var view2 = new Uint8Array(inputBuffer2);
const view2 = new Uint8Array(inputBuffer2);
for (var i = 0; i < view1.length; i++) {
for (let i = 0; i < view1.length; i++) {
// noinspection NonBlockStatementBodyJS

@@ -535,3 +519,3 @@ if (view1[i] !== view2[i]) return false;

function padNumber(inputNumber, fullLength) {
var str = inputNumber.toString(10);
const str = inputNumber.toString(10);

@@ -541,15 +525,15 @@ // noinspection NonBlockStatementBodyJS

var dif = fullLength - str.length;
const dif = fullLength - str.length;
var padding = new Array(dif);
const padding = new Array(dif);
// noinspection NonBlockStatementBodyJS
for (var i = 0; i < dif; i++) {
padding[i] = "0";
}var paddingString = padding.join("");
for (let i = 0; i < dif; i++) padding[i] = "0";
const paddingString = padding.join("");
return paddingString.concat(str);
}
//**************************************************************************************
var base64Template = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
var base64UrlTemplate = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=";
const base64Template = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
const base64UrlTemplate = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=";
//**************************************************************************************

@@ -565,26 +549,22 @@ // noinspection FunctionWithMultipleLoopsJS, OverlyComplexFunctionJS, FunctionTooLongJS, FunctionNamingConventionJS

*/
function toBase64(input) {
var useUrlTemplate = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
var skipPadding = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
var skipLeadingZeros = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
function toBase64(input, useUrlTemplate = false, skipPadding = false, skipLeadingZeros = false) {
let i = 0;
var i = 0;
// noinspection LocalVariableNamingConventionJS
var flag1 = 0;
let flag1 = 0;
// noinspection LocalVariableNamingConventionJS
var flag2 = 0;
let flag2 = 0;
var output = "";
let output = "";
// noinspection ConditionalExpressionJS
var template = useUrlTemplate ? base64UrlTemplate : base64Template;
const template = useUrlTemplate ? base64UrlTemplate : base64Template;
if (skipLeadingZeros) {
var nonZeroPosition = 0;
let nonZeroPosition = 0;
for (var _i = 0; _i < input.length; _i++) {
for (let i = 0; i < input.length; i++) {
// noinspection ConstantOnRightSideOfComparisonJS
if (input.charCodeAt(_i) !== 0) {
nonZeroPosition = _i;
if (input.charCodeAt(i) !== 0) {
nonZeroPosition = i;
// noinspection BreakStatementJS

@@ -601,20 +581,20 @@ break;

// noinspection LocalVariableNamingConventionJS, IncrementDecrementResultUsedJS
var chr1 = input.charCodeAt(i++);
const chr1 = input.charCodeAt(i++);
// noinspection NonBlockStatementBodyJS
if (i >= input.length) flag1 = 1;
// noinspection LocalVariableNamingConventionJS, IncrementDecrementResultUsedJS
var chr2 = input.charCodeAt(i++);
const chr2 = input.charCodeAt(i++);
// noinspection NonBlockStatementBodyJS
if (i >= input.length) flag2 = 1;
// noinspection LocalVariableNamingConventionJS, IncrementDecrementResultUsedJS
var chr3 = input.charCodeAt(i++);
const chr3 = input.charCodeAt(i++);
// noinspection LocalVariableNamingConventionJS
var enc1 = chr1 >> 2;
const enc1 = chr1 >> 2;
// noinspection LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var enc2 = (chr1 & 0x03) << 4 | chr2 >> 4;
const enc2 = (chr1 & 0x03) << 4 | chr2 >> 4;
// noinspection LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var enc3 = (chr2 & 0x0F) << 2 | chr3 >> 6;
let enc3 = (chr2 & 0x0F) << 2 | chr3 >> 6;
// noinspection LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var enc4 = chr3 & 0x3F;
let enc4 = chr3 & 0x3F;

@@ -636,7 +616,7 @@ // noinspection ConstantOnRightSideOfComparisonJS

// noinspection ConstantOnRightSideOfComparisonJS, NonBlockStatementBodyJS, MagicNumberJS
if (enc3 === 64) output += "" + template.charAt(enc1) + template.charAt(enc2);else {
if (enc3 === 64) output += `${template.charAt(enc1)}${template.charAt(enc2)}`;else {
// noinspection ConstantOnRightSideOfComparisonJS, NonBlockStatementBodyJS, MagicNumberJS
if (enc4 === 64) output += "" + template.charAt(enc1) + template.charAt(enc2) + template.charAt(enc3);else output += "" + template.charAt(enc1) + template.charAt(enc2) + template.charAt(enc3) + template.charAt(enc4);
if (enc4 === 64) output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}`;else output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}${template.charAt(enc4)}`;
}
} else output += "" + template.charAt(enc1) + template.charAt(enc2) + template.charAt(enc3) + template.charAt(enc4);
} else output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}${template.charAt(enc4)}`;
}

@@ -655,8 +635,5 @@

*/
function fromBase64(input) {
var useUrlTemplate = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
var cutTailZeros = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
function fromBase64(input, useUrlTemplate = false, cutTailZeros = false) {
// noinspection ConditionalExpressionJS
var template = useUrlTemplate ? base64UrlTemplate : base64Template;
const template = useUrlTemplate ? base64UrlTemplate : base64Template;

@@ -667,5 +644,5 @@ //region Aux functions

// noinspection ConstantOnRightSideOfComparisonJS, MagicNumberJS
for (var _i2 = 0; _i2 < 64; _i2++) {
for (let i = 0; i < 64; i++) {
// noinspection NonBlockStatementBodyJS
if (template.charAt(_i2) === toSearch) return _i2;
if (template.charAt(i) === toSearch) return i;
}

@@ -684,22 +661,22 @@

var i = 0;
let i = 0;
var output = "";
let output = "";
while (i < input.length) {
// noinspection NestedFunctionCallJS, LocalVariableNamingConventionJS, IncrementDecrementResultUsedJS
var enc1 = indexof(input.charAt(i++));
const enc1 = indexof(input.charAt(i++));
// noinspection NestedFunctionCallJS, LocalVariableNamingConventionJS, ConditionalExpressionJS, MagicNumberJS, IncrementDecrementResultUsedJS
var enc2 = i >= input.length ? 0x00 : indexof(input.charAt(i++));
const enc2 = i >= input.length ? 0x00 : indexof(input.charAt(i++));
// noinspection NestedFunctionCallJS, LocalVariableNamingConventionJS, ConditionalExpressionJS, MagicNumberJS, IncrementDecrementResultUsedJS
var enc3 = i >= input.length ? 0x00 : indexof(input.charAt(i++));
const enc3 = i >= input.length ? 0x00 : indexof(input.charAt(i++));
// noinspection NestedFunctionCallJS, LocalVariableNamingConventionJS, ConditionalExpressionJS, MagicNumberJS, IncrementDecrementResultUsedJS
var enc4 = i >= input.length ? 0x00 : indexof(input.charAt(i++));
const enc4 = i >= input.length ? 0x00 : indexof(input.charAt(i++));
// noinspection LocalVariableNamingConventionJS, NonShortCircuitBooleanExpressionJS
var chr1 = test(enc1) << 2 | test(enc2) >> 4;
const chr1 = test(enc1) << 2 | test(enc2) >> 4;
// noinspection LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var chr2 = (test(enc2) & 0x0F) << 4 | test(enc3) >> 2;
const chr2 = (test(enc2) & 0x0F) << 4 | test(enc3) >> 2;
// noinspection LocalVariableNamingConventionJS, MagicNumberJS, NonShortCircuitBooleanExpressionJS
var chr3 = (test(enc3) & 0x03) << 6 | test(enc4);
const chr3 = (test(enc3) & 0x03) << 6 | test(enc4);

@@ -716,10 +693,10 @@ output += String.fromCharCode(chr1);

if (cutTailZeros) {
var outputLength = output.length;
var nonZeroStart = -1;
const outputLength = output.length;
let nonZeroStart = -1;
// noinspection ConstantOnRightSideOfComparisonJS
for (var _i3 = outputLength - 1; _i3 >= 0; _i3--) {
for (let i = outputLength - 1; i >= 0; i--) {
// noinspection ConstantOnRightSideOfComparisonJS
if (output.charCodeAt(_i3) !== 0) {
nonZeroStart = _i3;
if (output.charCodeAt(i) !== 0) {
nonZeroStart = i;
// noinspection BreakStatementJS

@@ -738,4 +715,4 @@ break;

function arrayBufferToString(buffer) {
var resultString = "";
var view = new Uint8Array(buffer);
let resultString = "";
const view = new Uint8Array(buffer);

@@ -749,3 +726,3 @@ // noinspection NonBlockStatementBodyJS

for (var _iterator6 = view[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {
var element = _step6.value;
const element = _step6.value;

@@ -773,14 +750,14 @@ resultString += String.fromCharCode(element);

function stringToArrayBuffer(str) {
var stringLength = str.length;
const stringLength = str.length;
var resultBuffer = new ArrayBuffer(stringLength);
var resultView = new Uint8Array(resultBuffer);
const resultBuffer = new ArrayBuffer(stringLength);
const resultView = new Uint8Array(resultBuffer);
// noinspection NonBlockStatementBodyJS
for (var i = 0; i < stringLength; i++) {
resultView[i] = str.charCodeAt(i);
}return resultBuffer;
for (let i = 0; i < stringLength; i++) resultView[i] = str.charCodeAt(i);
return resultBuffer;
}
//**************************************************************************************
var log2 = Math.log(2);
const log2 = Math.log(2);
//**************************************************************************************

@@ -794,6 +771,6 @@ // noinspection FunctionNamingConventionJS

function nearestPowerOf2(length) {
var base = Math.log(length) / log2;
const base = Math.log(length) / log2;
var floor = Math.floor(base);
var round = Math.round(base);
const floor = Math.floor(base);
const round = Math.round(base);

@@ -816,3 +793,3 @@ // noinspection ConditionalExpressionJS

for (var _iterator7 = propsArray[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {
var prop = _step7.value;
const prop = _step7.value;

@@ -819,0 +796,0 @@ delete object[prop];

@@ -17,2 +17,5 @@ {

"description": "Common utilities for products from Peculiar Ventures",
"engines": {
"node": ">=6.0.0"
},
"scripts": {

@@ -38,4 +41,4 @@ "prepublishOnly": "npm run build",

"name": "pvutils",
"version": "1.0.14",
"version": "1.0.15",
"license": "MIT"
}

Sorry, the diff of this file is not supported yet

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc