oblivious-set - npm Package Compare versions

Comparing version 1.0.0 to 1.1.0

dist/es/index.d.ts

@@ -8,4 +8,3 @@ /**
     readonly ttl: number;
-    readonly set: Set<unknown>;
-    readonly timeMap: Map<any, any>;
+    readonly map: Map<any, any>;
     constructor(ttl: number);
@@ -12,0 +11,0 @@ has(value: T): boolean;

dist/es/index.js

@@ -9,12 +9,10 @@ /**
         this.ttl = ttl;
-        this.set = new Set();
-        this.timeMap = new Map();
+        this.map = new Map();
     }
     ObliviousSet.prototype.has = function (value) {
-        return this.set.has(value);
+        return this.map.has(value);
     };
     ObliviousSet.prototype.add = function (value) {
         var _this = this;
-        this.timeMap.set(value, now());
-        this.set.add(value);
+        this.map.set(value, now());
         /**
@@ -31,4 +29,3 @@ * When a new value is added,
     ObliviousSet.prototype.clear = function () {
-        this.set.clear();
-        this.timeMap.clear();
+        this.map.clear();
     };
@@ -44,3 +41,3 @@ return ObliviousSet;
     var olderThen = now() - obliviousSet.ttl;
-    var iterator = obliviousSet.set[Symbol.iterator]();
+    var iterator = obliviousSet.map[Symbol.iterator]();
     /**
@@ -51,10 +48,10 @@ * Because we can assume the new values are added at the bottom,
     while (true) {
-        var value = iterator.next().value;
-        if (!value) {
+        var next = iterator.next().value;
+        if (!next) {
             return; // no more elements
         }
-        var time = obliviousSet.timeMap.get(value);
+        var value = next[0];
+        var time = next[1];
         if (time < olderThen) {
-            obliviousSet.timeMap.delete(value);
-            obliviousSet.set.delete(value);
+            obliviousSet.map.delete(value);
         }
@@ -61,0 +58,0 @@ else {

dist/lib/index.d.ts

@@ -8,4 +8,3 @@ /**
     readonly ttl: number;
-    readonly set: Set<unknown>;
-    readonly timeMap: Map<any, any>;
+    readonly map: Map<any, any>;
     constructor(ttl: number);
@@ -12,0 +11,0 @@ has(value: T): boolean;

dist/lib/index.js

@@ -12,12 +12,10 @@ "use strict";
         this.ttl = ttl;
-        this.set = new Set();
-        this.timeMap = new Map();
+        this.map = new Map();
     }
     ObliviousSet.prototype.has = function (value) {
-        return this.set.has(value);
+        return this.map.has(value);
     };
     ObliviousSet.prototype.add = function (value) {
         var _this = this;
-        this.timeMap.set(value, now());
-        this.set.add(value);
+        this.map.set(value, now());
         /**
@@ -34,4 +32,3 @@ * When a new value is added,
     ObliviousSet.prototype.clear = function () {
-        this.set.clear();
-        this.timeMap.clear();
+        this.map.clear();
     };
@@ -47,3 +44,3 @@ return ObliviousSet;
     var olderThen = now() - obliviousSet.ttl;
-    var iterator = obliviousSet.set[Symbol.iterator]();
+    var iterator = obliviousSet.map[Symbol.iterator]();
     /**
@@ -54,10 +51,10 @@ * Because we can assume the new values are added at the bottom,
     while (true) {
-        var value = iterator.next().value;
-        if (!value) {
+        var next = iterator.next().value;
+        if (!next) {
             return; // no more elements
         }
-        var time = obliviousSet.timeMap.get(value);
+        var value = next[0];
+        var time = next[1];
         if (time < olderThen) {
-            obliviousSet.timeMap.delete(value);
-            obliviousSet.set.delete(value);
+            obliviousSet.map.delete(value);
         }
@@ -64,0 +61,0 @@ else {

package.json

 {
   "name": "oblivious-set",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "description": "Like a JavaScript Set() but with a TTL for entries",
@@ -5,0 +5,0 @@ "license": "MIT",

src/index.ts

@@ -8,4 +8,3 @@
 export class ObliviousSet<T = any> {
-    public readonly set = new Set();
-    public readonly timeMap = new Map();
+    public readonly map = new Map();
     constructor(
@@ -16,8 +15,7 @@ public readonly ttl: number
     has(value: T): boolean {
-        return this.set.has(value);
+        return this.map.has(value);
     }
 
     add(value: T): void {
-        this.timeMap.set(value, now());
-        this.set.add(value);
+        this.map.set(value, now());
 
@@ -36,4 +34,3 @@ /**
     clear() {
-        this.set.clear();
-        this.timeMap.clear();
+        this.map.clear();
     }
@@ -51,3 +48,3 @@ }
     const olderThen = now() - obliviousSet.ttl;
-    const iterator = obliviousSet.set[Symbol.iterator]();
+    const iterator = obliviousSet.map[Symbol.iterator]();
 
@@ -59,10 +56,12 @@ /**
     while (true) {
-        const value = iterator.next().value;
-        if (!value) {
+
+        const next = iterator.next().value;
+
+        if (!next) {
             return; // no more elements
         }
-        const time = obliviousSet.timeMap.get(value);
+        const value = next[0];
+        const time = next[1];
         if (time < olderThen) {
-            obliviousSet.timeMap.delete(value);
-            obliviousSet.set.delete(value);
+            obliviousSet.map.delete(value);
         } else {
@@ -69,0 +68,0 @@ // We reached a value that is not old enough

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Worsened metrics

Total package byte prevSize

17463

decreased by-4.42%

Lines of code

423

decreased by-2.53%

No dependency changes