@marimo-team/islands 0.23.17-dev8 → 0.24.0

package/dist/{glide-data-editor-B9K6-MJe.js → glide-data-editor-BI2i_IEE.js}

@@ -1,22 +1,22 @@
 var __defProp = Object.defineProperty;
 var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
 var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
-import { s as __toESM, t as __commonJSMin } from "./chunk-BNovOVIE.js";
-import { g as Logger, m as Events, t as Button } from "./button-BSm8IXRU.js";
-import { t as require_react } from "./react-DA-nE2FX.js";
-import { t as require_compiler_runtime } from "./compiler-runtime-CEbnTgxf.js";
-import { n as Copy, r as toast, t as copyToClipboard } from "./copy-DNq8q3zw.js";
-import { C as logNever, i as SelectContent, l as SelectTrigger, n as capitalize, o as SelectItem, r as Select, u as SelectValue } from "./strings-DIy9NAmg.js";
-import { J as marked, S as DropdownMenuSubTrigger, _ as DropdownMenuPortal, b as DropdownMenuSub, f as DropdownMenu, h as DropdownMenuItem, p as DropdownMenuContent, q as useNonce, r as Input, v as DropdownMenuSeparator, x as DropdownMenuSubContent } from "./input-C5K4VBvB.js";
-import { n as Trash, r as Pencil, t as BulkEdit } from "./types-DicH9Oi0.js";
-import { n as require_prop_types, r as Plus, t as ErrorBoundary } from "./ErrorBoundary-DhLqwSWA.js";
-import { t as require_react_dom } from "./react-dom-BTJzcVJ9.js";
-import { t as require_jsx_runtime } from "./jsx-runtime-DebpN0FN.js";
-import "./zod-BUcyXSdR.js";
-import { t as Label } from "./label-DjoYwqmj.js";
-import { A as useEvent_default, n as useTheme } from "./useTheme-DYfby65G.js";
-import { A as require_isLength, B as require_isFunction, C as resolveCellsThunk, D as maybe, E as deepEqual, F as require__Map, G as require__baseGetTag, H as require__isKey, I as require__ListCache, J as require__freeGlobal, K as require__Symbol, L as require_eq, M as require_isArguments, N as require__castPath, O as require__hasPath, P as require__MapCache, R as require__getNative, S as isSizedGridColumn, T as assertNever, U as require_isSymbol, V as require_isObject, W as require_isObjectLike, Y as require_isArray, _ as booleanCellIsEditable, a as mergeAndRealizeTheme, b as isObjectEditorCallbackResult, c as withAlpha, d as CompactSelection, f as DEFAULT_FILL_HANDLE, g as InnerGridCellKind, h as GridColumnMenuIcon, i as makeCSSStyle, j as require__isIndex, k as require__toKey, l as BooleanEmpty, m as GridColumnIcon, n as ThemeContext, o as blend, p as GridCellKind, q as require__root, r as getDataEditorTheme, s as blendCache, t as ClickOutsideContainer, u as BooleanIndeterminate, v as isEditableGridCell, w as assert, x as isReadWriteCell, y as isInnerOnlyCell, z as require__toSource } from "./click-outside-container-BSIeYt4y.js";
-import { t as styled_default } from "./dist-SXNmlE8A.js";
+import { o as __toESM, t as __commonJSMin } from "./chunk-Bfp04NdC.js";
+import { g as Logger, m as Events, t as Button } from "./button-Dr2uAwhT.js";
+import { t as require_react } from "./react-DhGsCS90.js";
+import { t as require_compiler_runtime } from "./compiler-runtime-DsR6imPN.js";
+import { n as Copy, r as toast, t as copyToClipboard } from "./copy-C7ZKMKox.js";
+import { C as logNever, i as SelectContent, l as SelectTrigger, n as capitalize, o as SelectItem, r as Select, u as SelectValue } from "./strings-DMLVGXRo.js";
+import { J as marked, S as DropdownMenuSubTrigger, _ as DropdownMenuPortal, b as DropdownMenuSub, f as DropdownMenu, h as DropdownMenuItem, p as DropdownMenuContent, q as useNonce, r as Input, v as DropdownMenuSeparator, x as DropdownMenuSubContent } from "./input-BRE2a7Ay.js";
+import { n as Trash, r as Pencil, t as BulkEdit } from "./types-DT8UHI5w.js";
+import { n as require_prop_types, r as Plus, t as ErrorBoundary } from "./ErrorBoundary-BniTEhHn.js";
+import { t as require_react_dom } from "./react-dom-CmENFV8Q.js";
+import { t as require_jsx_runtime } from "./jsx-runtime-Dp_oQwaf.js";
+import "./zod-BFY2SnzC.js";
+import { t as Label } from "./label-CMh2d8pJ.js";
+import { A as useEvent_default, n as useTheme } from "./useTheme-BzEXeAR5.js";
+import { A as require_isLength, B as require_isFunction, C as resolveCellsThunk, D as maybe, E as deepEqual, F as require__Map, G as require__baseGetTag, H as require__isKey, I as require__ListCache, J as require__freeGlobal, K as require__Symbol, L as require_eq, M as require_isArguments, N as require__castPath, O as require__hasPath, P as require__MapCache, R as require__getNative, S as isSizedGridColumn, T as assertNever, U as require_isSymbol, V as require_isObject, W as require_isObjectLike, Y as require_isArray, _ as booleanCellIsEditable, a as mergeAndRealizeTheme, b as isObjectEditorCallbackResult, c as withAlpha, d as CompactSelection, f as DEFAULT_FILL_HANDLE, g as InnerGridCellKind, h as GridColumnMenuIcon, i as makeCSSStyle, j as require__isIndex, k as require__toKey, l as BooleanEmpty, m as GridColumnIcon, n as ThemeContext, o as blend, p as GridCellKind, q as require__root, r as getDataEditorTheme, s as blendCache, t as ClickOutsideContainer, u as BooleanIndeterminate, v as isEditableGridCell, w as assert, x as isReadWriteCell, y as isInnerOnlyCell, z as require__toSource } from "./click-outside-container-BZNsAj09.js";
+import { t as styled_default } from "./dist-kOCFEa1U.js";
 let GlideDataEditor, glide_data_editor_default;
 let __tla = (async () => {
   const ImageOverlayEditorStyle = styled_default("div")({
@@ -7409,7 +7409,7 @@ let __tla = (async () => {
       scrollRef: f
     };
   }
-  var import_clamp = __toESM(require_clamp(), 1), import_uniq = __toESM(require_uniq(), 1), import_flatten = __toESM(require_flatten(), 1), import_range = __toESM(require_range(), 1), import_debounce = __toESM(require_debounce(), 1), DataGridOverlayEditor = import_react.lazy(async () => await import("./data-grid-overlay-editor-BWRG2b_o.js")), idCounter = 0;
+  var import_clamp = __toESM(require_clamp(), 1), import_uniq = __toESM(require_uniq(), 1), import_flatten = __toESM(require_flatten(), 1), import_range = __toESM(require_range(), 1), import_debounce = __toESM(require_debounce(), 1), DataGridOverlayEditor = import_react.lazy(async () => await import("./data-grid-overlay-editor-Ci7TXVf5.js")), idCounter = 0;
   function getSpanStops(e) {
     return (0, import_uniq.default)((0, import_flatten.default)((0, import_flatten.default)(e).filter((e2) => e2.span !== void 0).map((e2) => {
       var _a, _b;
@@ -10023,7 +10023,7 @@ let __tla = (async () => {
       height: l - 1
     };
   }
-  var NumberOverlayEditor = import_react.lazy(async () => await import("./number-overlay-editor-Ck_mc_gT.js"));
+  var NumberOverlayEditor = import_react.lazy(async () => await import("./number-overlay-editor-CeBHRJvI.js"));
   const numberCellRenderer = {
     getAccessibilityString: (e) => {
       var _a;

package/dist/graphlib-DMVIRZap.js

@@ -0,0 +1,614 @@
+import { A as isObjectLike_default, C as constant_default, D as identity_default, E as isFunction_default, M as _Symbol_default, O as isObject_default, _ as _baseRest_default, a as _MapCache_default, c as _arrayLikeKeys_default, f as isBuffer_default, h as isArrayLike_default, i as _Stack_default, k as isArray_default, l as isTypedArray_default, n as _baseFor_default, r as _Uint8Array_default, t as isArrayLikeObject_default, y as eq_default } from "./isArrayLikeObject-CBUaLibE.js";
+import { a as get_default, d as _arrayMap_default, i as _arrayPush_default, o as _baseGet_default, r as _baseFlatten_default, s as _toKey_default, t as hasIn_default, u as _isKey_default } from "./hasIn-synBnXn4.js";
+import { i as _baseKeys_default, n as _getTag_default, r as _Set_default, t as isEmpty_default } from "./isEmpty-CgME6WRV.js";
+function noop() {
+}
+var noop_default = noop;
+function arrayEach(a, P) {
+  for (var F = -1, I = a == null ? 0 : a.length; ++F < I && P(a[F], F, a) !== false; ) ;
+  return a;
+}
+var _arrayEach_default = arrayEach;
+function baseFindIndex(a, P, F, I) {
+  for (var L = a.length, R = F + (I ? 1 : -1); I ? R-- : ++R < L; ) if (P(a[R], R, a)) return R;
+  return -1;
+}
+var _baseFindIndex_default = baseFindIndex;
+function baseIsNaN(a) {
+  return a !== a;
+}
+var _baseIsNaN_default = baseIsNaN;
+function strictIndexOf(a, P, F) {
+  for (var I = F - 1, L = a.length; ++I < L; ) if (a[I] === P) return I;
+  return -1;
+}
+var _strictIndexOf_default = strictIndexOf;
+function baseIndexOf(a, P, F) {
+  return P === P ? _strictIndexOf_default(a, P, F) : _baseFindIndex_default(a, _baseIsNaN_default, F);
+}
+var _baseIndexOf_default = baseIndexOf;
+function arrayIncludes(a, P) {
+  return !!(a != null && a.length) && _baseIndexOf_default(a, P, 0) > -1;
+}
+var _arrayIncludes_default = arrayIncludes;
+function keys(a) {
+  return isArrayLike_default(a) ? _arrayLikeKeys_default(a) : _baseKeys_default(a);
+}
+var keys_default = keys;
+function arrayReduce(a, P, F, I) {
+  var L = -1, R = a == null ? 0 : a.length;
+  for (I && R && (F = a[++L]); ++L < R; ) F = P(F, a[L], L, a);
+  return F;
+}
+var _arrayReduce_default = arrayReduce;
+function arrayFilter(a, P) {
+  for (var F = -1, I = a == null ? 0 : a.length, L = 0, R = []; ++F < I; ) {
+    var z = a[F];
+    P(z, F, a) && (R[L++] = z);
+  }
+  return R;
+}
+var _arrayFilter_default = arrayFilter;
+function stubArray() {
+  return [];
+}
+var stubArray_default = stubArray, propertyIsEnumerable = Object.prototype.propertyIsEnumerable, nativeGetSymbols = Object.getOwnPropertySymbols, _getSymbols_default = nativeGetSymbols ? function(a) {
+  return a == null ? [] : (a = Object(a), _arrayFilter_default(nativeGetSymbols(a), function(P) {
+    return propertyIsEnumerable.call(a, P);
+  }));
+} : stubArray_default;
+function baseGetAllKeys(a, P, F) {
+  var I = P(a);
+  return isArray_default(a) ? I : _arrayPush_default(I, F(a));
+}
+var _baseGetAllKeys_default = baseGetAllKeys;
+function getAllKeys(a) {
+  return _baseGetAllKeys_default(a, keys_default, _getSymbols_default);
+}
+var _getAllKeys_default = getAllKeys, HASH_UNDEFINED = "__lodash_hash_undefined__";
+function setCacheAdd(a) {
+  return this.__data__.set(a, HASH_UNDEFINED), this;
+}
+var _setCacheAdd_default = setCacheAdd;
+function setCacheHas(a) {
+  return this.__data__.has(a);
+}
+var _setCacheHas_default = setCacheHas;
+function SetCache(a) {
+  var P = -1, F = a == null ? 0 : a.length;
+  for (this.__data__ = new _MapCache_default(); ++P < F; ) this.add(a[P]);
+}
+SetCache.prototype.add = SetCache.prototype.push = _setCacheAdd_default, SetCache.prototype.has = _setCacheHas_default;
+var _SetCache_default = SetCache;
+function arraySome(a, P) {
+  for (var F = -1, I = a == null ? 0 : a.length; ++F < I; ) if (P(a[F], F, a)) return true;
+  return false;
+}
+var _arraySome_default = arraySome;
+function cacheHas(a, P) {
+  return a.has(P);
+}
+var _cacheHas_default = cacheHas, COMPARE_PARTIAL_FLAG$5 = 1, COMPARE_UNORDERED_FLAG$3 = 2;
+function equalArrays(a, P, F, I, L, R) {
+  var z = F & COMPARE_PARTIAL_FLAG$5, B = a.length, V = P.length;
+  if (B != V && !(z && V > B)) return false;
+  var H = R.get(a), U = R.get(P);
+  if (H && U) return H == P && U == a;
+  var W = -1, G = true, K = F & COMPARE_UNORDERED_FLAG$3 ? new _SetCache_default() : void 0;
+  for (R.set(a, P), R.set(P, a); ++W < B; ) {
+    var q = a[W], J = P[W];
+    if (I) var Y = z ? I(J, q, W, P, a, R) : I(q, J, W, a, P, R);
+    if (Y !== void 0) {
+      if (Y) continue;
+      G = false;
+      break;
+    }
+    if (K) {
+      if (!_arraySome_default(P, function(a2, P2) {
+        if (!_cacheHas_default(K, P2) && (q === a2 || L(q, a2, F, I, R))) return K.push(P2);
+      })) {
+        G = false;
+        break;
+      }
+    } else if (!(q === J || L(q, J, F, I, R))) {
+      G = false;
+      break;
+    }
+  }
+  return R.delete(a), R.delete(P), G;
+}
+var _equalArrays_default = equalArrays;
+function mapToArray(a) {
+  var P = -1, F = Array(a.size);
+  return a.forEach(function(a2, I) {
+    F[++P] = [I, a2];
+  }), F;
+}
+var _mapToArray_default = mapToArray;
+function setToArray(a) {
+  var P = -1, F = Array(a.size);
+  return a.forEach(function(a2) {
+    F[++P] = a2;
+  }), F;
+}
+var _setToArray_default = setToArray, COMPARE_PARTIAL_FLAG$4 = 1, COMPARE_UNORDERED_FLAG$2 = 2, boolTag = "[object Boolean]", dateTag = "[object Date]", errorTag = "[object Error]", mapTag = "[object Map]", numberTag = "[object Number]", regexpTag = "[object RegExp]", setTag = "[object Set]", stringTag = "[object String]", symbolTag = "[object Symbol]", arrayBufferTag = "[object ArrayBuffer]", dataViewTag = "[object DataView]", symbolProto = _Symbol_default ? _Symbol_default.prototype : void 0, symbolValueOf = symbolProto ? symbolProto.valueOf : void 0;
+function equalByTag(a, P, F, I, L, R, z) {
+  switch (F) {
+    case dataViewTag:
+      if (a.byteLength != P.byteLength || a.byteOffset != P.byteOffset) return false;
+      a = a.buffer, P = P.buffer;
+    case arrayBufferTag:
+      return !(a.byteLength != P.byteLength || !R(new _Uint8Array_default(a), new _Uint8Array_default(P)));
+    case boolTag:
+    case dateTag:
+    case numberTag:
+      return eq_default(+a, +P);
+    case errorTag:
+      return a.name == P.name && a.message == P.message;
+    case regexpTag:
+    case stringTag:
+      return a == P + "";
+    case mapTag:
+      var B = _mapToArray_default;
+    case setTag:
+      var V = I & COMPARE_PARTIAL_FLAG$4;
+      if (B || (B = _setToArray_default), a.size != P.size && !V) return false;
+      var H = z.get(a);
+      if (H) return H == P;
+      I |= COMPARE_UNORDERED_FLAG$2, z.set(a, P);
+      var U = _equalArrays_default(B(a), B(P), I, L, R, z);
+      return z.delete(a), U;
+    case symbolTag:
+      if (symbolValueOf) return symbolValueOf.call(a) == symbolValueOf.call(P);
+  }
+  return false;
+}
+var _equalByTag_default = equalByTag, COMPARE_PARTIAL_FLAG$3 = 1, hasOwnProperty$1 = Object.prototype.hasOwnProperty;
+function equalObjects(a, P, F, I, L, R) {
+  var z = F & COMPARE_PARTIAL_FLAG$3, B = _getAllKeys_default(a), V = B.length;
+  if (V != _getAllKeys_default(P).length && !z) return false;
+  for (var H = V; H--; ) {
+    var U = B[H];
+    if (!(z ? U in P : hasOwnProperty$1.call(P, U))) return false;
+  }
+  var W = R.get(a), G = R.get(P);
+  if (W && G) return W == P && G == a;
+  var K = true;
+  R.set(a, P), R.set(P, a);
+  for (var q = z; ++H < V; ) {
+    U = B[H];
+    var J = a[U], Y = P[U];
+    if (I) var X = z ? I(Y, J, U, P, a, R) : I(J, Y, U, a, P, R);
+    if (!(X === void 0 ? J === Y || L(J, Y, F, I, R) : X)) {
+      K = false;
+      break;
+    }
+    q || (q = U == "constructor");
+  }
+  if (K && !q) {
+    var Z = a.constructor, Q = P.constructor;
+    Z != Q && "constructor" in a && "constructor" in P && !(typeof Z == "function" && Z instanceof Z && typeof Q == "function" && Q instanceof Q) && (K = false);
+  }
+  return R.delete(a), R.delete(P), K;
+}
+var _equalObjects_default = equalObjects, COMPARE_PARTIAL_FLAG$2 = 1, argsTag = "[object Arguments]", arrayTag = "[object Array]", objectTag = "[object Object]", hasOwnProperty = Object.prototype.hasOwnProperty;
+function baseIsEqualDeep(a, P, F, I, L, R) {
+  var z = isArray_default(a), B = isArray_default(P), V = z ? arrayTag : _getTag_default(a), U = B ? arrayTag : _getTag_default(P);
+  V = V == argsTag ? objectTag : V, U = U == argsTag ? objectTag : U;
+  var q = V == objectTag, J = U == objectTag, Y = V == U;
+  if (Y && isBuffer_default(a)) {
+    if (!isBuffer_default(P)) return false;
+    z = true, q = false;
+  }
+  if (Y && !q) return R || (R = new _Stack_default()), z || isTypedArray_default(a) ? _equalArrays_default(a, P, F, I, L, R) : _equalByTag_default(a, P, V, F, I, L, R);
+  if (!(F & COMPARE_PARTIAL_FLAG$2)) {
+    var X = q && hasOwnProperty.call(a, "__wrapped__"), Z = J && hasOwnProperty.call(P, "__wrapped__");
+    if (X || Z) {
+      var Q = X ? a.value() : a, $ = Z ? P.value() : P;
+      return R || (R = new _Stack_default()), L(Q, $, F, I, R);
+    }
+  }
+  return Y ? (R || (R = new _Stack_default()), _equalObjects_default(a, P, F, I, L, R)) : false;
+}
+var _baseIsEqualDeep_default = baseIsEqualDeep;
+function baseIsEqual(P, F, I, L, R) {
+  return P === F ? true : P == null || F == null || !isObjectLike_default(P) && !isObjectLike_default(F) ? P !== P && F !== F : _baseIsEqualDeep_default(P, F, I, L, baseIsEqual, R);
+}
+var _baseIsEqual_default = baseIsEqual, COMPARE_PARTIAL_FLAG$1 = 1, COMPARE_UNORDERED_FLAG$1 = 2;
+function baseIsMatch(a, P, F, I) {
+  var L = F.length, R = L, z = !I;
+  if (a == null) return !R;
+  for (a = Object(a); L--; ) {
+    var B = F[L];
+    if (z && B[2] ? B[1] !== a[B[0]] : !(B[0] in a)) return false;
+  }
+  for (; ++L < R; ) {
+    B = F[L];
+    var V = B[0], H = a[V], U = B[1];
+    if (z && B[2]) {
+      if (H === void 0 && !(V in a)) return false;
+    } else {
+      var G = new _Stack_default();
+      if (I) var K = I(H, U, V, a, P, G);
+      if (!(K === void 0 ? _baseIsEqual_default(U, H, COMPARE_PARTIAL_FLAG$1 | COMPARE_UNORDERED_FLAG$1, I, G) : K)) return false;
+    }
+  }
+  return true;
+}
+var _baseIsMatch_default = baseIsMatch;
+function isStrictComparable(a) {
+  return a === a && !isObject_default(a);
+}
+var _isStrictComparable_default = isStrictComparable;
+function getMatchData(a) {
+  for (var P = keys_default(a), F = P.length; F--; ) {
+    var I = P[F], L = a[I];
+    P[F] = [
+      I,
+      L,
+      _isStrictComparable_default(L)
+    ];
+  }
+  return P;
+}
+var _getMatchData_default = getMatchData;
+function matchesStrictComparable(a, P) {
+  return function(F) {
+    return F == null ? false : F[a] === P && (P !== void 0 || a in Object(F));
+  };
+}
+var _matchesStrictComparable_default = matchesStrictComparable;
+function baseMatches(a) {
+  var P = _getMatchData_default(a);
+  return P.length == 1 && P[0][2] ? _matchesStrictComparable_default(P[0][0], P[0][1]) : function(F) {
+    return F === a || _baseIsMatch_default(F, a, P);
+  };
+}
+var _baseMatches_default = baseMatches, COMPARE_PARTIAL_FLAG = 1, COMPARE_UNORDERED_FLAG = 2;
+function baseMatchesProperty(a, P) {
+  return _isKey_default(a) && _isStrictComparable_default(P) ? _matchesStrictComparable_default(_toKey_default(a), P) : function(F) {
+    var I = get_default(F, a);
+    return I === void 0 && I === P ? hasIn_default(F, a) : _baseIsEqual_default(P, I, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);
+  };
+}
+var _baseMatchesProperty_default = baseMatchesProperty;
+function baseProperty(a) {
+  return function(P) {
+    return P == null ? void 0 : P[a];
+  };
+}
+var _baseProperty_default = baseProperty;
+function basePropertyDeep(a) {
+  return function(P) {
+    return _baseGet_default(P, a);
+  };
+}
+var _basePropertyDeep_default = basePropertyDeep;
+function property(a) {
+  return _isKey_default(a) ? _baseProperty_default(_toKey_default(a)) : _basePropertyDeep_default(a);
+}
+var property_default = property;
+function baseIteratee(a) {
+  return typeof a == "function" ? a : a == null ? identity_default : typeof a == "object" ? isArray_default(a) ? _baseMatchesProperty_default(a[0], a[1]) : _baseMatches_default(a) : property_default(a);
+}
+var _baseIteratee_default = baseIteratee;
+function baseForOwn(a, P) {
+  return a && _baseFor_default(a, P, keys_default);
+}
+var _baseForOwn_default = baseForOwn;
+function createBaseEach(a, P) {
+  return function(F, I) {
+    if (F == null) return F;
+    if (!isArrayLike_default(F)) return a(F, I);
+    for (var L = F.length, R = P ? L : -1, z = Object(F); (P ? R-- : ++R < L) && I(z[R], R, z) !== false; ) ;
+    return F;
+  };
+}
+var _baseEach_default = createBaseEach(_baseForOwn_default);
+function arrayIncludesWith(a, P, F) {
+  for (var I = -1, L = a == null ? 0 : a.length; ++I < L; ) if (F(P, a[I])) return true;
+  return false;
+}
+var _arrayIncludesWith_default = arrayIncludesWith;
+function castFunction(a) {
+  return typeof a == "function" ? a : identity_default;
+}
+var _castFunction_default = castFunction;
+function forEach(a, P) {
+  return (isArray_default(a) ? _arrayEach_default : _baseEach_default)(a, _castFunction_default(P));
+}
+var forEach_default = forEach;
+function baseFilter(a, P) {
+  var F = [];
+  return _baseEach_default(a, function(a2, I, L) {
+    P(a2, I, L) && F.push(a2);
+  }), F;
+}
+var _baseFilter_default = baseFilter;
+function filter(a, P) {
+  return (isArray_default(a) ? _arrayFilter_default : _baseFilter_default)(a, _baseIteratee_default(P, 3));
+}
+var filter_default = filter;
+function baseValues(a, P) {
+  return _arrayMap_default(P, function(P2) {
+    return a[P2];
+  });
+}
+var _baseValues_default = baseValues;
+function values(a) {
+  return a == null ? [] : _baseValues_default(a, keys_default(a));
+}
+var values_default = values;
+function isUndefined(a) {
+  return a === void 0;
+}
+var isUndefined_default = isUndefined;
+function baseReduce(a, P, F, I, L) {
+  return L(a, function(a2, L2, R) {
+    F = I ? (I = false, a2) : P(F, a2, L2, R);
+  }), F;
+}
+var _baseReduce_default = baseReduce;
+function reduce(a, P, F) {
+  var I = isArray_default(a) ? _arrayReduce_default : _baseReduce_default, L = arguments.length < 3;
+  return I(a, _baseIteratee_default(P, 4), F, L, _baseEach_default);
+}
+var reduce_default = reduce, _createSet_default = _Set_default && 1 / _setToArray_default(new _Set_default([, -0]))[1] == Infinity ? function(a) {
+  return new _Set_default(a);
+} : noop_default, LARGE_ARRAY_SIZE = 200;
+function baseUniq(a, P, F) {
+  var I = -1, L = _arrayIncludes_default, R = a.length, z = true, B = [], V = B;
+  if (F) z = false, L = _arrayIncludesWith_default;
+  else if (R >= LARGE_ARRAY_SIZE) {
+    var H = P ? null : _createSet_default(a);
+    if (H) return _setToArray_default(H);
+    z = false, L = _cacheHas_default, V = new _SetCache_default();
+  } else V = P ? [] : B;
+  outer: for (; ++I < R; ) {
+    var U = a[I], W = P ? P(U) : U;
+    if (U = F || U !== 0 ? U : 0, z && W === W) {
+      for (var G = V.length; G--; ) if (V[G] === W) continue outer;
+      P && V.push(W), B.push(U);
+    } else L(V, W, F) || (V !== B && V.push(W), B.push(U));
+  }
+  return B;
+}
+var _baseUniq_default = baseUniq, union_default = _baseRest_default(function(a) {
+  return _baseUniq_default(_baseFlatten_default(a, 1, isArrayLikeObject_default, true));
+}), DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
", Graph = class {
+  constructor(a = {}) {
+    this._isDirected = Object.prototype.hasOwnProperty.call(a, "directed") ? a.directed : true, this._isMultigraph = Object.prototype.hasOwnProperty.call(a, "multigraph") ? a.multigraph : false, this._isCompound = Object.prototype.hasOwnProperty.call(a, "compound") ? a.compound : false, this._label = void 0, this._defaultNodeLabelFn = constant_default(void 0), this._defaultEdgeLabelFn = constant_default(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[GRAPH_NODE] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+  }
+  isDirected() {
+    return this._isDirected;
+  }
+  isMultigraph() {
+    return this._isMultigraph;
+  }
+  isCompound() {
+    return this._isCompound;
+  }
+  setGraph(a) {
+    return this._label = a, this;
+  }
+  graph() {
+    return this._label;
+  }
+  setDefaultNodeLabel(a) {
+    return isFunction_default(a) || (a = constant_default(a)), this._defaultNodeLabelFn = a, this;
+  }
+  nodeCount() {
+    return this._nodeCount;
+  }
+  nodes() {
+    return keys_default(this._nodes);
+  }
+  sources() {
+    var a = this;
+    return filter_default(this.nodes(), function(P) {
+      return isEmpty_default(a._in[P]);
+    });
+  }
+  sinks() {
+    var a = this;
+    return filter_default(this.nodes(), function(P) {
+      return isEmpty_default(a._out[P]);
+    });
+  }
+  setNodes(a, P) {
+    var F = arguments, I = this;
+    return forEach_default(a, function(a2) {
+      F.length > 1 ? I.setNode(a2, P) : I.setNode(a2);
+    }), this;
+  }
+  setNode(a, P) {
+    return Object.prototype.hasOwnProperty.call(this._nodes, a) ? (arguments.length > 1 && (this._nodes[a] = P), this) : (this._nodes[a] = arguments.length > 1 ? P : this._defaultNodeLabelFn(a), this._isCompound && (this._parent[a] = GRAPH_NODE, this._children[a] = {}, this._children[GRAPH_NODE][a] = true), this._in[a] = {}, this._preds[a] = {}, this._out[a] = {}, this._sucs[a] = {}, ++this._nodeCount, this);
+  }
+  node(a) {
+    return this._nodes[a];
+  }
+  hasNode(a) {
+    return Object.prototype.hasOwnProperty.call(this._nodes, a);
+  }
+  removeNode(a) {
+    if (Object.prototype.hasOwnProperty.call(this._nodes, a)) {
+      var P = (a2) => this.removeEdge(this._edgeObjs[a2]);
+      delete this._nodes[a], this._isCompound && (this._removeFromParentsChildList(a), delete this._parent[a], forEach_default(this.children(a), (a2) => {
+        this.setParent(a2);
+      }), delete this._children[a]), forEach_default(keys_default(this._in[a]), P), delete this._in[a], delete this._preds[a], forEach_default(keys_default(this._out[a]), P), delete this._out[a], delete this._sucs[a], --this._nodeCount;
+    }
+    return this;
+  }
+  setParent(a, P) {
+    if (!this._isCompound) throw Error("Cannot set parent in a non-compound graph");
+    if (isUndefined_default(P)) P = GRAPH_NODE;
+    else {
+      P += "";
+      for (var F = P; !isUndefined_default(F); F = this.parent(F)) if (F === a) throw Error("Setting " + P + " as parent of " + a + " would create a cycle");
+      this.setNode(P);
+    }
+    return this.setNode(a), this._removeFromParentsChildList(a), this._parent[a] = P, this._children[P][a] = true, this;
+  }
+  _removeFromParentsChildList(a) {
+    delete this._children[this._parent[a]][a];
+  }
+  parent(a) {
+    if (this._isCompound) {
+      var P = this._parent[a];
+      if (P !== GRAPH_NODE) return P;
+    }
+  }
+  children(a) {
+    if (isUndefined_default(a) && (a = GRAPH_NODE), this._isCompound) {
+      var P = this._children[a];
+      if (P) return keys_default(P);
+    } else if (a === GRAPH_NODE) return this.nodes();
+    else if (this.hasNode(a)) return [];
+  }
+  predecessors(a) {
+    var P = this._preds[a];
+    if (P) return keys_default(P);
+  }
+  successors(a) {
+    var P = this._sucs[a];
+    if (P) return keys_default(P);
+  }
+  neighbors(a) {
+    var P = this.predecessors(a);
+    if (P) return union_default(P, this.successors(a));
+  }
+  isLeaf(a) {
+    return (this.isDirected() ? this.successors(a) : this.neighbors(a)).length === 0;
+  }
+  filterNodes(a) {
+    var P = new this.constructor({
+      directed: this._isDirected,
+      multigraph: this._isMultigraph,
+      compound: this._isCompound
+    });
+    P.setGraph(this.graph());
+    var F = this;
+    forEach_default(this._nodes, function(F2, I2) {
+      a(I2) && P.setNode(I2, F2);
+    }), forEach_default(this._edgeObjs, function(a2) {
+      P.hasNode(a2.v) && P.hasNode(a2.w) && P.setEdge(a2, F.edge(a2));
+    });
+    var I = {};
+    function L(a2) {
+      var R = F.parent(a2);
+      return R === void 0 || P.hasNode(R) ? (I[a2] = R, R) : R in I ? I[R] : L(R);
+    }
+    return this._isCompound && forEach_default(P.nodes(), function(a2) {
+      P.setParent(a2, L(a2));
+    }), P;
+  }
+  setDefaultEdgeLabel(a) {
+    return isFunction_default(a) || (a = constant_default(a)), this._defaultEdgeLabelFn = a, this;
+  }
+  edgeCount() {
+    return this._edgeCount;
+  }
+  edges() {
+    return values_default(this._edgeObjs);
+  }
+  setPath(a, P) {
+    var F = this, I = arguments;
+    return reduce_default(a, function(a2, L) {
+      return I.length > 1 ? F.setEdge(a2, L, P) : F.setEdge(a2, L), L;
+    }), this;
+  }
+  setEdge() {
+    var a, P, F, I, L = false, R = arguments[0];
+    typeof R == "object" && R && "v" in R ? (a = R.v, P = R.w, F = R.name, arguments.length === 2 && (I = arguments[1], L = true)) : (a = R, P = arguments[1], F = arguments[3], arguments.length > 2 && (I = arguments[2], L = true)), a = "" + a, P = "" + P, isUndefined_default(F) || (F = "" + F);
+    var z = edgeArgsToId(this._isDirected, a, P, F);
+    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, z)) return L && (this._edgeLabels[z] = I), this;
+    if (!isUndefined_default(F) && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(a), this.setNode(P), this._edgeLabels[z] = L ? I : this._defaultEdgeLabelFn(a, P, F);
+    var B = edgeArgsToObj(this._isDirected, a, P, F);
+    return a = B.v, P = B.w, Object.freeze(B), this._edgeObjs[z] = B, incrementOrInitEntry(this._preds[P], a), incrementOrInitEntry(this._sucs[a], P), this._in[P][z] = B, this._out[a][z] = B, this._edgeCount++, this;
+  }
+  edge(a, P, F) {
+    var I = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, a, P, F);
+    return this._edgeLabels[I];
+  }
+  hasEdge(a, P, F) {
+    var I = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, a, P, F);
+    return Object.prototype.hasOwnProperty.call(this._edgeLabels, I);
+  }
+  removeEdge(a, P, F) {
+    var I = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, a, P, F), L = this._edgeObjs[I];
+    return L && (a = L.v, P = L.w, delete this._edgeLabels[I], delete this._edgeObjs[I], decrementOrRemoveEntry(this._preds[P], a), decrementOrRemoveEntry(this._sucs[a], P), delete this._in[P][I], delete this._out[a][I], this._edgeCount--), this;
+  }
+  inEdges(a, P) {
+    var F = this._in[a];
+    if (F) {
+      var I = values_default(F);
+      return P ? filter_default(I, function(a2) {
+        return a2.v === P;
+      }) : I;
+    }
+  }
+  outEdges(a, P) {
+    var F = this._out[a];
+    if (F) {
+      var I = values_default(F);
+      return P ? filter_default(I, function(a2) {
+        return a2.w === P;
+      }) : I;
+    }
+  }
+  nodeEdges(a, P) {
+    var F = this.inEdges(a, P);
+    if (F) return F.concat(this.outEdges(a, P));
+  }
+};
+Graph.prototype._nodeCount = 0, Graph.prototype._edgeCount = 0;
+function incrementOrInitEntry(a, P) {
+  a[P] ? a[P]++ : a[P] = 1;
+}
+function decrementOrRemoveEntry(a, P) {
+  --a[P] || delete a[P];
+}
+function edgeArgsToId(a, P, F, I) {
+  var L = "" + P, R = "" + F;
+  if (!a && L > R) {
+    var z = L;
+    L = R, R = z;
+  }
+  return L + EDGE_KEY_DELIM + R + EDGE_KEY_DELIM + (isUndefined_default(I) ? DEFAULT_EDGE_NAME : I);
+}
+function edgeArgsToObj(a, P, F, I) {
+  var L = "" + P, R = "" + F;
+  if (!a && L > R) {
+    var z = L;
+    L = R, R = z;
+  }
+  var B = {
+    v: L,
+    w: R
+  };
+  return I && (B.name = I), B;
+}
+function edgeObjToId(a, P) {
+  return edgeArgsToId(a, P.v, P.w, P.name);
+}
+export {
+  _baseFindIndex_default as _,
+  filter_default as a,
+  _baseEach_default as c,
+  _baseProperty_default as d,
+  _getAllKeys_default as f,
+  keys_default as g,
+  stubArray_default as h,
+  values_default as i,
+  _baseForOwn_default as l,
+  _getSymbols_default as m,
+  reduce_default as n,
+  forEach_default as o,
+  _baseGetAllKeys_default as p,
+  isUndefined_default as r,
+  _castFunction_default as s,
+  Graph as t,
+  _baseIteratee_default as u,
+  _arrayEach_default as v
+};

package/dist/groovy-DCjvesOy.js

@@ -0,0 +1,4 @@
+import { t as groovy } from "./groovy-Zt6CNPxV.js";
+export {
+  groovy
+};