@countermeasure-platform/web-components 0.2.0

package/LICENSE

@@ -0,0 +1,92 @@
+CounterMeasure Security Proprietary License
+Version 1.0, 2026
+
+Copyright (c) 2026 CounterMeasure Security (https://countermeasuresec.com/)
+All rights reserved.
+
+TERMS AND CONDITIONS
+
+1. DEFINITIONS
+
+   "Software" means the CounterMeasure source code, object code, documentation,
+   and any associated materials contained in this repository.
+
+   "Licensor" means CounterMeasure Security.
+
+   "You" means the individual or entity exercising rights under this License.
+
+2. GRANT OF LICENSE
+
+   Subject to the terms of this License, the Licensor grants You a limited,
+   non-exclusive, non-transferable, non-sublicensable, revocable license to:
+
+   (a) Use the Software internally within Your organization;
+   (b) Modify the Software solely for Your internal use;
+   (c) Create derivative works solely for Your internal use.
+
+3. RESTRICTIONS
+
+   You may NOT:
+
+   (a) Distribute, sublicense, sell, lease, or otherwise transfer the Software
+       or any derivative works to any third party;
+   (b) Use the Software to provide hosted or managed services to third parties
+       without a separate commercial agreement with the Licensor;
+   (c) Remove, alter, or obscure any copyright, trademark, or other proprietary
+       notices contained in the Software;
+   (d) Reverse engineer, decompile, or disassemble any compiled portions of the
+       Software, except to the extent expressly permitted by applicable law;
+   (e) Use the Software in any manner that competes with the Licensor's products
+       or services.
+
+4. INTELLECTUAL PROPERTY
+
+   The Software and all copies, modifications, and derivative works thereof are
+   and shall remain the sole and exclusive property of CounterMeasure Security.
+   Nothing in this License shall be construed as granting any rights to
+   trademarks, service marks, or trade names of the Licensor.
+
+5. CONTRIBUTIONS
+
+   Any contributions submitted to this repository shall be governed by the
+   Licensor's Contributor License Agreement. By submitting a contribution, You
+   agree to assign all intellectual property rights in that contribution to
+   CounterMeasure Security.
+
+6. NO WARRANTY
+
+   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+   IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+   FITNESS FOR A PARTICULAR PURPOSE, AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+   LICENSOR BE LIABLE FOR ANY CLAIM, DAMAGES, OR OTHER LIABILITY, WHETHER IN AN
+   ACTION OF CONTRACT, TORT, OR OTHERWISE, ARISING FROM, OUT OF, OR IN
+   CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+7. LIMITATION OF LIABILITY
+
+   IN NO EVENT SHALL COUNTERMEASURE SECURITY BE LIABLE FOR ANY INDIRECT,
+   INCIDENTAL, SPECIAL, CONSEQUENTIAL, OR PUNITIVE DAMAGES, OR ANY LOSS OF
+   PROFITS OR REVENUE, WHETHER INCURRED DIRECTLY OR INDIRECTLY, OR ANY LOSS OF
+   DATA, USE, GOODWILL, OR OTHER INTANGIBLE LOSSES, REGARDLESS OF WHETHER THE
+   LICENSOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
+
+8. TERMINATION
+
+   This License is effective until terminated. The Licensor may terminate this
+   License at any time if You breach any of its terms. Upon termination, You
+   must immediately cease all use of the Software and destroy all copies in Your
+   possession or control.
+
+9. GOVERNING LAW
+
+   This License shall be governed by and construed in accordance with the laws
+   of the United States, without regard to its conflict of law provisions.
+
+10. CONTACT
+
+    For licensing inquiries, commercial use agreements, or questions regarding
+    this License, contact:
+
+    CounterMeasure Security
+    https://countermeasuresec.com/
+    legal@countermeasuresec.com

package/README.md

@@ -0,0 +1,185 @@
+<p align="center">
+  <picture>
+    <source media="(prefers-color-scheme: dark)" srcset="data/countermeasure.svg" />
+    <source media="(prefers-color-scheme: light)" srcset="data/countermeasure-2.svg" />
+    <img src="data/countermeasure-2.svg" alt="CounterMeasure" width="400" />
+  </picture>
+</p>
+
+<p align="center">
+  <a href="https://www.typescriptlang.org"><img src="https://img.shields.io/badge/TypeScript-6.0+-blue.svg" alt="TypeScript" /></a>
+  <a href="https://react.dev"><img src="https://img.shields.io/badge/React-19-blue.svg" alt="React" /></a>
+  <a href="LICENSE"><img src="https://img.shields.io/badge/license-proprietary-orange.svg" alt="License" /></a>
+  <a href="https://github.com/countermeasure-platform/web-components/actions/workflows/ci.yml"><img src="https://github.com/countermeasure-platform/web-components/actions/workflows/ci.yml/badge.svg" alt="CI" /></a>
+</p>
+
+<p align="center">
+  Shared web component library for CounterMeasure applications.<br />
+  Dual-implementation: vanilla TypeScript classes <strong>and</strong> React components.<br />
+  Design system primitives, auth flows, layout shells, charts, editors, and security visualizations.
+</p>
+
+---
+
+## Install
+
+```bash
+npm install @countermeasure-platform/web-components --registry=https://npm.pkg.github.com
+```
+
+Configure your `.npmrc` for the `@countermeasure-platform` scope:
+
+```
+@countermeasure-platform:registry=https://npm.pkg.github.com
+//npm.pkg.github.com/:_authToken=${GITHUB_TOKEN}
+```
+
+## Usage
+
+### Vanilla TypeScript
+
+```typescript
+import { Button } from '@countermeasure-platform/web-components/primitives/button'
+import { DataTable } from '@countermeasure-platform/web-components/components/data-table'
+import { MitreMatrix } from '@countermeasure-platform/web-components/security/mitre-matrix'
+```
+
+### React
+
+```tsx
+import { Button } from '@countermeasure-platform/web-components/react'
+import { DataTable } from '@countermeasure-platform/web-components/react'
+import { Calendar } from '@countermeasure-platform/web-components/react'
+```
+
+Every module is individually importable via the package exports map — only the code you use gets bundled.
+
+## Modules
+
+| Module | Description |
+|--------|-------------|
+| **primitives** | Base UI controls — button, input, select, checkbox, radio, switch, slider, toggle, label, spinner, skeleton |
+| **components** | Composite UI — data-table, tree-view, tabs, split-pane, modal, toast, search, command-palette, pagination |
+| **display** | Read-only visuals — alert, avatar, badge, card, code-block, code-viewer, markdown-viewer, progress, tooltip, stat-card |
+| **navigation** | Nav patterns — breadcrumb, menubar, dropdown-menu, navigation-menu, stepper, drawer |
+| **overlays** | Modals and panels — alert-dialog, sheet, carousel |
+| **form** | Form controls — calendar, date-picker, tag-input, color-picker, cron-editor |
+| **charts** | Data visualization — line, bar, area, pie, sparkline, gauge, heatmap, treemap, scatter, radar, waterfall, sankey, funnel, candlestick |
+| **visualization** | Domain visuals — timeline, flow-diagram, network-graph, map, file-tree, terminal, kanban, mermaid-diagram, rule-editor |
+| **security** | Security-specific — cvss-badge, vulnerability-card, attack-path, mitre-matrix, detection-status |
+| **editors** | Code editing — code-editor, log-viewer, json-viewer, yaml-editor, diff-viewer, FluxL/YARAL/YARA language support |
+| **layout** | App shell — layout primitives for page structure |
+| **sidebar** | Sidebar navigation component |
+| **app-switcher** | Multi-app navigation switcher |
+| **auth** | Authentication UI flows |
+| **passkey** | WebAuthn/passkey components |
+| **consent** | Cookie/privacy consent UI |
+| **appearance** | Theme and appearance controls |
+| **icons** | Icon set |
+| **crypto** | Client-side crypto utilities (AES-256-GCM, RSA-OAEP, PBKDF2) |
+| **services** | Shared services — API client (with CSRF support), SSE, keybindings, router, storage |
+| **utils** | Utilities — a11y helpers, keyboard navigation, date, sorting, selection, validation, sanitization, touch gestures |
+| **styles** | CSS tokens, layout styles, and utility classes |
+| **react/primitives** | React primitives — code-viewer (CodeMirror 6 read-only viewer with syntax highlighting for YARA, YARAL, FluxL, SQL, YAML, JSON, Python, JS/TS, Rust, Markdown, Shell) |
+| **react** | React-specific wrappers, theme toggle, brand, topology, threat visuals |
+
+## Development
+
+```bash
+# Install dependencies
+npm ci
+
+# Build the library
+npm run build
+
+# Run all checks (typecheck + lint + format)
+npm run check
+
+# Run unit tests
+npm test
+
+# Run unit tests with coverage
+npm run test:coverage
+
+# Run linter
+npm run lint
+
+# Type check
+npm run typecheck
+
+# Format code
+npm run format
+
+# Check formatting without writing
+npm run format:check
+
+# Run Playwright e2e tests
+npx playwright test
+
+# Preview components in browser
+npm run preview
+```
+
+## Releases
+
+Releases are fully automated via conventional commits. See [docs/RELEASING.md](docs/RELEASING.md) for the complete runbook.
+
+```mermaid
+flowchart LR
+    PR["PR merged to main"] --> CI["CI workflow"]
+    CI -->|success| Release["Release workflow"]
+    Release -->|on completion| Publish["Publish workflow"]
+    Publish --> GPR["GitHub Packages"]
+```
+
+| Commit prefix | Version bump |
+|---------------|-------------|
+| `feat:` | **minor** (0.1.0 &rarr; 0.2.0) |
+| `fix:` / `perf:` | **patch** (0.1.0 &rarr; 0.1.1) |
+| `BREAKING CHANGE` / `feat!:` | **major** (0.1.0 &rarr; 1.0.0) |
+
+## Architecture
+
+This library provides two parallel implementations:
+
+- **Vanilla TypeScript** — Imperative class-based API (`new Button(config)`), direct DOM manipulation, BEM CSS classes (`cmm-*`), manual lifecycle with `destroy()`
+- **React** — Declarative functional components using Radix UI primitives, Tailwind CSS with CVA, hooks-based state
+
+Both share:
+- Design tokens (`src/styles/tokens.css`)
+- Shared utilities (`src/utils/` — date, sorting, selection, a11y, keyboard, sanitization)
+- Services (`src/services/` — API client, SSE, keybindings, router)
+- Chart engine (canvas-based vanilla, React wraps it)
+- Editor engine (CodeMirror 6, shared across both)
+
+## Consumers
+
+This library is consumed by:
+
+- [`packages/threat-library`](https://github.com/countermeasure-platform/core) (core repo)
+- [`crates/countermeasure-web`](https://github.com/countermeasure-platform/core) (core repo)
+- [`apps/ui`](https://github.com/countermeasure-platform/countermeasure) (tenant-ui) — uses `CodeViewer` on the detection detail page for syntax-highlighted rule display
+
+## TypeScript
+
+Strict TypeScript 6.0+ configuration:
+
+- `strict: true`
+- `noUncheckedIndexedAccess: true`
+- `exactOptionalPropertyTypes: true`
+- `moduleResolution: "bundler"`
+- `jsx: "react-jsx"`
+
+## Documentation
+
+| Document | Description |
+|----------|-------------|
+| [Architecture](docs/ARCHITECTURE.md) | Component map, design decisions, directory layout |
+| [Releasing](docs/RELEASING.md) | Release runbook — automated and manual flows |
+| [Changelog](docs/CHANGELOG.md) | Version history |
+| [Contributing](CONTRIBUTING.md) | Contribution workflow, code style, testing |
+| [Security](SECURITY.md) | Vulnerability reporting policy |
+
+## License
+
+CounterMeasure Security Proprietary License. See [LICENSE](LICENSE).

package/dist/_basePickBy-BNGzgD3S.js

@@ -0,0 +1,168 @@
+import { A as e, B as t, C as n, E as r, H as i, M as a, U as o, V as s, k as c, p as l, w as u, z as d } from "./isArrayLikeObject-Bdc4g39x.js";
+import { A as f, C as p, D as m, M as h, N as g, S as _, T as v, f as y, h as b, u as x, w as S } from "./_baseUniq-CSCAMor9.js";
+//#region node_modules/lodash-es/_trimmedEndIndex.js
+var C = /\s/;
+function w(e) {
+	for (var t = e.length; t-- && C.test(e.charAt(t)););
+	return t;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseTrim.js
+var ee = /^\s+/;
+function T(e) {
+	return e && e.slice(0, w(e) + 1).replace(ee, "");
+}
+//#endregion
+//#region node_modules/lodash-es/toNumber.js
+var E = NaN, D = /^[-+]0x[0-9a-f]+$/i, O = /^0b[01]+$/i, k = /^0o[0-7]+$/i, A = parseInt;
+function j(e) {
+	if (typeof e == "number") return e;
+	if (g(e)) return E;
+	if (t(e)) {
+		var n = typeof e.valueOf == "function" ? e.valueOf() : e;
+		e = t(n) ? n + "" : n;
+	}
+	if (typeof e != "string") return e === 0 ? e : +e;
+	e = T(e);
+	var r = O.test(e);
+	return r || k.test(e) ? A(e.slice(2), r ? 2 : 8) : D.test(e) ? E : +e;
+}
+//#endregion
+//#region node_modules/lodash-es/toFinite.js
+var M = Infinity, N = 17976931348623157e292;
+function P(e) {
+	return e ? (e = j(e), e === M || e === -M ? (e < 0 ? -1 : 1) * N : e === e ? e : 0) : e === 0 ? e : 0;
+}
+//#endregion
+//#region node_modules/lodash-es/toInteger.js
+function F(e) {
+	var t = P(e), n = t % 1;
+	return t === t ? n ? t - n : t : 0;
+}
+//#endregion
+//#region node_modules/lodash-es/flatten.js
+function I(e) {
+	return e != null && e.length ? _(e, 1) : [];
+}
+//#endregion
+//#region node_modules/lodash-es/defaults.js
+var L = Object.prototype, R = L.hasOwnProperty, z = r(function(t, r) {
+	t = Object(t);
+	var i = -1, a = r.length, o = a > 2 ? r[2] : void 0;
+	for (o && n(r[0], r[1], o) && (a = 1); ++i < a;) for (var s = r[i], c = l(s), u = -1, d = c.length; ++u < d;) {
+		var f = c[u], p = t[f];
+		(p === void 0 || e(p, L[f]) && !R.call(t, f)) && (t[f] = s[f]);
+	}
+	return t;
+});
+//#endregion
+//#region node_modules/lodash-es/last.js
+function B(e) {
+	var t = e == null ? 0 : e.length;
+	return t ? e[t - 1] : void 0;
+}
+//#endregion
+//#region node_modules/lodash-es/_createFind.js
+function V(e) {
+	return function(t, n, r) {
+		var i = Object(t);
+		if (!u(t)) {
+			var a = y(n, 3);
+			t = m(t), n = function(e) {
+				return a(i[e], e, i);
+			};
+		}
+		var o = e(t, n, r);
+		return o > -1 ? i[a ? t[o] : o] : void 0;
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/findIndex.js
+var H = Math.max;
+function U(e, t, n) {
+	var r = e == null ? 0 : e.length;
+	if (!r) return -1;
+	var i = n == null ? 0 : F(n);
+	return i < 0 && (i = H(r + i, 0)), f(e, y(t, 3), i);
+}
+//#endregion
+//#region node_modules/lodash-es/find.js
+var W = V(U);
+//#endregion
+//#region node_modules/lodash-es/_baseMap.js
+function G(e, t) {
+	var n = -1, r = u(e) ? Array(e.length) : [];
+	return x(e, function(e, i, a) {
+		r[++n] = t(e, i, a);
+	}), r;
+}
+//#endregion
+//#region node_modules/lodash-es/map.js
+function K(e, t) {
+	return (s(e) ? h : G)(e, y(t, 3));
+}
+//#endregion
+//#region node_modules/lodash-es/_baseHas.js
+var q = Object.prototype.hasOwnProperty;
+function J(e, t) {
+	return e != null && q.call(e, t);
+}
+//#endregion
+//#region node_modules/lodash-es/has.js
+function Y(e, t) {
+	return e != null && b(e, t, J);
+}
+//#endregion
+//#region node_modules/lodash-es/isString.js
+var X = "[object String]";
+function Z(e) {
+	return typeof e == "string" || !s(e) && i(e) && o(e) == X;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseLt.js
+function Q(e, t) {
+	return e < t;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseExtremum.js
+function $(e, t, n) {
+	for (var r = -1, i = e.length; ++r < i;) {
+		var a = e[r], o = t(a);
+		if (o != null && (s === void 0 ? o === o && !g(o) : n(o, s))) var s = o, c = a;
+	}
+	return c;
+}
+//#endregion
+//#region node_modules/lodash-es/min.js
+function te(e) {
+	return e && e.length ? $(e, d, Q) : void 0;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseSet.js
+function ne(e, n, r, i) {
+	if (!t(e)) return e;
+	n = v(n, e);
+	for (var o = -1, s = n.length, l = s - 1, u = e; u != null && ++o < s;) {
+		var d = S(n[o]), f = r;
+		if (d === "__proto__" || d === "constructor" || d === "prototype") return e;
+		if (o != l) {
+			var p = u[d];
+			f = i ? i(p, d, u) : void 0, f === void 0 && (f = t(p) ? p : a(n[o + 1]) ? [] : {});
+		}
+		c(u, d, f), u = u[d];
+	}
+	return e;
+}
+//#endregion
+//#region node_modules/lodash-es/_basePickBy.js
+function re(e, t, n) {
+	for (var r = -1, i = t.length, a = {}; ++r < i;) {
+		var o = t[r], s = p(e, o);
+		n(s, o) && ne(a, v(o, e), s);
+	}
+	return a;
+}
+//#endregion
+export { Z as a, G as c, z as d, I as f, Q as i, W as l, P as m, te as n, Y as o, F as p, $ as r, K as s, re as t, B as u };
+
+//# sourceMappingURL=_basePickBy-BNGzgD3S.js.map

package/dist/_basePickBy-BNGzgD3S.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_basePickBy-BNGzgD3S.js","names":["hasOwnProperty"],"sources":["../node_modules/lodash-es/_trimmedEndIndex.js","../node_modules/lodash-es/_baseTrim.js","../node_modules/lodash-es/toNumber.js","../node_modules/lodash-es/toFinite.js","../node_modules/lodash-es/toInteger.js","../node_modules/lodash-es/flatten.js","../node_modules/lodash-es/defaults.js","../node_modules/lodash-es/last.js","../node_modules/lodash-es/_createFind.js","../node_modules/lodash-es/findIndex.js","../node_modules/lodash-es/find.js","../node_modules/lodash-es/_baseMap.js","../node_modules/lodash-es/map.js","../node_modules/lodash-es/_baseHas.js","../node_modules/lodash-es/has.js","../node_modules/lodash-es/isString.js","../node_modules/lodash-es/_baseLt.js","../node_modules/lodash-es/_baseExtremum.js","../node_modules/lodash-es/min.js","../node_modules/lodash-es/_baseSet.js","../node_modules/lodash-es/_basePickBy.js"],"sourcesContent":["/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\n","import baseFlatten from './_baseFlatten.js';\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import baseRest from './_baseRest.js';\nimport eq from './eq.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport keysIn from './keysIn.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(object, sources) {\n  object = Object(object);\n\n  var index = -1;\n  var length = sources.length;\n  var guard = length > 2 ? sources[2] : undefined;\n\n  if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n    length = 1;\n  }\n\n  while (++index < length) {\n    var source = sources[index];\n    var props = keysIn(source);\n    var propsIndex = -1;\n    var propsLength = props.length;\n\n    while (++propsIndex < propsLength) {\n      var key = props[propsIndex];\n      var value = object[key];\n\n      if (value === undefined ||\n          (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        object[key] = source[key];\n      }\n    }\n  }\n\n  return object;\n});\n\nexport default defaults;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","import baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nexport default createFind;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nexport default find;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nexport default baseMap;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHas(object, key) {\n  return object != null && hasOwnProperty.call(object, key);\n}\n\nexport default baseHas;\n","import baseHas from './_baseHas.js';\nimport hasPath from './_hasPath.js';\n\n/**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\nfunction has(object, path) {\n  return object != null && hasPath(object, path, baseHas);\n}\n\nexport default has;\n","import baseGetTag from './_baseGetTag.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nexport default isString;\n","/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nexport default baseLt;\n","import isSymbol from './isSymbol.js';\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nexport default baseExtremum;\n","import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nexport default min;\n","import assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nexport default basePickBy;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"mappings":";;;AACA,IAAI,IAAe;AAUnB,SAAS,EAAgB,GAAQ;AAG/B,MAFA,IAAI,IAAQ,EAAO,QAEZ,OAAW,EAAa,KAAK,EAAO,OAAO,EAAM,CAAC;AACzD,QAAO;;;;ACZT,IAAI,KAAc;AASlB,SAAS,EAAS,GAAQ;AACxB,QAAO,KACH,EAAO,MAAM,GAAG,EAAgB,EAAO,GAAG,EAAE,CAAC,QAAQ,IAAa,GAAG;;;;ACT3E,IAAI,IAAM,KAGN,IAAa,sBAGb,IAAa,cAGb,IAAY,eAGZ,IAAe;AAyBnB,SAAS,EAAS,GAAO;AACvB,KAAI,OAAO,KAAS,SAClB,QAAO;AAET,KAAI,EAAS,EAAM,CACjB,QAAO;AAET,KAAI,EAAS,EAAM,EAAE;EACnB,IAAI,IAAQ,OAAO,EAAM,WAAW,aAAa,EAAM,SAAS,GAAG;AACnE,MAAQ,EAAS,EAAM,GAAI,IAAQ,KAAM;;AAE3C,KAAI,OAAO,KAAS,SAClB,QAAO,MAAU,IAAI,IAAQ,CAAC;AAEhC,KAAQ,EAAS,EAAM;CACvB,IAAI,IAAW,EAAW,KAAK,EAAM;AACrC,QAAQ,KAAY,EAAU,KAAK,EAAM,GACrC,EAAa,EAAM,MAAM,EAAE,EAAE,IAAW,IAAI,EAAE,GAC7C,EAAW,KAAK,EAAM,GAAG,IAAM,CAAC;;;;ACzDvC,IAAI,IAAW,UACX,IAAc;AAyBlB,SAAS,EAAS,GAAO;AASvB,QARK,KAGL,IAAQ,EAAS,EAAM,EACnB,MAAU,KAAY,MAAU,CAAC,KACvB,IAAQ,IAAI,KAAK,KACf,IAET,MAAU,IAAQ,IAAQ,KAPxB,MAAU,IAAI,IAAQ;;;;ACHjC,SAAS,EAAU,GAAO;CACxB,IAAI,IAAS,EAAS,EAAM,EACxB,IAAY,IAAS;AAEzB,QAAO,MAAW,IAAU,IAAY,IAAS,IAAY,IAAU;;;;AChBzE,SAAS,EAAQ,GAAO;AAEtB,QADa,KAAS,QAAW,EAAM,SACvB,EAAY,GAAO,EAAE,GAAG,EAAE;;;;ACZ5C,IAAI,IAAc,OAAO,WAGrBA,IAAiB,EAAY,gBAuB7B,IAAW,EAAS,SAAS,GAAQ,GAAS;AAChD,KAAS,OAAO,EAAO;CAEvB,IAAI,IAAQ,IACR,IAAS,EAAQ,QACjB,IAAQ,IAAS,IAAI,EAAQ,KAAK,KAAA;AAMtC,MAJI,KAAS,EAAe,EAAQ,IAAI,EAAQ,IAAI,EAAM,KACxD,IAAS,IAGJ,EAAE,IAAQ,GAMf,MALA,IAAI,IAAS,EAAQ,IACjB,IAAQ,EAAO,EAAO,EACtB,IAAa,IACb,IAAc,EAAM,QAEjB,EAAE,IAAa,IAAa;EACjC,IAAI,IAAM,EAAM,IACZ,IAAQ,EAAO;AAEnB,GAAI,MAAU,KAAA,KACT,EAAG,GAAO,EAAY,GAAK,IAAI,CAACA,EAAe,KAAK,GAAQ,EAAI,MACnE,EAAO,KAAO,EAAO;;AAK3B,QAAO;EACP;;;AC/CF,SAAS,EAAK,GAAO;CACnB,IAAI,IAAS,KAAS,OAAO,IAAI,EAAM;AACvC,QAAO,IAAS,EAAM,IAAS,KAAK,KAAA;;;;ACLtC,SAAS,EAAW,GAAe;AACjC,QAAO,SAAS,GAAY,GAAW,GAAW;EAChD,IAAI,IAAW,OAAO,EAAW;AACjC,MAAI,CAAC,EAAY,EAAW,EAAE;GAC5B,IAAI,IAAW,EAAa,GAAW,EAAE;AAEzC,GADA,IAAa,EAAK,EAAW,EAC7B,IAAY,SAAS,GAAK;AAAE,WAAO,EAAS,EAAS,IAAM,GAAK,EAAS;;;EAE3E,IAAI,IAAQ,EAAc,GAAY,GAAW,EAAU;AAC3D,SAAO,IAAQ,KAAK,EAAS,IAAW,EAAW,KAAS,KAAS,KAAA;;;;;ACfzE,IAAI,IAAY,KAAK;AAqCrB,SAAS,EAAU,GAAO,GAAW,GAAW;CAC9C,IAAI,IAAS,KAAS,OAAO,IAAI,EAAM;AACvC,KAAI,CAAC,EACH,QAAO;CAET,IAAI,IAAQ,KAAa,OAAO,IAAI,EAAU,EAAU;AAIxD,QAHI,IAAQ,MACV,IAAQ,EAAU,IAAS,GAAO,EAAE,GAE/B,EAAc,GAAO,EAAa,GAAW,EAAE,EAAE,EAAM;;;;ACZhE,IAAI,IAAO,EAAW,EAAU;;;AC5BhC,SAAS,EAAQ,GAAY,GAAU;CACrC,IAAI,IAAQ,IACR,IAAS,EAAY,EAAW,GAAG,MAAM,EAAW,OAAO,GAAG,EAAE;AAKpE,QAHA,EAAS,GAAY,SAAS,GAAO,GAAK,GAAY;AACpD,IAAO,EAAE,KAAS,EAAS,GAAO,GAAK,EAAW;GAClD,EACK;;;;AC6BT,SAAS,EAAI,GAAY,GAAU;AAEjC,SADW,EAAQ,EAAW,GAAG,IAAW,GAChC,GAAY,EAAa,GAAU,EAAE,CAAC;;;;AC7CpD,IAAI,IAHc,OAAO,UAGQ;AAUjC,SAAS,EAAQ,GAAQ,GAAK;AAC5B,QAAO,KAAU,QAAQ,EAAe,KAAK,GAAQ,EAAI;;;;ACe3D,SAAS,EAAI,GAAQ,GAAM;AACzB,QAAO,KAAU,QAAQ,EAAQ,GAAQ,GAAM,EAAQ;;;;AC1BzD,IAAI,IAAY;AAmBhB,SAAS,EAAS,GAAO;AACvB,QAAO,OAAO,KAAS,YACpB,CAAC,EAAQ,EAAM,IAAI,EAAa,EAAM,IAAI,EAAW,EAAM,IAAI;;;;ACjBpE,SAAS,EAAO,GAAO,GAAO;AAC5B,QAAO,IAAQ;;;;ACEjB,SAAS,EAAa,GAAO,GAAU,GAAY;AAIjD,MAHA,IAAI,IAAQ,IACR,IAAS,EAAM,QAEZ,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAQ,EAAM,IACd,IAAU,EAAS,EAAM;AAE7B,MAAI,KAAW,SAAS,MAAa,KAAA,IAC5B,MAAY,KAAW,CAAC,EAAS,EAAQ,GAC1C,EAAW,GAAS,EAAS,GAEnC,IAAI,IAAW,GACX,IAAS;;AAGjB,QAAO;;;;ACNT,SAAS,GAAI,GAAO;AAClB,QAAQ,KAAS,EAAM,SACnB,EAAa,GAAO,GAAU,EAAO,GACrC,KAAA;;;;ACTN,SAAS,GAAQ,GAAQ,GAAM,GAAO,GAAY;AAChD,KAAI,CAAC,EAAS,EAAO,CACnB,QAAO;AAET,KAAO,EAAS,GAAM,EAAO;AAO7B,MALA,IAAI,IAAQ,IACR,IAAS,EAAK,QACd,IAAY,IAAS,GACrB,IAAS,GAEN,KAAU,QAAQ,EAAE,IAAQ,IAAQ;EACzC,IAAI,IAAM,EAAM,EAAK,GAAO,EACxB,IAAW;AAEf,MAAI,MAAQ,eAAe,MAAQ,iBAAiB,MAAQ,YAC1D,QAAO;AAGT,MAAI,KAAS,GAAW;GACtB,IAAI,IAAW,EAAO;AAEtB,GADA,IAAW,IAAa,EAAW,GAAU,GAAK,EAAO,GAAG,KAAA,GACxD,MAAa,KAAA,MACf,IAAW,EAAS,EAAS,GACzB,IACC,EAAQ,EAAK,IAAQ,GAAG,GAAG,EAAE,GAAG,EAAE;;AAI3C,EADA,EAAY,GAAQ,GAAK,EAAS,EAClC,IAAS,EAAO;;AAElB,QAAO;;;;AClCT,SAAS,GAAW,GAAQ,GAAO,GAAW;AAK5C,MAJA,IAAI,IAAQ,IACR,IAAS,EAAM,QACf,IAAS,EAAE,EAER,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAO,EAAM,IACb,IAAQ,EAAQ,GAAQ,EAAK;AAEjC,EAAI,EAAU,GAAO,EAAK,IACxB,GAAQ,GAAQ,EAAS,GAAM,EAAO,EAAE,EAAM;;AAGlD,QAAO"}