flat-pair 1.0.0 → 1.0.1

package/dist/index.d.ts

@@ -11,9 +11,9 @@ declare class FlatPair<K, V> {
     removeByValue(value: V): boolean;
     find(key: K): V | undefined;
     findByValue(value: V): K | undefined;
-    at(index: number): [K, V] | undefined;
+    at(pairIndex: number): [K, V] | undefined;
     clear(): void;
-    forEach(callback: (value: V, key: K, index: number, arr: any[]) => void, thisArg?: any): void;
+    forEach(callback: (value: V, key: K, pairIndex: number, array: any[]) => void, thisArg?: any): void;
     keys(): IterableIterator<K>;
     values(): IterableIterator<V>;
     entries(): IterableIterator<[K, V]>;
@@ -29,8 +29,8 @@ declare class FlatPairOperator<K, V> {
     find(items: any[], key: K): V | undefined;
     findByValue(items: any[], value: V): K | undefined;
     removeByValue(items: any[], value: V): boolean;
-    forEach(items: any[], callback: (value: V, key: K, index: number, arr: any[]) => void, thisArg?: any): void;
-    at(items: any[], index: number): [K, V] | undefined;
+    forEach(items: any[], callback: (value: V, key: K, pairIndex: number, array: any[]) => void, thisArg?: any): void;
+    at(items: any[], pairIndex: number): [K, V] | undefined;
     keys(items: any[]): IterableIterator<K>;
     values(items: any[]): IterableIterator<V>;
     entries(items: any[]): IterableIterator<[K, V]>;
@@ -42,9 +42,14 @@ declare function size(items: any[]): number;
 declare function find<K, V>(items: any[], key: K): V | undefined;
 declare function findByValue<K, V>(items: any[], value: V): K | undefined;
 declare function remove<K>(items: any[], key: K): boolean;
-declare function removeByValue<K, V>(items: any[], value: V): boolean;
-declare function forEach<K, V>(items: any[], callback: (value: V, key: K, index: number, arr: any[]) => void, thisArg?: any): void;
-declare function at<K, V>(items: any[], index: number): [K, V] | undefined;
+declare function removeByValue<V>(items: any[], value: V): boolean;
+/**
+ * Behaviors are similar to `Array.prototype.forEach`, caches length and checks index existence.
+ *
+ * - `callback`: real index in the `arr` is `2 * pairIndex`.
+ */
+declare function forEach<K, V>(items: any[], callback: (value: V, key: K, pairIndex: number, array: any[]) => void, thisArg?: any): void;
+declare function at<K, V>(items: any[], pairIndex: number): [K, V] | undefined;
 declare function clear(items: any[]): void;
 
 export { FlatPair, FlatPairOperator, add, at, clear, find, findByValue, forEach, remove, removeByValue, size };

package/dist/index.mjs

@@ -1 +1 @@
-function t(t,r,e){for(let e=0;e<t.length;e+=2)if(t[e]===r)return;t.push(r,e)}function r(t){if(t.length%2!=0)throw new Error("Invalid items length, must be even number");return t.length/2}function e(t,r){for(let e=0;e<t.length;e+=2)if(t[e]===r)return t[e+1]}function n(t,r){for(let e=1;e<t.length;e+=2)if(t[e]===r)return t[e-1]}function i(t,r){for(let e=0;e<t.length;e+=2)if(t[e]===r)return t.splice(e,2),!0;return!1}function u(t,r){for(let e=1;e<t.length;e+=2)if(t[e]===r)return t.splice(e-1,2),!0;return!1}function o(t,r,e){let n=0;for(let i=0;i<t.length;i+=2)r.call(e,t[i+1],t[i],n,t),n++}function s(t,r){if(r<0)return;const e=2*r;return e+1>=t.length?void 0:[t[e],t[e+1]]}function f(t){t.length=0}class l{static from(t){if("[object Map]"!==Object.prototype.toString.call(t))throw new TypeError("[FlatPair: __func__] Argument must be a Map");const r=[];return t.forEach((t,e)=>r.push(e,t)),new l(r)}items=[];constructor(t){if(t.length%2!=0)throw new TypeError("FlatPair items length must be even");this.items=t}get size(){return this.items.length/2}add(r,e){return t(this.items,r,e),this}remove(t){return i(this.items,t)}removeByValue(t){return u(this.items,t)}find(t){return e(this.items,t)}findByValue(t){return n(this.items,t)}at(t){return s(this.items,t)}clear(){this.items.length=0}forEach(t,r){o(this.items,t,r)}*keys(){for(let t=0;t<this.items.length;t+=2)yield this.items[t]}*values(){for(let t=1;t<this.items.length;t+=2)yield this.items[t]}*entries(){for(let t=0;t<this.items.length;t+=2)yield[this.items[t],this.items[t+1]]}[Symbol.iterator](){return this.entries()}}class h{add(r,e,n){t(r,e,n)}remove(t,r){return i(t,r)}find(t,r){return e(t,r)}findByValue(t,r){return n(t,r)}removeByValue(t,r){return u(t,r)}forEach(t,r,e){return o(t,r,e)}at(t,r){return s(t,r)}*keys(t){for(let r=0;r<t.length;r+=2)yield t[r]}*values(t){for(let r=1;r<t.length;r+=2)yield t[r]}*entries(t){for(let r=0;r<t.length;r+=2)yield[t[r],t[r+1]]}clear(t){t.length=0}}export{l as FlatPair,h as FlatPairOperator,t as add,s as at,f as clear,e as find,n as findByValue,o as forEach,i as remove,u as removeByValue,r as size};
+function t(t,e,r){const n=t.length;for(let r=0;r<n;r+=2)if(t[r]===e)return;t.push(e,r)}function e(t){const e=t.length;if(e%2!=0)throw new Error("Invalid items length, must be even number");return e/2}function r(t,e){const r=t.length;for(let n=0;n<r;n+=2)if(t[n]===e)return t[n+1]}function n(t,e){const r=t.length;for(let n=1;n<r;n+=2)if(t[n]===e)return t[n-1]}function i(t,e){const r=t.length;for(let n=0;n<r;n+=2)if(t[n]===e)return t.splice(n,2),!0;return!1}function o(t,e){const r=t.length;for(let n=1;n<r;n+=2)if(t[n]===e)return t.splice(n-1,2),!0;return!1}function s(t,e,r){let n=0;const i=t.length;for(let o=0;o<i;o+=2)o in t&&e.call(r,t[o+1],t[o],n,t),n++}function u(t,e){if(e<0)return;const r=2*e;return r+1>=t.length?void 0:[t[r],t[r+1]]}function f(t){t.length=0}class l{static from(t){if("[object Map]"!==Object.prototype.toString.call(t))throw new TypeError("[FlatPair: __func__] Argument must be a Map");const e=[];return t.forEach((t,r)=>e.push(r,t)),new l(e)}items=[];constructor(t){if(t.length%2!=0)throw new TypeError("FlatPair items length must be even");this.items=t}get size(){return this.items.length/2}add(e,r){return t(this.items,e,r),this}remove(t){return i(this.items,t)}removeByValue(t){return o(this.items,t)}find(t){return r(this.items,t)}findByValue(t){return n(this.items,t)}at(t){return u(this.items,t)}clear(){this.items.length=0}forEach(t,e){s(this.items,t,e)}*keys(){for(let t=0;t<this.items.length;t+=2)yield this.items[t]}*values(){for(let t=1;t<this.items.length;t+=2)yield this.items[t]}*entries(){for(let t=0;t<this.items.length;t+=2)yield[this.items[t],this.items[t+1]]}[Symbol.iterator](){return this.entries()}}class c{add(e,r,n){t(e,r,n)}remove(t,e){return i(t,e)}find(t,e){return r(t,e)}findByValue(t,e){return n(t,e)}removeByValue(t,e){return o(t,e)}forEach(t,e,r){s(t,e,r)}at(t,e){return u(t,e)}*keys(t){for(let e=0;e<t.length;e+=2)yield t[e]}*values(t){for(let e=1;e<t.length;e+=2)yield t[e]}*entries(t){for(let e=0;e<t.length;e+=2)yield[t[e],t[e+1]]}clear(t){t.length=0}}export{l as FlatPair,c as FlatPairOperator,t as add,u as at,f as clear,r as find,n as findByValue,s as forEach,i as remove,o as removeByValue,e as size};

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "flat-pair",
-	"version": "1.0.0",
+	"version": "1.0.1",
 	"author": {
 		"name": "Kasukabe Tsumugi",
 		"email": "futami16237@gmail.com"