pixel-react 1.20.18 → 1.20.20

package/lib/node_modules/webrtc-adapter/src/js/utils.js

@@ -0,0 +1 @@
+let e=!0,t=!0;function n(e,t,n){const r=e.match(t);return r&&r.length>=n&&parseFloat(r[n],10)}function r(e,t,n){if(!e.RTCPeerConnection)return;const r=e.RTCPeerConnection.prototype,o=r.addEventListener;r.addEventListener=function(e,r){if(e!==t)return o.apply(this,arguments);const s=e=>{const t=n(e);t&&(r.handleEvent?r.handleEvent(t):r(t))};return this._eventMap=this._eventMap||{},this._eventMap[t]||(this._eventMap[t]=new Map),this._eventMap[t].set(r,s),o.apply(this,[e,s])};const s=r.removeEventListener;r.removeEventListener=function(e,n){if(e!==t||!this._eventMap||!this._eventMap[t])return s.apply(this,arguments);if(!this._eventMap[t].has(n))return s.apply(this,arguments);const r=this._eventMap[t].get(n);return this._eventMap[t].delete(n),0===this._eventMap[t].size&&delete this._eventMap[t],0===Object.keys(this._eventMap).length&&delete this._eventMap,s.apply(this,[e,r])},Object.defineProperty(r,"on"+t,{get(){return this["_on"+t]},set(e){this["_on"+t]&&(this.removeEventListener(t,this["_on"+t]),delete this["_on"+t]),e&&this.addEventListener(t,this["_on"+t]=e)},enumerable:!0,configurable:!0})}function o(t){return"boolean"!=typeof t?new Error("Argument type: "+typeof t+". Please use a boolean."):(e=t,t?"adapter.js logging disabled":"adapter.js logging enabled")}function s(e){return"boolean"!=typeof e?new Error("Argument type: "+typeof e+". Please use a boolean."):(t=!e,"adapter.js deprecation warnings "+(e?"disabled":"enabled"))}function i(){if("object"==typeof window){if(e)return;"undefined"!=typeof console&&"function"==typeof console.log&&console.log.apply(console,arguments)}}function a(e,n){t&&console.warn(e+" is deprecated, please use "+n+" instead.")}function p(e){const t={browser:null,version:null};if(void 0===e||!e.navigator||!e.navigator.userAgent)return t.browser="Not a browser.",t;const{navigator:r}=e;if(r.userAgentData&&r.userAgentData.brands){const e=r.userAgentData.brands.find(e=>"Chromium"===e.brand);if(e)return{browser:"chrome",version:parseInt(e.version,10)}}if(r.mozGetUserMedia)t.browser="firefox",t.version=parseInt(n(r.userAgent,/Firefox\/(\d+)\./,1));else if(r.webkitGetUserMedia||!1===e.isSecureContext&&e.webkitRTCPeerConnection)t.browser="chrome",t.version=parseInt(n(r.userAgent,/Chrom(e|ium)\/(\d+)\./,2))||null;else{if(!e.RTCPeerConnection||!r.userAgent.match(/AppleWebKit\/(\d+)\./))return t.browser="Not a supported browser.",t;t.browser="safari",t.version=parseInt(n(r.userAgent,/AppleWebKit\/(\d+)\./,1)),t.supportsUnifiedPlan=e.RTCRtpTransceiver&&"currentDirection"in e.RTCRtpTransceiver.prototype,t._safariVersion=n(r.userAgent,/Version\/(\d+(\.?\d+))/,1)}return t}function c(e){return"[object Object]"===Object.prototype.toString.call(e)}function u(e){return c(e)?Object.keys(e).reduce(function(t,n){const r=c(e[n]),o=r?u(e[n]):e[n],s=r&&!Object.keys(o).length;return void 0===o||s?t:Object.assign(t,{[n]:o})},{}):e}function d(e,t,n){t&&!n.has(t.id)&&(n.set(t.id,t),Object.keys(t).forEach(r=>{r.endsWith("Id")?d(e,e.get(t[r]),n):r.endsWith("Ids")&&t[r].forEach(t=>{d(e,e.get(t),n)})}))}function l(e,t,n){const r=n?"outbound-rtp":"inbound-rtp",o=new Map;if(null===t)return o;const s=[];return e.forEach(e=>{"track"===e.type&&e.trackIdentifier===t.id&&s.push(e)}),s.forEach(t=>{e.forEach(n=>{n.type===r&&n.trackId===t.id&&d(e,n,o)})}),o}export{u as compactObject,a as deprecated,p as detectBrowser,o as disableLog,s as disableWarnings,n as extractVersion,l as filterStats,i as log,d as walkStats,r as wrapPeerConnectionEvent};

package/lib/utils/AddStepGroup/AddStepGroup.js

@@ -1,37 +1,3 @@
-import { ffid } from '../ffID/ffid';
-export const addPrePostStepGroup = (steps, stepId, newStep) => {
-    //!Note : This function is used to override the stepId because in some step Groups we are using the same stepId for multiple steps. So we need to override the stepId for the new steps.
-    let newSteps = newStep?.map((step) => ({ ...step, stepId: ffid() }));
-    const typeSet = new Set(['group', 'pre', 'post', 'script']);
-    return steps.map((step) => {
-        const showAccordion = typeSet.has(step?.entityType?.toLowerCase()) ||
-            typeSet.has(step?.type?.toLowerCase());
-        if (step.stepId === stepId) {
-            if (showAccordion) {
-                return {
-                    ...step,
-                    data: [...(newSteps || [])],
-                };
-            }
-        }
-        if (step.data) {
-            return {
-                ...step,
-                data: addPrePostStepGroup(step.data, stepId, newSteps),
-            };
-        }
-        return step;
-    });
-};
-export const addStepGroup = (oldData, title, stepId, newSteps) => {
-    return oldData.map((section) => {
-        if (section.title === title) {
-            return {
-                ...section,
-                data: addPrePostStepGroup(section.data, stepId, newSteps),
-            };
-        }
-        return section;
-    });
-};
-//# sourceMappingURL=AddStepGroup.js.map
+import{ffid as t}from"../ffID/ffid.js";const a=(e,p,o)=>{
+//!Note : This function is used to override the stepId because in some step Groups we are using the same stepId for multiple steps. So we need to override the stepId for the new steps.
+let r=o?.map(a=>({...a,stepId:t()}));const s=new Set(["group","pre","post","script"]);return e.map(t=>{const e=s.has(t?.entityType?.toLowerCase())||s.has(t?.type?.toLowerCase());return t.stepId===p&&e?{...t,data:[...r||[]]}:t.data?{...t,data:a(t.data,p,r)}:t})},e=(t,e,p,o)=>t.map(t=>t.title===e?{...t,data:a(t.data,p,o)}:t);export{a as addPrePostStepGroup,e as addStepGroup};

package/lib/utils/AppendNewRow/AppendNewRow.js

@@ -1,38 +1 @@
-export const appendNewRow = (tableData, AddNlp) => {
-    const { action, sourceIndex, nlpName, id } = AddNlp;
-    if (!action)
-        return tableData;
-    const updatedTreeData = [...tableData];
-    let newNodeBase = {
-        stepId: 'stepId-9745-9745',
-        isNew: true,
-        disabled: false,
-        ...(nlpName && { name: nlpName }),
-        ...(id && { id: id }),
-    };
-    switch (action) {
-        case 'addBelow':
-            if (sourceIndex !== undefined) {
-                updatedTreeData.splice(sourceIndex + 1, 0, newNodeBase);
-            }
-            break;
-        case 'replaceNlp':
-            if (sourceIndex !== undefined) {
-                updatedTreeData.splice(sourceIndex, 0, newNodeBase);
-            }
-            break;
-        case 'EditNlp':
-            if (sourceIndex !== undefined) {
-                updatedTreeData.splice(sourceIndex, 1);
-                updatedTreeData.splice(sourceIndex, 0, newNodeBase);
-            }
-            break;
-        case 'addLast':
-            updatedTreeData.push(newNodeBase);
-            break;
-        default:
-            break;
-    }
-    return updatedTreeData;
-};
-//# sourceMappingURL=AppendNewRow.js.map
+const e=(e,s)=>{const{action:a,sourceIndex:c,nlpName:d,id:i}=s;if(!a)return e;const t=[...e];let p={stepId:"stepId-9745-9745",isNew:!0,disabled:!1,...d&&{name:d},...i&&{id:i}};switch(a){case"addBelow":void 0!==c&&t.splice(c+1,0,p);break;case"replaceNlp":void 0!==c&&t.splice(c,0,p);break;case"EditNlp":void 0!==c&&(t.splice(c,1),t.splice(c,0,p));break;case"addLast":t.push(p)}return t};export{e as appendNewRow};

package/lib/utils/CopyToClipboard/copyToClipboard.js

@@ -1,10 +1 @@
-export const copyToClipboard = (text) => {
-    const textArea = document.createElement('textarea');
-    document.body.appendChild(textArea);
-    textArea.value = text;
-    textArea.select();
-    const successful = document.execCommand('copy');
-    document.body.removeChild(textArea);
-    return successful;
-};
-//# sourceMappingURL=copyToClipboard.js.map
+const e=e=>{const t=document.createElement("textarea");document.body.appendChild(t),t.value=e,t.select();const o=document.execCommand("copy");return document.body.removeChild(t),o};export{e as copyToClipboard};

package/lib/utils/FormatString/FormatString.js

@@ -1,33 +1 @@
-import { SPECIAL_REGEX_CHARACTERS_PATTERN } from '../../validations/regex';
-function formatCamelCaseString(input, removeSections = []) {
-    function escapeRegExp(str) {
-        return str.replace(SPECIAL_REGEX_CHARACTERS_PATTERN, '\\$&');
-    }
-    // Remove all occurrences of specified sections (case-insensitive)
-    const processedString = removeSections.reduce((str, section) => str.replace(new RegExp(escapeRegExp(section), 'gi'), ''), input);
-    // Add spaces before capital letters and capitalize the first letter
-    const formatted = processedString
-        .replace(/([A-Z])/g, ' $1')
-        .trim()
-        .replace(/^./, (str) => str.toUpperCase());
-    return formatted;
-}
-function formatSnakeOrUppercaseString(input) {
-    return input
-        .toLowerCase()
-        .replace(/_/g, ' ')
-        .replace(/^./, (str) => str.toUpperCase());
-}
-export default function formatString(input, removeSections = []) {
-    if (input.toUpperCase() === input) {
-        // Handled completely uppercase strings
-        input = input.toLowerCase();
-    }
-    if (input.includes('_')) {
-        // Handled snake case or uppercase strings
-        return formatSnakeOrUppercaseString(input);
-    }
-    // Handled camel case strings
-    return formatCamelCaseString(input, removeSections);
-}
-//# sourceMappingURL=FormatString.js.map
+import{SPECIAL_REGEX_CHARACTERS_PATTERN as e}from"../../validations/regex.js";function r(r,t=[]){return t.reduce((r,t)=>r.replace(new RegExp(function(r){return r.replace(e,"\\$&")}(t),"gi"),""),r).replace(/([A-Z])/g," $1").trim().replace(/^./,e=>e.toUpperCase())}function t(e,t=[]){return e.toUpperCase()===e&&(e=e.toLowerCase()),e.includes("_")?function(e){return e.toLowerCase().replace(/_/g," ").replace(/^./,e=>e.toUpperCase())}(e):r(e,t)}export{t as default};

package/lib/utils/ScrollToview/ScrollToView.js

@@ -1,17 +1 @@
-export const scrollToView = (id, block = 'nearest', retries = 5) => {
-    if (!id)
-        return;
-    const element = document.getElementById(id);
-    if (element) {
-        element.scrollIntoView({ behavior: 'smooth', block });
-    }
-    else if (retries > 0) {
-        setTimeout(() => {
-            scrollToView(id, block, retries - 1);
-        }, 300);
-    }
-    else {
-        console.warn(`Element with id - "${id}" not found after multiple retries.`);
-    }
-};
-//# sourceMappingURL=ScrollToView.js.map
+const e=(t,o="nearest",n=5)=>{if(!t)return;const r=document.getElementById(t);r?r.scrollIntoView({behavior:"smooth",block:o}):n>0?setTimeout(()=>{e(t,o,n-1)},300):console.warn(`Element with id - "${t}" not found after multiple retries.`)};export{e as scrollToView};

package/lib/utils/TableCell/TableCell.js

@@ -1,24 +1 @@
-export const prepareData = (dataObj, columnObj, index, tableType) => {
-    let cellData = dataObj[columnObj.accessor];
-    if (columnObj.cell) {
-        const refId = dataObj._id || dataObj.id;
-        return columnObj.cell({
-            value: cellData,
-            row: dataObj,
-            column: columnObj.accessor,
-            index: index,
-            tableType: tableType,
-            ...(refId && { refId }),
-        });
-    }
-    else if (columnObj.accessor) {
-        return cellData;
-    }
-    else if (cellData && typeof cellData !== 'object') {
-        return cellData;
-    }
-    else {
-        return '--';
-    }
-};
-//# sourceMappingURL=TableCell.js.map
+const e=(e,c,o,r)=>{let t=e[c.accessor];if(c.cell){const l=e._id||e.id;return c.cell({value:t,row:e,column:c.accessor,index:o,tableType:r,...l&&{refId:l}})}return c.accessor||t&&"object"!=typeof t?t:"--"};export{e as prepareData};

package/lib/utils/TreeNavigateUtils/getNavigateToKey.js

@@ -1,118 +1 @@
-export const getNavigateToKey = (currentNode, treeData, action) => {
-    // this function will find all the children nodes of the current node
-    const getAllChildrenNodesUsingSearchKey = (treeData, searchKey) => {
-        return treeData.filter((node) => node.searchKey && node.searchKey.startsWith(searchKey + '/'));
-    };
-    // this function will find the last child of the current node
-    const findLastChild = (treeData, currentNode) => {
-        // Get all children of the current node using searchKey
-        const children = treeData.filter((node) => node.searchKey && node.searchKey.startsWith(currentNode.searchKey + '/'));
-        if (children.length === 0) {
-            // If no children will return the current node's key
-            return currentNode.key;
-        }
-        // it will  Find the last child
-        const lastChild = children[children.length - 1];
-        // If the last child is a container (nested), recursively find the last child
-        if (lastChild?.container) {
-            return findLastChild(treeData, lastChild);
-        }
-        else {
-            // If the last child is not a container, return its key
-            return lastChild?.key;
-        }
-    };
-    // this function will analyze the hierarchy of the treeData based on the searchKey it hel to find the pre and post node in the parent node
-    const analyzeHierarchy = (treeData, searchKey) => {
-        // Split the searchKey into its hierarchy parts
-        const hierarchyParts = searchKey.split('/').filter((part) => part !== '');
-        const hierarchyMap = {};
-        // Find each level in the treeData
-        hierarchyParts.forEach((_, index) => {
-            const currentPath = '/' + hierarchyParts.slice(0, index + 1).join('/');
-            // Find the node that matches this exact searchKey path
-            const node = treeData.find((n) => n.searchKey === currentPath);
-            if (node) {
-                hierarchyMap[index] = {
-                    key: node.key,
-                    name: node.name ?? '',
-                    type: node.entityType ?? '',
-                    searchKey: node.searchKey ?? '',
-                    hierarchy: node.hierarchy,
-                    isContainer: node.container ?? false,
-                    hasPrePost: false,
-                };
-                // Check if this node has PRE/POST children
-                const children = treeData.filter((n) => n?.searchKey?.startsWith(currentPath + '/') &&
-                    n?.searchKey?.split('/').length ===
-                        currentPath?.split('/').length + 1);
-                hierarchyMap[index].hasPrePost = children.some((child) => child.entityType === 'PRE' || child.entityType === 'POST');
-            }
-        });
-        return hierarchyMap;
-    };
-    const getRootChildren = (treeData, rootNode) => {
-        return treeData.filter((node) => node.parentId === rootNode.key &&
-            node.entityType !== 'POST' &&
-            node.entityType !== 'PRE');
-    };
-    if (action === 'inside' || 'addInside') {
-        // Handle root node case
-        if (currentNode.path === '/Root') {
-            const childrenOfRoot = getRootChildren(treeData, currentNode);
-            if (childrenOfRoot.length > 0) {
-                const lastChildOfRoot = childrenOfRoot[childrenOfRoot.length - 1];
-                if (lastChildOfRoot?.expandedAll === false ||
-                    lastChildOfRoot?.expanded === false) {
-                    return { navigateTo: lastChildOfRoot?.key };
-                }
-                if (lastChildOfRoot?.expandedAll === true ||
-                    lastChildOfRoot?.expanded === true) {
-                    const lastChildExpand = getAllChildrenNodesUsingSearchKey(treeData, lastChildOfRoot?.searchKey);
-                    return {
-                        navigateTo: lastChildExpand[lastChildExpand.length - 1]?.key,
-                    };
-                }
-            }
-        }
-        else {
-            // Handle non-root node case
-            const lastChild = findLastChild(treeData, currentNode);
-            const currentNodeAllChildren = getAllChildrenNodesUsingSearchKey(treeData, currentNode?.searchKey);
-            const hierarchyInfo = analyzeHierarchy(treeData, currentNode?.searchKey);
-            const currentNodeHierarchyInfo = Object.values(hierarchyInfo).find((obj) => obj.key === currentNode.key);
-            if (currentNodeAllChildren.length > 0) {
-                const nonPostPreChildren = currentNodeAllChildren.filter((node) => node.entityType !== 'POST' && node.entityType !== 'PRE');
-                if (nonPostPreChildren.length > 0) {
-                    return {
-                        navigateTo: currentNodeHierarchyInfo?.hasPrePost
-                            ? nonPostPreChildren[nonPostPreChildren.length - 1]?.key
-                            : lastChild,
-                    };
-                }
-                else {
-                    return {
-                        navigateTo: currentNodeAllChildren[currentNodeAllChildren.length - 1]?.key,
-                    };
-                }
-            }
-            else {
-                return { navigateTo: currentNode?.key };
-            }
-        }
-    }
-    else if (action === 'below' || 'addBelow') {
-        if (currentNode.expandedAll === false || currentNode.expanded === false) {
-            return { navigateTo: currentNode?.key };
-        }
-        else {
-            const lastChild = findLastChild(treeData, currentNode);
-            return { navigateTo: lastChild };
-        }
-    }
-    else if (action === 'above' || 'addAbove') {
-        return { navigateTo: currentNode?.key };
-    }
-    return { navigateTo: currentNode?.key };
-};
-//# sourceMappingURL=getNavigateToKey.js.map
+const e=(e,t,n)=>{const r=(e,t)=>e.filter(e=>e.searchKey&&e.searchKey.startsWith(t+"/")),a=(e,t)=>{const n=e.filter(e=>e.searchKey&&e.searchKey.startsWith(t.searchKey+"/"));if(0===n.length)return t.key;const r=n[n.length-1];return r?.container?a(e,r):r?.key};if("/Root"!==e.path){const n=a(t,e),s=r(t,e?.searchKey),y=((e,t)=>{const n=t.split("/").filter(e=>""!==e),r={};return n.forEach((t,a)=>{const s="/"+n.slice(0,a+1).join("/"),y=e.find(e=>e.searchKey===s);if(y){r[a]={key:y.key,name:y.name??"",type:y.entityType??"",searchKey:y.searchKey??"",hierarchy:y.hierarchy,isContainer:y.container??!1,hasPrePost:!1};const t=e.filter(e=>e?.searchKey?.startsWith(s+"/")&&e?.searchKey?.split("/").length===s?.split("/").length+1);r[a].hasPrePost=t.some(e=>"PRE"===e.entityType||"POST"===e.entityType)}}),r})(t,e?.searchKey),i=Object.values(y).find(t=>t.key===e.key);if(s.length>0){const e=s.filter(e=>"POST"!==e.entityType&&"PRE"!==e.entityType);return e.length>0?{navigateTo:i?.hasPrePost?e[e.length-1]?.key:n}:{navigateTo:s[s.length-1]?.key}}return{navigateTo:e?.key}}{const n=((e,t)=>e.filter(e=>e.parentId===t.key&&"POST"!==e.entityType&&"PRE"!==e.entityType))(t,e);if(n.length>0){const e=n[n.length-1];if(!1===e?.expandedAll||!1===e?.expanded)return{navigateTo:e?.key};if(!0===e?.expandedAll||!0===e?.expanded){const n=r(t,e?.searchKey);return{navigateTo:n[n.length-1]?.key}}}}return{navigateTo:e?.key}};export{e as getNavigateToKey};

package/lib/utils/autoScrollToTableLastRow/autoScrollToTableLastRow.js

@@ -1,19 +1 @@
-export const autoScrollToTableLastRow = (tableRef, extraCustomHeight) => {
-    let observer;
-    if (tableRef.current) {
-        const tableCurrent = tableRef.current;
-        observer = new MutationObserver(() => {
-            const requiredScrollHeight = tableCurrent.scrollHeight;
-            tableCurrent.scrollTop = requiredScrollHeight + (extraCustomHeight || 0);
-        });
-        observer.observe(tableCurrent, { childList: true, subtree: true });
-        const requiredScrollHeight = tableCurrent.scrollHeight;
-        tableCurrent.scrollTop = requiredScrollHeight;
-    }
-    return () => {
-        if (observer) {
-            observer.disconnect();
-        }
-    };
-};
-//# sourceMappingURL=autoScrollToTableLastRow.js.map
+const t=(t,e)=>{let r;if(t.current){const o=t.current;r=new MutationObserver(()=>{const t=o.scrollHeight;o.scrollTop=t+(e||0)}),r.observe(o,{childList:!0,subtree:!0});const c=o.scrollHeight;o.scrollTop=c}return()=>{r&&r.disconnect()}};export{t as autoScrollToTableLastRow};

package/lib/utils/capitalize/capitalize.js

@@ -1,6 +1 @@
-export const capitalize = (text) => {
-    if (!text)
-        return '';
-    return text.charAt(0)?.toUpperCase() + text?.slice(1)?.toLowerCase();
-};
-//# sourceMappingURL=capitalize.js.map
+const e=e=>e?e.charAt(0)?.toUpperCase()+e?.slice(1)?.toLowerCase():"";export{e as capitalize};

package/lib/utils/checkDuplicates/checkDuplicates.js

@@ -1,13 +1 @@
-// Will be used to find duplicate key-value pair in an array of objects.
-export const hasDuplicateFile = (array, property) => {
-    const seen = new Set();
-    for (const obj of array) {
-        const key = property ? obj[property] : JSON.stringify(obj);
-        if (seen.has(key)) {
-            return true;
-        }
-        seen.add(key);
-    }
-    return false;
-};
-//# sourceMappingURL=checkDuplicates.js.map
+const t=(t,n)=>{const o=new Set;for(const r of t){const t=n?r[n]:JSON.stringify(r);if(o.has(t))return!0;o.add(t)}return!1};export{t as hasDuplicateFile};

package/lib/utils/checkEmpty/checkEmpty.js

@@ -1,22 +1 @@
-export const checkEmpty = (value) => {
-    // Check for null or undefined
-    if (value == null)
-        return true;
-    // Check for strings
-    if (typeof value === 'string')
-        return value.trim().length === 0;
-    // Check for arrays
-    if (Array.isArray(value))
-        return value.length === 0;
-    // Check for objects
-    if (typeof value === 'object') {
-        // Handle Map and Set
-        if (value instanceof Map || value instanceof Set)
-            return value.size === 0;
-        // Handle regular objects
-        return Object.keys(value).length === 0;
-    }
-    // For all other types (numbers, booleans, etc.), return false as they are not "empty"
-    return false;
-};
-//# sourceMappingURL=checkEmpty.js.map
+const t=t=>null==t||("string"==typeof t?0===t.trim().length:Array.isArray(t)?0===t.length:"object"==typeof t&&(t instanceof Map||t instanceof Set?0===t.size:0===Object.keys(t).length));export{t as checkEmpty};

package/lib/utils/checkMicrophoneAccess/checkMicrophoneAccess.js

@@ -1,32 +1 @@
-import { toast } from '../../components/Toastify/Toastify';
-export const checkMicrophoneAccess = async (handleMicToggle, { requestDeniedMsg, notSupportedMsg, micAccessDeniedMsg, }) => {
-    try {
-        const permissionStatus = await navigator?.permissions.query({
-            name: 'microphone',
-        });
-        if (permissionStatus?.state === 'granted') {
-            handleMicToggle();
-        }
-        else if (permissionStatus?.state === 'prompt') {
-            try {
-                const stream = await navigator?.mediaDevices?.getUserMedia({
-                    audio: true,
-                });
-                stream?.getTracks()?.forEach((track) => track?.stop());
-                handleMicToggle();
-            }
-            catch (err) {
-                toast.error(requestDeniedMsg);
-                console.error('getUserMedia error:', err);
-            }
-        }
-        else if (permissionStatus?.state === 'denied') {
-            toast.error(micAccessDeniedMsg);
-        }
-    }
-    catch (err) {
-        toast.error(notSupportedMsg);
-        console.error('Permission query error:', err);
-    }
-};
-//# sourceMappingURL=checkMicrophoneAccess.js.map
+import{toast as e}from"../../components/Toastify/Toastify.js";const r=async(r,{requestDeniedMsg:o,notSupportedMsg:s,micAccessDeniedMsg:t})=>{try{const s=await(navigator?.permissions.query({name:"microphone"}));if("granted"===s?.state)r();else if("prompt"===s?.state)try{const e=await(navigator?.mediaDevices?.getUserMedia({audio:!0}));e?.getTracks()?.forEach(e=>e?.stop()),r()}catch(r){e.error(o),console.error("getUserMedia error:",r)}else"denied"===s?.state&&e.error(t)}catch(r){e.error(s),console.error("Permission query error:",r)}};export{r as checkMicrophoneAccess};

package/lib/utils/compareArrays/compareArrays.js

@@ -1,25 +1 @@
-import { compareObjects } from '../compareObjects/compareObjects';
-/**
- * Compare two arrays for equality.
- * This function checks if both arrays contain the same elements in the same order,
- * including nested structures.
- *
- * @param arr1 - The first array to compare.
- * @param arr2 - The second array to compare.
- * @returns - A boolean indicating if the arrays are equal.
- */
-export const compareArrays = (arr1, arr2) => {
-    // Check if both are arrays
-    if (!Array.isArray(arr1) || !Array.isArray(arr2))
-        return false;
-    // Check if lengths are different
-    if (arr1.length !== arr2.length)
-        return false;
-    // Compare each element
-    return arr1.every((element, index) => {
-        const otherElement = arr2[index];
-        // Recursively compare objects or arrays, or check for strict equality
-        return compareObjects(element, otherElement);
-    });
-};
-//# sourceMappingURL=compareArrays.js.map
+import{compareObjects as r}from"../compareObjects/compareObjects.js";const e=(e,t)=>!(!Array.isArray(e)||!Array.isArray(t))&&(e.length===t.length&&e.every((e,o)=>{const s=t[o];return r(e,s)}));export{e as compareArrays};

package/lib/utils/compareObjects/compareObjects.js

@@ -1,41 +1 @@
-export const compareObjects = (obj1, obj2) => {
-    // Check if both are strictly equal (handles primitive types and same reference)
-    if (obj1 === obj2)
-        return true;
-    // Check if either is null or not an object
-    if (obj1 == null ||
-        obj2 == null ||
-        typeof obj1 !== 'object' ||
-        typeof obj2 !== 'object') {
-        return false;
-    }
-    // Handle Date comparison
-    if (obj1 instanceof Date && obj2 instanceof Date) {
-        return obj1.getTime() === obj2.getTime();
-    }
-    // Handle array comparison
-    const isArray1 = Array.isArray(obj1);
-    const isArray2 = Array.isArray(obj2);
-    if (isArray1 !== isArray2)
-        return false; // One is an array, the other is not
-    // Create arrays of keys for both objects
-    const keys1 = isArray1 ? obj1 : Object.keys(obj1);
-    const keys2 = isArray2 ? obj2 : Object.keys(obj2);
-    // Check if the number of keys is different
-    if (keys1.length !== keys2.length)
-        return false;
-    // Create a Set for keys2 for O(1) lookups (only for objects)
-    if (!isArray1) {
-        const keysSet2 = new Set(keys2);
-        // Check each key and value
-        return keys1.every((key) => {
-            return (keysSet2.has(key) &&
-                compareObjects(obj1[key], obj2[key]));
-        });
-    }
-    else {
-        // If arrays, compare elements directly
-        return keys1.every((item, index) => compareObjects(item, keys2[index]));
-    }
-};
-//# sourceMappingURL=compareObjects.js.map
+const e=(t,r)=>{if(t===r)return!0;if(null==t||null==r||"object"!=typeof t||"object"!=typeof r)return!1;if(t instanceof Date&&r instanceof Date)return t.getTime()===r.getTime();const n=Array.isArray(t),i=Array.isArray(r);if(n!==i)return!1;const o=n?t:Object.keys(t),s=i?r:Object.keys(r);if(o.length!==s.length)return!1;if(n)return o.every((t,r)=>e(t,s[r]));{const n=new Set(s);return o.every(i=>n.has(i)&&e(t[i],r[i]))}};export{e as compareObjects};

package/lib/utils/converToCamelCase.js

@@ -1,6 +1 @@
-export const convertToCamelCase = (statusKey = '') => statusKey
-    .replace(/([a-z])([A-Z])/g, '$1 $2')
-    .replace(/[_-]+/g, ' ')
-    .toLowerCase()
-    .replace(/\b\w/g, (c) => c.toUpperCase());
-//# sourceMappingURL=converToCamelCase.js.map
+const e=(e="")=>e.replace(/([a-z])([A-Z])/g,"$1 $2").replace(/[_-]+/g," ").toLowerCase().replace(/\b\w/g,e=>e.toUpperCase());export{e as convertToCamelCase};

package/lib/utils/convertToBytes/convertToBytes.js

@@ -1,18 +1 @@
-export const convertToBytes = (value) => {
-    const lower = value.toLowerCase().trim();
-    const num = parseFloat(lower);
-    const unit = lower.replace(/[0-9.]/g, '').trim(); // Extract the unit from the string
-    switch (unit) {
-        case 'gb':
-            return num * 1024 * 1024 * 1024;
-        case 'mb':
-            return num * 1024 * 1024;
-        case 'kb':
-            return num * 1024;
-        case 'b':
-            return num;
-        default:
-            return num;
-    }
-};
-//# sourceMappingURL=convertToBytes.js.map
+const e=e=>{const r=e.toLowerCase().trim(),t=parseFloat(r);switch(r.replace(/[0-9.]/g,"").trim()){case"gb":return 1024*t*1024*1024;case"mb":return 1024*t*1024;case"kb":return 1024*t;default:return t}};export{e as convertToBytes};

package/lib/utils/convertToGB/convertToGB.js

@@ -1,18 +1 @@
-export const convertToGB = (value) => {
-    const lower = value.toLowerCase().trim();
-    const num = parseFloat(lower);
-    const unit = lower.replace(/[0-9.]/g, '').trim(); // Extract the unit from the string
-    switch (unit) {
-        case 'gb':
-            return num;
-        case 'mb':
-            return num / 1024;
-        case 'kb':
-            return num / (1024 * 1024);
-        case 'b':
-            return num / (1024 * 1024 * 1024);
-        default:
-            return num;
-    }
-};
-//# sourceMappingURL=convertToGB.js.map
+const e=e=>{const r=e.toLowerCase().trim(),t=parseFloat(r);switch(r.replace(/[0-9.]/g,"").trim()){case"gb":default:return t;case"mb":return t/1024;case"kb":return t/1048576;case"b":return t/1073741824}};export{e as convertToGB};

package/lib/utils/convertToISO/convertToISO.js

@@ -1,19 +1 @@
-export const convertToISO = (dateString) => {
-    let date;
-    if (dateString.includes('T')) {
-        date = new Date(dateString);
-    }
-    else {
-        const [datePart, timePart] = dateString.split(' ');
-        if (!datePart || !timePart) {
-            throw new Error("Invalid input format. Expected 'DD-MM-YYYY HH:mm'");
-        }
-        const [day, month, year] = datePart.split('-');
-        const [hours, minutes] = timePart.split(':');
-        date = new Date(parseInt(year || '', 10), parseInt(month || '', 10) - 1, parseInt(day || '', 10), parseInt(hours || '', 10), parseInt(minutes || '', 10));
-    }
-    const formattedDate = `${date.getFullYear()}-${('0' + (date.getMonth() + 1)).slice(-2)}-${('0' + date.getDate()).slice(-2)}`;
-    const formattedTime = `${('0' + date.getHours()).slice(-2)}:${('0' + date.getMinutes()).slice(-2)}:00`;
-    return new Date(`${formattedDate}T${formattedTime}`);
-};
-//# sourceMappingURL=convertToISO.js.map
+const e=e=>{let t;if(e.includes("T"))t=new Date(e);else{const[s,n]=e.split(" ");if(!s||!n)throw new Error("Invalid input format. Expected 'DD-MM-YYYY HH:mm'");const[r,i,l]=s.split("-"),[a,p]=n.split(":");t=new Date(parseInt(l||"",10),parseInt(i||"",10)-1,parseInt(r||"",10),parseInt(a||"",10),parseInt(p||"",10))}const s=`${t.getFullYear()}-${("0"+(t.getMonth()+1)).slice(-2)}-${("0"+t.getDate()).slice(-2)}`,n=`${("0"+t.getHours()).slice(-2)}:${("0"+t.getMinutes()).slice(-2)}:00`;return new Date(`${s}T${n}`)};export{e as convertToISO};

package/lib/utils/convertToKB/convertToKB.js

@@ -1,20 +1 @@
-export const convertToKB = (value) => {
-    const lower = value.toLowerCase().trim();
-    const num = parseFloat(lower);
-    const unit = lower.replace(/[0-9.]/g, '').trim();
-    switch (unit) {
-        case 'kb':
-            return num;
-        case 'mb':
-            return num * 1024;
-        case 'gb':
-            return num * 1024 * 1024;
-        case 'tb':
-            return num * 1024 * 1024 * 1024;
-        case 'b':
-            return num / 1024;
-        default:
-            return num;
-    }
-};
-//# sourceMappingURL=convertToKB.js.map
+const e=e=>{const r=e.toLowerCase().trim(),t=parseFloat(r);switch(r.replace(/[0-9.]/g,"").trim()){case"kb":default:return t;case"mb":return 1024*t;case"gb":return 1024*t*1024;case"tb":return 1024*t*1024*1024;case"b":return t/1024}};export{e as convertToKB};

package/lib/utils/convertToMB/convertToMB.js

@@ -1,20 +1 @@
-export const convertToMB = (value) => {
-    const lower = value.toLowerCase().trim();
-    const num = parseFloat(lower);
-    const unit = lower.replace(/[0-9.]/g, '').trim();
-    switch (unit) {
-        case 'mb':
-            return num;
-        case 'gb':
-            return num * 1024;
-        case 'tb':
-            return num * 1024 * 1024;
-        case 'kb':
-            return num / 1024;
-        case 'b':
-            return num / (1024 * 1024);
-        default:
-            return num;
-    }
-};
-//# sourceMappingURL=convertToMB.js.map
+const e=e=>{const r=e.toLowerCase().trim(),t=parseFloat(r);switch(r.replace(/[0-9.]/g,"").trim()){case"mb":default:return t;case"gb":return 1024*t;case"tb":return 1024*t*1024;case"kb":return t/1024;case"b":return t/1048576}};export{e as convertToMB};

package/lib/utils/convertToTB/convertToTB.js

@@ -1,20 +1 @@
-export const convertToTB = (value) => {
-    const lower = value.toLowerCase().trim();
-    const num = parseFloat(lower);
-    const unit = lower.replace(/[0-9.]/g, '').trim();
-    switch (unit) {
-        case 'tb':
-            return num;
-        case 'gb':
-            return num / 1024;
-        case 'mb':
-            return num / (1024 * 1024);
-        case 'kb':
-            return num / (1024 * 1024 * 1024);
-        case 'b':
-            return num / (1024 * 1024 * 1024 * 1024);
-        default:
-            return num;
-    }
-};
-//# sourceMappingURL=convertToTB.js.map
+const e=e=>{const r=e.toLowerCase().trim(),t=parseFloat(r);switch(r.replace(/[0-9.]/g,"").trim()){case"tb":default:return t;case"gb":return t/1024;case"mb":return t/1048576;case"kb":return t/1073741824;case"b":return t/1099511627776}};export{e as convertToTB};