flat-pair 1.3.0 → 1.3.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (2) hide show
  1. package/dist/index.mjs +1 -1
  2. package/package.json +2 -20
package/dist/index.mjs CHANGED
@@ -1 +1 @@
1
- const e=function(e,r){return e===r||e!=e&&r!=r};function r(e){const r=e.length;if(r%2!=0)throw new TypeError("[FlatPair: size] items length must be even number");return r/2}function t(r,t,n){const i=r.length;if(i%2!=0)throw new TypeError("[FlatPair: add] items length must be even number");for(let n=0;n<i;n+=2)if(e(r[n],t))return;r.push(t,n)}function n(r,t,n){const i=r.length;if(i%2!=0)throw new TypeError("[FlatPair: set] items length must be even number");for(let u=0;u<i;u+=2)if(e(r[u],t))return void(r[u+1]=n);r.push(t,n)}function i(r,t){const n=r.length;if(n%2!=0)throw new TypeError("[FlatPair: has] items length must be even number");for(let i=0;i<n;i+=2)if(e(r[i],t))return!0;return!1}function u(r,t){const n=r.length;if(n%2!=0)throw new TypeError("[FlatPair: hasByValue] items length must be even number");for(let i=1;i<n;i+=2)if(e(r[i],t))return!0;return!1}function o(r,t){const n=r.length;if(n%2!=0)throw new TypeError("[FlatPair: get] items length must be even number");for(let i=0;i<n;i+=2)if(e(r[i],t))return r[i+1]}function s(r,t){const n=r.length;if(n%2!=0)throw new TypeError("[FlatPair: getByValue] items length must be even number");for(let i=1;i<n;i+=2)if(e(r[i],t))return r[i-1]}function f(r,t){const n=r.length;if(n%2!=0)throw new TypeError("[FlatPair: remove] items length must be even number");for(let i=0;i<n;i+=2)if(e(r[i],t))return r.splice(i,2),!0;return!1}function l(r,t){const n=r.length;if(n%2!=0)throw new TypeError("[FlatPair: removeByValue] items length must be even number");for(let i=1;i<n;i+=2)if(e(r[i],t))return r.splice(i-1,2),!0;return!1}function a(e,r,t){const n=e.length;if(n%2!=0)throw new TypeError("[FlatPair: forEach] items length must be even number");for(let i=0;i<n;i+=2)i in e&&r.call(t,e[i+1],e[i],i,e)}function h(e){e.length=0}function m(e,r){const t=e.length;if(t%2!=0)throw new TypeError("[FlatPair: find] items length must be even number");for(let n=0;n<t;n+=2){if(r(e[n+1],e[n],n,e))return[e[n],e[n+1]]}}function c(e,r){const t=e.length;if(t%2!=0)throw new TypeError("[FlatPair: findIndex] items length must be even number");for(let n=0;n<t;n+=2){if(r(e[n+1],e[n],n,e))return n}return-1}class y{static from(e){if("[object Map]"!==Object.prototype.toString.call(e))throw new TypeError("[FlatPair: from] Argument must be a Map");const r=[];return e.forEach((e,t)=>r.push(t,e)),new y(r)}t=[];constructor(e){if(e.length%2!=0)throw new TypeError("[FlatPair: constructor] items length must be even number");this.t=e.slice()}get size(){return this.t.length/2}get array(){return this.t}add(e,r){return t(this.t,e,r),this}set(e,r){return n(this.t,e,r),this}hasByValue(e){return u(this.t,e)}remove(e){return f(this.t,e)}removeByValue(e){return l(this.t,e)}get(e){return o(this.t,e)}getByValue(e){return s(this.t,e)}find(e){return m(this.t,e)}findIndex(e){return c(this.t,e)}clear(){this.t.length=0}has(e){return i(this.t,e)}forEach(e,r){a(this.t,e,r)}*keys(){for(let e=0;e<this.t.length;e+=2)yield this.t[e]}*values(){for(let e=1;e<this.t.length;e+=2)yield this.t[e]}*entries(){for(let e=0;e<this.t.length;e+=2)yield[this.t[e],this.t[e+1]]}[Symbol.iterator](){return this.entries()}}class b{add(e,r,n){t(e,r,n)}set(e,r,t){n(e,r,t)}remove(e,r){return f(e,r)}get(e,r){return o(e,r)}getByValue(e,r){return s(e,r)}find(e,r){return m(e,r)}findIndex(e,r){return c(e,r)}removeByValue(e,r){return l(e,r)}forEach(e,r,t){a(e,r,t)}*keys(e){for(let r=0;r<e.length;r+=2)yield e[r]}*values(e){for(let r=1;r<e.length;r+=2)yield e[r]}*entries(e){for(let r=0;r<e.length;r+=2)yield[e[r],e[r+1]]}clear(e){e.length=0}has(e,r){return i(e,r)}hasByValue(e,r){return u(e,r)}}export{y as FlatPair,b as FlatPairOperator,t as add,h as clear,m as find,c as findIndex,a as forEach,o as get,s as getByValue,i as has,u as hasByValue,f as remove,l as removeByValue,n as set,r as size};
1
+ const t=t=>{if(t%2!=0)throw new Error(`[FlatPair] Invalid length: ${t}. Length must be even.`)},r=function(t,r){return t===r||t!=t&&r!=r};function e(r){const e=r.length;return t(e),e/2}function n(e,n,i){const u=e.length;t(u);for(let t=0;t<u;t+=2)if(r(e[t],n))return;e.push(n,i)}function i(e,n,i){const u=e.length;t(u);for(let t=0;t<u;t+=2)if(r(e[t],n))return void(e[t+1]=i);e.push(n,i)}function u(e,n){const i=e.length;t(i);for(let t=0;t<i;t+=2)if(r(e[t],n))return!0;return!1}function o(e,n){const i=e.length;t(i);for(let t=1;t<i;t+=2)if(r(e[t],n))return!0;return!1}function s(e,n){const i=e.length;t(i);for(let t=0;t<i;t+=2)if(r(e[t],n))return e[t+1]}function f(e,n){const i=e.length;t(i);for(let t=1;t<i;t+=2)if(r(e[t],n))return e[t-1]}function c(e,n){const i=e.length;t(i);for(let t=0;t<i;t+=2)if(r(e[t],n))return e.splice(t,2),!0;return!1}function l(e,n){const i=e.length;t(i);for(let t=1;t<i;t+=2)if(r(e[t],n))return e.splice(t-1,2),!0;return!1}function h(r,e,n){const i=r.length;t(i);for(let t=0;t<i;t+=2)t in r&&e.call(n,r[t+1],r[t],t,r)}function a(t){t.length=0}function d(r,e){const n=r.length;t(n);for(let t=0;t<n;t+=2){if(e(r[t+1],r[t],t,r))return[r[t],r[t+1]]}}function y(r,e){const n=r.length;t(n);for(let t=0;t<n;t+=2){if(e(r[t+1],r[t],t,r))return t}return-1}class m{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 m(r)}t=[];constructor(r){const e=r.length;t(e),this.t=r.slice()}get size(){return this.t.length/2}get array(){return this.t}add(t,r){return n(this.t,t,r),this}set(t,r){return i(this.t,t,r),this}hasByValue(t){return o(this.t,t)}remove(t){return c(this.t,t)}removeByValue(t){return l(this.t,t)}get(t){return s(this.t,t)}getByValue(t){return f(this.t,t)}find(t){return d(this.t,t)}findIndex(t){return y(this.t,t)}clear(){this.t.length=0}has(t){return u(this.t,t)}forEach(t,r){h(this.t,t,r)}*keys(){for(let t=0;t<this.t.length;t+=2)yield this.t[t]}*values(){for(let t=1;t<this.t.length;t+=2)yield this.t[t]}*entries(){for(let t=0;t<this.t.length;t+=2)yield[this.t[t],this.t[t+1]]}[Symbol.iterator](){return this.entries()}}class g{add(t,r,e){n(t,r,e)}set(t,r,e){i(t,r,e)}remove(t,r){return c(t,r)}get(t,r){return s(t,r)}getByValue(t,r){return f(t,r)}find(t,r){return d(t,r)}findIndex(t,r){return y(t,r)}removeByValue(t,r){return l(t,r)}forEach(t,r,e){h(t,r,e)}*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}has(t,r){return u(t,r)}hasByValue(t,r){return o(t,r)}}export{m as FlatPair,g as FlatPairOperator,n as add,a as clear,d as find,y as findIndex,h as forEach,s as get,f as getByValue,u as has,o as hasByValue,c as remove,l as removeByValue,i as set,e as size};
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "flat-pair",
3
- "version": "1.3.0",
3
+ "version": "1.3.1",
4
4
  "author": {
5
5
  "name": "Kasukabe Tsumugi",
6
6
  "email": "futami16237@gmail.com"
@@ -35,23 +35,5 @@
35
35
  "build": "node ./.scripts/rollup.mjs"
36
36
  },
37
37
  "license": "MIT",
38
- "devDependencies": {
39
- "@rollup/plugin-alias": "^5.1.1",
40
- "@rollup/plugin-commonjs": "^28.0.6",
41
- "@rollup/plugin-node-resolve": "^16.0.1",
42
- "@rollup/plugin-replace": "^6.0.2",
43
- "@rollup/plugin-terser": "^0.4.4",
44
- "@rollup/plugin-typescript": "^12.1.4",
45
- "@types/node": "^24.6.2",
46
- "@vitest/coverage-v8": "^3.2.4",
47
- "oxlint": "^1.19.0",
48
- "prettier": "^3.6.2",
49
- "rimraf": "^6.0.1",
50
- "rollup": "^4.52.4",
51
- "rollup-plugin-dts": "^6.2.3",
52
- "rollup-plugin-func-macro": "^1.1.0",
53
- "tslib": "^2.8.1",
54
- "typescript": "^5.9.3",
55
- "vitest": "^3.2.4"
56
- }
38
+ "devDependencies": {}
57
39
  }