New Case Study:See how Anthropic automated 95% of dependency reviews with Socket.Learn More
Socket
Sign inDemoInstall
Socket

mongoose-sort-encrypted-field

Package Overview
Dependencies
Maintainers
1
Versions
52
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

mongoose-sort-encrypted-field - npm Package Compare versions

Comparing version 0.2.12 to 0.2.13

18

lib/utils.js

@@ -25,3 +25,3 @@ "use strict";

return {
predecessorSortId: new Base2N("\0", noOfCharsForSortId).toString(),
predecessorSortId: new Base2N("\0", 16, noOfCharsForSortId).toString(),
successorSortId: "".padEnd(noOfCharsForSortId, "\uffff"),

@@ -122,4 +122,4 @@ };

if (predecessorSortId.length === successorSortId.length) {
predecessorNumber = new Base2N(predecessorSortId);
successorNumber = new Base2N(successorSortId);
predecessorNumber = new Base2N(predecessorSortId, 16);
successorNumber = new Base2N(successorSortId, 16);
const averageNumber = predecessorNumber.average(successorNumber);

@@ -129,4 +129,4 @@ if (averageNumber.toString() != predecessorNumber.toString()) {

}
predecessorNumber = new Base2N(predecessorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"));
successorNumber = new Base2N(successorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"));
predecessorNumber = new Base2N(predecessorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"), 16);
successorNumber = new Base2N(successorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"), 16);
return predecessorNumber.average(successorNumber).toString();

@@ -136,4 +136,4 @@ }

const smaller = successorSortId.length > predecessorSortId.length ? predecessorSortId : successorSortId;
const biggerNumber = new Base2N(bigger);
const smallerNumber = new Base2N(smaller.padEnd(bigger.length, "\0"));
const biggerNumber = new Base2N(bigger, 16);
const smallerNumber = new Base2N(smaller.padEnd(bigger.length, "\0"), 16);
return biggerNumber.average(smallerNumber).toString();

@@ -182,7 +182,7 @@ }

const log2n = Math.round(Math.log2(n)) + 1;
let diff = new Base2N("".padEnd(noOfCharsForSortId, "\uffff"));
let diff = new Base2N("".padEnd(noOfCharsForSortId, "\uffff"), 16);
for (let i = 0; i < log2n; i += 1) {
diff = diff.half();
}
let curr = new Base2N("\0", noOfCharsForSortId);
let curr = new Base2N("\0", 16, noOfCharsForSortId);
curr = curr.add(diff);

@@ -189,0 +189,0 @@ for (let i = 0; i < n; i += 1) {

{
"name": "mongoose-sort-encrypted-field",
"version": "0.2.12",
"version": "0.2.13",
"description": "Mongoose plugin to enable sorting on encrypted fields",

@@ -5,0 +5,0 @@ "main": "lib/index.js",

@@ -13,3 +13,3 @@ const Base2N = require("@navpreetdevpuri/base-2-n");

return {
predecessorSortId: new Base2N("\0", noOfCharsForSortId).toString(),
predecessorSortId: new Base2N("\0", 16, noOfCharsForSortId).toString(),
successorSortId: "".padEnd(noOfCharsForSortId, "\uffff"),

@@ -119,4 +119,4 @@ };

if (predecessorSortId.length === successorSortId.length) {
predecessorNumber = new Base2N(predecessorSortId);
successorNumber = new Base2N(successorSortId);
predecessorNumber = new Base2N(predecessorSortId, 16);
successorNumber = new Base2N(successorSortId, 16);
const averageNumber = predecessorNumber.average(successorNumber);

@@ -126,4 +126,4 @@ if (averageNumber.toString() != predecessorNumber.toString()) {

}
predecessorNumber = new Base2N(predecessorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"));
successorNumber = new Base2N(successorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"));
predecessorNumber = new Base2N(predecessorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"), 16);
successorNumber = new Base2N(successorSortId.padEnd(averageNumber.length + noOfCharsToIncreaseOnSaturation, "\0"), 16);
return predecessorNumber.average(successorNumber).toString();

@@ -135,4 +135,4 @@ }

const biggerNumber = new Base2N(bigger);
const smallerNumber = new Base2N(smaller.padEnd(bigger.length, "\0"));
const biggerNumber = new Base2N(bigger, 16);
const smallerNumber = new Base2N(smaller.padEnd(bigger.length, "\0"), 16);

@@ -182,7 +182,7 @@ return biggerNumber.average(smallerNumber).toString();

const log2n = Math.round(Math.log2(n)) + 1;
let diff = new Base2N("".padEnd(noOfCharsForSortId, "\uffff"));
let diff = new Base2N("".padEnd(noOfCharsForSortId, "\uffff"), 16);
for (let i = 0; i < log2n; i += 1) {
diff = diff.half();
}
let curr = new Base2N("\0", noOfCharsForSortId);
let curr = new Base2N("\0", 16, noOfCharsForSortId);
curr = curr.add(diff);

@@ -189,0 +189,0 @@ for (let i = 0; i < n; i += 1) {

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