@milaboratories/miplots4 1.2.0 → 1.2.1

package/dist/utils/intersect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersect.d.ts","sourceRoot":"","sources":["../../src/utils/intersect.ts"],"names":[],"mappings":"AAEA,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAWhD"}

package/dist/utils/intersect.js

@@ -0,0 +1,8 @@
+function e(e, t) {
+	let n = new Set(t), r = /* @__PURE__ */ new Set(), i = [];
+	for (let t of e) n.has(t) && !r.has(t) && (r.add(t), i.push(t));
+	return i;
+}
+export { e as intersect };
+
+//# sourceMappingURL=intersect.js.map

package/dist/utils/intersect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersect.js","names":[],"sources":["../../src/utils/intersect.ts"],"sourcesContent":["// Elements of `a` that are also in `b`, in `a`'s order, deduplicated.\n// Replacement for lodash.intersection in the two-array case.\nexport function intersect<T>(a: T[], b: T[]): T[] {\n    const inB = new Set(b);\n    const seen = new Set<T>();\n    const result: T[] = [];\n    for (const x of a) {\n        if (inB.has(x) && !seen.has(x)) {\n            seen.add(x);\n            result.push(x);\n        }\n    }\n    return result;\n}\n"],"mappings":"AAEA,SAAgB,EAAa,GAAQ,GAAa;CAC9C,IAAM,IAAM,IAAI,IAAI,EAAE,EAChB,oBAAO,IAAI,KAAQ,EACnB,IAAc,EAAE;AACtB,MAAK,IAAM,KAAK,EACZ,CAAI,EAAI,IAAI,EAAE,IAAI,CAAC,EAAK,IAAI,EAAE,KAC1B,EAAK,IAAI,EAAE,EACX,EAAO,KAAK,EAAE;AAGtB,QAAO"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@milaboratories/miplots4",
-  "version": "1.2.0",
+  "version": "1.2.1",
   "description": "Data visualization library",
   "author": "erohinaelena",
   "license": "ISC",