@cube-dev/ui-kit 0.0.0-canary-e5edbab → 0.0.0-canary-7c4d463

package/es/tasty/utils/renderStyles.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 
@@ -80,7 +80,7 @@ function parseAttributeSelector(selector) {
     if (cached !== undefined) {
         return cached;
     }
-    // Match patterns like [data-size="medium"] or [data-is-selected]
+    // Match patterns like [data-size="medium"] or [data-selected]
     const match = selector.match(/^\[([^=\]]+)(?:="([^"]+)")?\]$/);
     const result = match
         ? {
@@ -94,18 +94,26 @@ function parseAttributeSelector(selector) {
     return result;
 }
 function hasConflictingAttributeSelectors(mods, parsedMods) {
-    const attributeMap = new Map();
+    const attributeValues = new Map();
+    const attributeBooleans = new Set();
     for (const mod of mods) {
         const parsed = parsedMods?.get(mod) ?? parseAttributeSelector(mod);
-        if (parsed && parsed.value !== 'true') {
-            if (!attributeMap.has(parsed.attribute)) {
-                attributeMap.set(parsed.attribute, []);
+        if (!parsed)
+            continue;
+        if (parsed.value === 'true') {
+            // Boolean attribute
+            attributeBooleans.add(parsed.attribute);
+        }
+        else {
+            // Value attribute
+            if (!attributeValues.has(parsed.attribute)) {
+                attributeValues.set(parsed.attribute, []);
             }
-            attributeMap.get(parsed.attribute).push(parsed.value);
+            attributeValues.get(parsed.attribute).push(parsed.value);
         }
     }
-    // Check if any attribute has multiple values
-    for (const values of attributeMap.values()) {
+    // Check for multiple different values for the same attribute
+    for (const values of attributeValues.values()) {
         if (values.length > 1)
             return true;
     }
@@ -149,23 +157,182 @@ function buildAttributeMaps(currentMods, allMods) {
     }
     return { allAttributes, currentAttributes, parsedMods };
 }
+/**
+ * Check if a combination of positive and negative selectors creates a contradiction
+ * Returns true if the combination is INVALID and should be pruned
+ */
+function hasContradiction(currentMods, notMods, parsedMods) {
+    // Build maps of positive selector states
+    const positiveAttributes = new Map();
+    const positiveBooleans = new Set();
+    for (const mod of currentMods) {
+        const parsed = parsedMods.get(mod);
+        if (parsed) {
+            if (parsed.value === 'true') {
+                // Boolean attribute (e.g., [data-theme])
+                positiveBooleans.add(parsed.attribute);
+            }
+            else {
+                // Value attribute (e.g., [data-theme="danger"])
+                if (!positiveAttributes.has(parsed.attribute)) {
+                    positiveAttributes.set(parsed.attribute, []);
+                }
+                positiveAttributes.get(parsed.attribute).push(parsed.value);
+            }
+        }
+    }
+    // Check negative selectors for contradictions
+    for (const mod of notMods) {
+        const parsed = parsedMods.get(mod);
+        if (parsed) {
+            if (parsed.value === 'true') {
+                // Negative boolean: !([data-theme])
+                // Case 6: Value positive + attribute negative = CONTRADICTION
+                if (positiveAttributes.has(parsed.attribute) ||
+                    positiveBooleans.has(parsed.attribute)) {
+                    return true; // INVALID: can't have value without attribute
+                }
+            }
+            else {
+                // Negative value: !([data-theme="danger"])
+                // No contradiction - this is valid
+            }
+        }
+    }
+    return false;
+}
 function optimizeNotSelectors(currentMods, allMods, precomputedMaps) {
     const maps = precomputedMaps || buildAttributeMaps(currentMods, allMods);
     const notMods = allMods.filter((mod) => !currentMods.includes(mod));
     const optimizedNotMods = [];
+    // Build maps of positive selector states for subsumption optimization
+    const positiveAttributes = new Map();
+    const positiveBooleans = new Set();
+    for (const mod of currentMods) {
+        const parsed = maps.parsedMods.get(mod);
+        if (parsed) {
+            if (parsed.value === 'true') {
+                positiveBooleans.add(parsed.attribute);
+            }
+            else {
+                if (!positiveAttributes.has(parsed.attribute)) {
+                    positiveAttributes.set(parsed.attribute, []);
+                }
+                positiveAttributes.get(parsed.attribute).push(parsed.value);
+            }
+        }
+    }
     for (const mod of notMods) {
         const parsed = maps.parsedMods.get(mod);
         if (parsed && parsed.value !== 'true') {
+            // Negative value selector
             // If we already have a value for this attribute, skip this not selector
-            // because it's already mutually exclusive
+            // because it's already mutually exclusive (optimization)
+            if (maps.currentAttributes.has(parsed.attribute)) {
+                continue;
+            }
+        }
+        // If we have a positive value for this attribute, skip the negative boolean
+        // This avoids producing selectors like [data-attr="x"]:not([data-attr])
+        if (parsed && parsed.value === 'true') {
             if (maps.currentAttributes.has(parsed.attribute)) {
                 continue;
             }
         }
+        // Case 4 subsumption: If we have a value positive and boolean positive for same attribute
+        // The value implies the boolean, so we can skip the boolean from positive mods
+        // (This is handled elsewhere - the value selector is more specific)
+        // Case 7 subsumption: If we have a value negative and boolean negative for same attribute
+        // The boolean negative implies value negative, so skip the value negative
+        if (parsed && parsed.value !== 'true') {
+            // Check if we also have the boolean attribute in negative mods
+            const booleanMod = allMods.find((m) => {
+                const p = maps.parsedMods.get(m);
+                return (p &&
+                    p.value === 'true' &&
+                    p.attribute === parsed.attribute &&
+                    !currentMods.includes(m));
+            });
+            if (booleanMod) {
+                // We have both !([data-attr]) and !([data-attr="value"])
+                // Skip the value negative as it's subsumed by attribute negative
+                continue;
+            }
+        }
         optimizedNotMods.push(mod);
     }
     return optimizedNotMods;
 }
+/**
+ * Filter mods based on priority order for same-attribute conflicts.
+ * If a boolean selector has higher priority than value selectors for the same attribute,
+ * remove the value selectors (they would be shadowed by the boolean).
+ *
+ * Priority is determined by order in the styleStates (after reversal - earlier = higher priority)
+ */
+function filterModsByPriority(allMods, styleStates, lookupStyles, parsedModsCache) {
+    // Parse all mods once
+    const parsedMods = parsedModsCache || new Map();
+    if (!parsedModsCache) {
+        for (const mod of allMods) {
+            if (!parsedMods.has(mod)) {
+                parsedMods.set(mod, parseAttributeSelector(getModSelector(mod)));
+            }
+        }
+    }
+    // Build priority map: for each mod, find its earliest appearance in any state list
+    const modPriorities = new Map();
+    for (const style of lookupStyles) {
+        const states = styleStates[style];
+        if (!states)
+            continue;
+        // states are already reversed (higher priority = lower index)
+        states.forEach((state, index) => {
+            if (!state.mods)
+                return;
+            state.mods.forEach((mod) => {
+                const currentPriority = modPriorities.get(mod);
+                if (currentPriority === undefined || index < currentPriority) {
+                    modPriorities.set(mod, index);
+                }
+            });
+        });
+    }
+    // Group mods by attribute
+    const attributeGroups = new Map();
+    for (const mod of allMods) {
+        const parsed = parsedMods.get(mod);
+        if (!parsed)
+            continue;
+        const priority = modPriorities.get(mod);
+        if (priority === undefined)
+            continue;
+        const isBool = parsed.value === 'true';
+        if (!attributeGroups.has(parsed.attribute)) {
+            attributeGroups.set(parsed.attribute, []);
+        }
+        attributeGroups.get(parsed.attribute).push({
+            mod,
+            isBool,
+            priority,
+        });
+    }
+    // Filter: for each attribute, if boolean has higher priority than any value, remove values
+    const modsToRemove = new Set();
+    for (const [attribute, group] of attributeGroups.entries()) {
+        const boolMods = group.filter((m) => m.isBool);
+        const valueMods = group.filter((m) => !m.isBool);
+        // Check if any boolean has higher priority (lower index) than all values
+        for (const boolMod of boolMods) {
+            const hasHigherPriorityThanAllValues = valueMods.every((valueMod) => boolMod.priority < valueMod.priority);
+            if (hasHigherPriorityThanAllValues && valueMods.length > 0) {
+                // This boolean shadows all value mods for this attribute
+                valueMods.forEach((valueMod) => modsToRemove.add(valueMod.mod));
+            }
+        }
+    }
+    return allMods.filter((mod) => !modsToRemove.has(mod));
+}
 /**
  * Explode a style handler result into logical rules with proper mapping
  * Phase 1: Handler fan-out ($ selectors, arrays)
@@ -552,11 +719,13 @@ function generateLogicalRules(styles, responsive = [], parentSuffix = '') {
                             }
                         });
                         const allModsArray = Array.from(allMods);
+                        // Apply priority-based filtering for same-attribute boolean vs value conflicts
+                        const filteredMods = filterModsByPriority(allModsArray, styleStates, lookupStyles);
                         // Precompute attribute maps once for all combinations
-                        const attributeMaps = buildAttributeMaps([], allModsArray);
+                        const attributeMaps = buildAttributeMaps([], filteredMods);
                         // Generate combinations with conflict-aware pruning
                         const conflictChecker = createAttributeConflictChecker(attributeMaps.parsedMods);
-                        const combinations = getModCombinationsIterative(allModsArray, true, conflictChecker);
+                        const combinations = getModCombinationsIterative(filteredMods, true, conflictChecker);
                         combinations.forEach((modCombination) => {
                             const stateProps = {};
                             lookupStyles.forEach((style) => {
@@ -567,8 +736,15 @@ function generateLogicalRules(styles, responsive = [], parentSuffix = '') {
                                 }
                             });
                             // Use precomputed maps for efficient not selector optimization
-                            const currentMaps = buildAttributeMaps(modCombination, allModsArray);
-                            const optimizedNotMods = optimizeNotSelectors(modCombination, allModsArray, currentMaps);
+                            const currentMaps = buildAttributeMaps(modCombination, filteredMods);
+                            // Compute raw NOTs for contradiction check (before optimization)
+                            const rawNotMods = filteredMods.filter((mod) => !modCombination.includes(mod));
+                            // Check for contradictions between positive and negative selectors
+                            if (hasContradiction(modCombination, rawNotMods, currentMaps.parsedMods)) {
+                                return; // Skip this invalid combination
+                            }
+                            // Optimize NOT selectors afterwards (pure simplification)
+                            const optimizedNotMods = optimizeNotSelectors(modCombination, filteredMods, currentMaps);
                             const modsSelectors = `${modCombination
                                 .map(getModSelector)
                                 .join('')}${optimizedNotMods
@@ -619,11 +795,13 @@ function generateLogicalRules(styles, responsive = [], parentSuffix = '') {
                     });
                     // Generate all possible mod combinations
                     const allModsArray = Array.from(allMods);
+                    // Apply priority-based filtering for same-attribute boolean vs value conflicts
+                    const filteredMods = filterModsByPriority(allModsArray, styleStates, lookupStyles);
                     // Precompute attribute maps once for all combinations
-                    const attributeMaps = buildAttributeMaps([], allModsArray);
+                    const attributeMaps = buildAttributeMaps([], filteredMods);
                     // Generate combinations with conflict-aware pruning
                     const conflictChecker = createAttributeConflictChecker(attributeMaps.parsedMods);
-                    const combinations = getModCombinationsIterative(allModsArray, true, conflictChecker);
+                    const combinations = getModCombinationsIterative(filteredMods, true, conflictChecker);
                     combinations.forEach((modCombination) => {
                         const stateProps = {};
                         lookupStyles.forEach((style) => {
@@ -637,8 +815,15 @@ function generateLogicalRules(styles, responsive = [], parentSuffix = '') {
                             }
                         });
                         // Use precomputed maps for efficient not selector optimization
-                        const currentMaps = buildAttributeMaps(modCombination, allModsArray);
-                        const optimizedNotMods = optimizeNotSelectors(modCombination, allModsArray, currentMaps);
+                        const currentMaps = buildAttributeMaps(modCombination, filteredMods);
+                        // Compute raw NOTs for contradiction check (before optimization)
+                        const rawNotMods = filteredMods.filter((mod) => !modCombination.includes(mod));
+                        // Check for contradictions between positive and negative selectors
+                        if (hasContradiction(modCombination, rawNotMods, currentMaps.parsedMods)) {
+                            return; // Skip this invalid combination
+                        }
+                        // Optimize NOT selectors afterwards (pure simplification)
+                        const optimizedNotMods = optimizeNotSelectors(modCombination, filteredMods, currentMaps);
                         const modsSelectors = `${modCombination
                             .map(getModSelector)
                             .join('')}${optimizedNotMods

package/es/tasty/utils/responsive.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/tasty/utils/string.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/tasty/utils/styles.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 
@@ -57,7 +57,29 @@ export const DIRECTIONS = ['top', 'right', 'bottom', 'left'];
 const MOD_NAME_CACHE = new Map();
 export function getModSelector(modName) {
     if (!MOD_NAME_CACHE.has(modName)) {
-        MOD_NAME_CACHE.set(modName, modName.match(/^[a-z]/) ? `[data-is-${camelToKebab(modName)}]` : modName);
+        let selector;
+        // Check if it's a shorthand value mod: key=value, key="value", or key='value'
+        const valueModMatch = modName.match(/^([a-z][a-z0-9-]*)=(.+)$/i);
+        if (valueModMatch) {
+            const key = valueModMatch[1];
+            let value = valueModMatch[2];
+            // Remove quotes if present
+            if ((value.startsWith('"') && value.endsWith('"')) ||
+                (value.startsWith("'") && value.endsWith("'"))) {
+                value = value.slice(1, -1);
+            }
+            // Convert to full attribute selector
+            selector = `[data-${camelToKebab(key)}="${value}"]`;
+        }
+        else if (modName.match(/^[a-z]/)) {
+            // Boolean mod: convert camelCase to kebab-case
+            selector = `[data-${camelToKebab(modName)}]`;
+        }
+        else {
+            // Pass through (e.g., :hover, .class, [attr])
+            selector = modName;
+        }
+        MOD_NAME_CACHE.set(modName, selector);
     }
     return MOD_NAME_CACHE.get(modName);
 }
@@ -230,7 +252,7 @@ export function extractStyles(props, styleList = [], defaultStyles, propMap, ign
     }, {});
     return styles;
 }
-const STATES_REGEXP = /([&|!^])|([()])|([a-z][a-z0-9-]+)|(:[a-z][a-z0-9-]+\([^)]+\)|:[a-z][a-z0-9-]+)|(\.[a-z][a-z0-9-]+)|(\[[^\]]+])/gi;
+const STATES_REGEXP = /([&|!^])|([()])|([a-z][a-z0-9-]+=(?:"[^"]*"|'[^']*'|[^\s&|!^()]+))|([a-z][a-z0-9-]+)|(:[a-z][a-z0-9-]+\([^)]+\)|:[a-z][a-z0-9-]+)|(\.[a-z][a-z0-9-]+)|(\[[^\]]+])/gi;
 export const STATE_OPERATORS = {
     NOT: '!',
     AND: '&',

package/es/tasty/utils/warnings.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/tokens.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/ResizeSensor.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/index.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/modules.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/promise.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/raf.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/random.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/range.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/RenderCache.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/Slots.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/chain.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/forwardRefWithGenerics.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/index.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/interactions.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/isTextOnly.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/mapProps.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/mergeProps.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/nullableValue.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/sharedStore.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useCombinedRefs.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useControlledFocusVisible.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useEventBus.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useId.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useIsDarwin.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useKeySymbols.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useLayoutEffect.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */
 

package/es/utils/react/useQaProps.js

@@ -1,7 +1,7 @@
 /**
  * @license MIT
  * author: Cube Dev Team
- * @cube-dev/ui-kit v0.0.0-canary-e5edbab
+ * @cube-dev/ui-kit v0.0.0-canary-7c4d463
  * Released under the MIT license.
  */