tutuca 0.9.9 → 0.9.11

package/dist/tutuca-dev.js

@@ -2639,13 +2639,13 @@ function hasIterator(maybeIterable) {
   }
   return !!getIteratorFn(maybeIterable);
 }
-var isIterator = (maybeIterator) => !!(maybeIterator && typeof maybeIterator.next === "function");
+var isIterator = (maybeIterator) => typeof maybeIterator?.next === "function";
 function getIterator(iterable) {
   const iteratorFn = getIteratorFn(iterable);
   return iteratorFn?.call(iterable);
 }
 function getIteratorFn(iterable) {
-  const iteratorFn = iterable && iterable[Symbol.iterator];
+  const iteratorFn = iterable?.[Symbol.iterator];
   if (typeof iteratorFn === "function") {
     return iteratorFn;
   }
@@ -2740,12 +2740,10 @@ function flipFactory(collection) {
   flipSequence.__iterate = function(fn, reverse) {
     return collection.__iterate((v, k) => fn(k, v, this), reverse);
   };
-  flipSequence.__iteratorUncached = function(reverse) {
-    return mapEntries(collection.__iterator(reverse), (k, v, entry) => {
-      entry[0] = v;
-      entry[1] = k;
-    });
-  };
+  flipSequence.__iteratorUncached = (reverse) => mapEntries(collection.__iterator(reverse), (k, v, entry) => {
+    entry[0] = v;
+    entry[1] = k;
+  });
   return flipSequence;
 }
 function mapFactory(collection, mapper, context) {
@@ -2759,12 +2757,10 @@ function mapFactory(collection, mapper, context) {
   mappedSequence.__iterate = function(fn, reverse) {
     return collection.__iterate((v, k) => fn(mapper.call(context, v, k, collection), k, this), reverse);
   };
-  mappedSequence.__iteratorUncached = function(reverse) {
-    return mapEntries(collection.__iterator(reverse), (k, v, entry) => {
-      entry[0] = k;
-      entry[1] = mapper.call(context, v, k, collection);
-    });
-  };
+  mappedSequence.__iteratorUncached = (reverse) => mapEntries(collection.__iterator(reverse), (k, v, entry) => {
+    entry[0] = k;
+    entry[1] = mapper.call(context, v, k, collection);
+  });
   return mappedSequence;
 }
 function reverseFactory(collection, useKeys) {
@@ -2917,7 +2913,7 @@ function maxFactory(collection, comparator, mapper) {
   }
   if (mapper) {
     const entry = collection.toSeq().map((v, k) => [v, mapper(v, k, collection)]).reduce((a, b) => maxCompare(comparator, a[1], b[1]) ? b : a);
-    return entry && entry[0];
+    return entry?.[0];
   }
   return collection.reduce((a, b) => maxCompare(comparator, a, b) ? b : a);
 }
@@ -3522,7 +3518,7 @@ class CollectionImpl {
   }
   findKey(predicate, context) {
     const entry = this.findEntry(predicate, context);
-    return entry && entry[0];
+    return entry?.[0];
   }
   findLast(predicate, context, notSetValue) {
     return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);
@@ -5114,7 +5110,11 @@ function shallowCopy(from) {
     ...from
   };
 }
+var merge$1 = (collection, ...sources) => mergeWithSources(collection, sources);
+var mergeWith$1 = (merger, collection, ...sources) => mergeWithSources(collection, sources, merger);
 var mergeDeepWithSources = (collection, sources, merger) => mergeWithSources(collection, sources, deepMergerWith(merger));
+var mergeDeep$1 = (collection, ...sources) => mergeDeepWithSources(collection, sources);
+var mergeDeepWith$1 = (merger, collection, ...sources) => mergeDeepWithSources(collection, sources, merger);
 function mergeWithSources(collection, sources, merger) {
   if (!isDataStructure(collection)) {
     throw new TypeError(`Cannot merge into non-data-structure value: ${collection}`);
@@ -5386,7 +5386,7 @@ class ListImpl extends IndexedCollectionImpl {
     if (index >= 0 && index < this.size) {
       index += this._origin;
       const node = listNodeFor(this, index);
-      return node && node.array[index & MASK];
+      return node?.array[index & MASK];
     }
     return notSetValue;
   }
@@ -5617,7 +5617,7 @@ function iterateList(list, reverse) {
   function pushFrame(node, level, offset) {
     if (level === 0) {
       const array = offset === tailPos ? tail?.array : node?.array;
-      let from = offset > left ? 0 : left - offset;
+      const from = offset > left ? 0 : left - offset;
       let to = right - offset;
       if (to > SIZE) {
         to = SIZE;
@@ -5632,7 +5632,7 @@ function iterateList(list, reverse) {
       }
     } else {
       const array = node?.array;
-      let from = offset > left ? 0 : left - offset >> level;
+      const from = offset > left ? 0 : left - offset >> level;
       let to = (right - offset >> level) + 1;
       if (to > SIZE) {
         to = SIZE;
@@ -5734,7 +5734,7 @@ function updateVNode(node, ownerID, level, index, value, didAlter) {
   }
   let newNode;
   if (level > 0) {
-    const lowerNode = node && node.array[idx];
+    const lowerNode = node?.array[idx];
     const newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);
     if (newLowerNode === lowerNode) {
       return node;
@@ -5827,14 +5827,14 @@ function setListBounds(list, begin, end) {
     node.array[oldTailOffset >>> SHIFT & MASK] = oldTail;
   }
   if (newCapacity < oldCapacity) {
-    newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);
+    newTail = newTail?.removeAfter(owner, 0, newCapacity);
   }
   if (newOrigin >= newTailOffset) {
     newOrigin -= newTailOffset;
     newCapacity -= newTailOffset;
     newLevel = SHIFT;
     newRoot = null;
-    newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);
+    newTail = newTail?.removeBefore(owner, 0, newOrigin);
   } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {
     offsetShift = 0;
     while (newRoot) {
@@ -6402,6 +6402,10 @@ class OrderedSetImpl extends SetImpl {
 OrderedSet.isOrderedSet = isOrderedSet;
 var makeOrderedSet = (map, ownerID) => new OrderedSetImpl(map, ownerID);
 var emptyOrderedSet = () => makeOrderedSet(emptyOrderedMap());
+var PairSorting = {
+  LeftThenRight: -1,
+  RightThenLeft: 1
+};
 function throwOnInvalidDefaultValues(defaultValues) {
   if (isRecord(defaultValues)) {
     throw new Error("Can not call `Record` with an immutable Record as default values. Use a plain javascript object instead.");
@@ -6735,6 +6739,11 @@ class RangeImpl extends IndexedSeqImpl {
     this.prototype[Symbol.iterator] = this.prototype.values;
   }
 }
+var Repeat = (value, times) => {
+  const size = times === undefined ? Infinity : Math.max(0, times);
+  return new RepeatImpl(value, size);
+};
+
 class RepeatImpl extends IndexedSeqImpl {
   constructor(value, size) {
     super();
@@ -6821,6 +6830,28 @@ class RepeatImpl extends IndexedSeqImpl {
     this.prototype[Symbol.iterator] = this.prototype.values;
   }
 }
+var fromJS = (value, converter) => fromJSWith([], converter ?? defaultConverter, value, "", converter?.length > 2 ? [] : undefined, {
+  "": value
+});
+function fromJSWith(stack, converter, value, key, keyPath, parentValue) {
+  if (typeof value !== "string" && !isImmutable(value) && (isArrayLike(value) || hasIterator(value) || isPlainObject(value))) {
+    if (stack.includes(value)) {
+      throw new TypeError("Cannot convert circular structure to Immutable");
+    }
+    stack.push(value);
+    if (keyPath && key !== "") {
+      keyPath.push(key);
+    }
+    const converted = converter.call(parentValue, key, Seq(value).map((v, k) => fromJSWith(stack, converter, v, k, keyPath, value)), keyPath?.slice());
+    stack.pop();
+    if (keyPath) {
+      keyPath.pop();
+    }
+    return converted;
+  }
+  return value;
+}
+var defaultConverter = (k, v) => isIndexed(v) ? v.toList() : isKeyed(v) ? v.toMap() : v.toSet();
 var asValues = (collection) => isKeyed(collection) ? collection.valueSeq() : collection;
 function initCollectionConversions() {
   CollectionImpl.prototype.toMap = function toMap() {
@@ -6876,7 +6907,12 @@ function initCollectionConversions() {
     return OrderedSet(sortFactory(this, comparator, mapper));
   };
 }
+var version$1 = "7.0.0";
+var pkg = {
+  version: version$1
+};
 initCollectionConversions();
+var { version } = pkg;
 
 // src/oo.js
 var BAD_VALUE = Symbol("BadValue");
@@ -7916,8 +7952,8 @@ async function compileClassesToStyle(app, compileClasses, styleId = "margaui-css
   injectCss(styleId, css2);
   return t2 - t1;
 }
-async function compileClassesToStyleText(app, compileClasses, extraCSSClasses) {
-  app.ParseContext = ParseCtxClassSetCollector;
+async function compileClassesToStyleText(app, compileClasses, extraCSSClasses, Ctx = ParseCtxClassSetCollector) {
+  app.ParseContext = Ctx;
   app.compile();
   const classes = new Set(extraCSSClasses ?? []);
   for (const Comp of app.comps.byId.values()) {
@@ -8153,19 +8189,67 @@ class LintParseContext extends ParseContext {
     this.attrs.push({ attrs, wrapperAttrs, textChild });
   }
 }
+// dev.js
+class LintClassCollectorCtx extends ParseCtxClassSetCollector {
+  constructor(...args) {
+    super(...args);
+    this.attrs = [];
+  }
+  enterMacro(macroName, macroVars, macroSlots) {
+    const { DOMParser: DP, Text, Comment, nodes, events, macroNodes } = this;
+    const frame = { macroName, macroVars, macroSlots };
+    const v = new LintClassCollectorCtx(DP, Text, Comment, nodes, events, macroNodes, frame, this);
+    v.classes = this.classes;
+    v.attrs = this.attrs;
+    return v;
+  }
+  onAttributes(attrs, wrapperAttrs, textChild) {
+    super.onAttributes(attrs, wrapperAttrs, textChild);
+    this.attrs.push({ attrs, wrapperAttrs, textChild });
+  }
+}
 export {
+  version,
+  updateIn$1 as updateIn,
+  update$1 as update,
   tutuca,
+  setIn$1 as setIn,
+  set,
   seqInfoByClass,
+  removeIn,
+  remove,
+  mergeWith$1 as mergeWith,
+  mergeDeepWith$1 as mergeDeepWith,
+  mergeDeep$1 as mergeDeep,
+  merge$1 as merge,
   macro,
+  isValueObject,
+  isStack,
+  isSet,
+  isSeq,
+  isRecord,
+  isPlainObject,
+  isOrderedSet,
   isOrderedMap,
+  isOrdered,
   isOrderedMap as isOMap,
   isMap,
   isList,
   isKeyed,
   isIndexed,
+  isImmutable,
   isMap as isIMap,
+  isCollection,
+  isAssociative,
+  is,
   injectCss,
   html,
+  hash,
+  hasIn$1 as hasIn,
+  has,
+  getIn$1 as getIn,
+  get,
+  fromJS,
   fieldsByClass,
   css,
   component,
@@ -8177,13 +8261,23 @@ export {
   UNKNOWN_HANDLER_ARG_NAME,
   UNKNOWN_EVENT_MODIFIER,
   UNKNOWN_COMPONENT_NAME,
+  Stack2 as Stack,
+  Set2 as Set,
+  Seq,
+  Repeat,
   Record,
+  Range,
   RENDER_IT_OUTSIDE_OF_LOOP,
   ParseContext,
+  PairSorting,
+  OrderedSet,
+  OrderedMap,
   OrderedMap as OMap,
+  Map2 as Map,
   List,
   LintParseContext,
   LintContext,
+  LintClassCollectorCtx,
   LEVEL_WARN,
   LEVEL_HINT,
   LEVEL_ERROR,
@@ -8195,5 +8289,6 @@ export {
   INPUT_HANDLER_FOR_INPUT_HANDLER_METHOD,
   Map2 as IMap,
   FIELD_VAL_NOT_DEFINED,
+  Collection,
   COMPUTED_VAL_NOT_DEFINED
 };