@babylonjs/viewer 7.42.0 → 7.43.0

package/dist/chunks/mesh.vertexData.functions-B_pMCAzZ.esm.js

@@ -0,0 +1,119 @@
+function getByteIndex(bitIndex) {
+    return Math.floor(bitIndex / 8);
+}
+function getBitMask(bitIndex) {
+    return 1 << bitIndex % 8;
+}
+/**
+ * An fixed size array that effectively stores boolean values where each value is a single bit of backing data.
+ * @remarks
+ * All bits are initialized to false.
+ */
+class BitArray {
+    /**
+     * Creates a new bit array with a fixed size.
+     * @param size The number of bits to store.
+     */
+    constructor(size) {
+        this.size = size;
+        this._byteArray = new Uint8Array(Math.ceil(this.size / 8));
+    }
+    /**
+     * Gets the current value at the specified index.
+     * @param bitIndex The index to get the value from.
+     * @returns The value at the specified index.
+     */
+    get(bitIndex) {
+        if (bitIndex >= this.size) {
+            throw new RangeError("Bit index out of range");
+        }
+        const byteIndex = getByteIndex(bitIndex);
+        const bitMask = getBitMask(bitIndex);
+        return (this._byteArray[byteIndex] & bitMask) !== 0;
+    }
+    /**
+     * Sets the value at the specified index.
+     * @param bitIndex The index to set the value at.
+     * @param value The value to set.
+     */
+    set(bitIndex, value) {
+        if (bitIndex >= this.size) {
+            throw new RangeError("Bit index out of range");
+        }
+        const byteIndex = getByteIndex(bitIndex);
+        const bitMask = getBitMask(bitIndex);
+        if (value) {
+            this._byteArray[byteIndex] |= bitMask;
+        }
+        else {
+            this._byteArray[byteIndex] &= ~bitMask;
+        }
+    }
+}
+
+/**
+ * Sort (in place) the index array so that faces with common indices are close
+ * @param indices the array of indices to sort
+ */
+function OptimizeIndices(indices) {
+    const faces = [];
+    const faceCount = indices.length / 3;
+    // Step 1: Break the indices array into faces
+    for (let i = 0; i < faceCount; i++) {
+        faces.push([indices[i * 3], indices[i * 3 + 1], indices[i * 3 + 2]]);
+    }
+    // Step 2: Build a graph connecting faces sharing a vertex
+    const vertexToFaceMap = new Map();
+    faces.forEach((face, faceIndex) => {
+        face.forEach((vertex) => {
+            let face = vertexToFaceMap.get(vertex);
+            if (!face) {
+                vertexToFaceMap.set(vertex, (face = []));
+            }
+            face.push(faceIndex);
+        });
+    });
+    // Step 3: Traverse faces using DFS to ensure connected faces are close
+    const visited = new BitArray(faceCount);
+    const sortedFaces = [];
+    // Using a stack and not a recursive version to avoid call stack overflow
+    const deepFirstSearchStack = (startFaceIndex) => {
+        const stack = [startFaceIndex];
+        while (stack.length > 0) {
+            const currentFaceIndex = stack.pop();
+            if (visited.get(currentFaceIndex)) {
+                continue;
+            }
+            visited.set(currentFaceIndex, true);
+            sortedFaces.push(faces[currentFaceIndex]);
+            // Push unvisited neighbors (faces sharing a vertex) onto the stack
+            faces[currentFaceIndex].forEach((vertex) => {
+                const neighbors = vertexToFaceMap.get(vertex);
+                if (!neighbors) {
+                    return;
+                }
+                neighbors.forEach((neighborFaceIndex) => {
+                    if (!visited.get(neighborFaceIndex)) {
+                        stack.push(neighborFaceIndex);
+                    }
+                });
+            });
+        }
+    };
+    // Start DFS from the first face
+    for (let i = 0; i < faceCount; i++) {
+        if (!visited.get(i)) {
+            deepFirstSearchStack(i);
+        }
+    }
+    // Step 4: Flatten the sorted faces back into an array
+    let index = 0;
+    sortedFaces.forEach((face) => {
+        indices[index++] = face[0];
+        indices[index++] = face[1];
+        indices[index++] = face[2];
+    });
+}
+
+export { OptimizeIndices };
+//# sourceMappingURL=mesh.vertexData.functions-B_pMCAzZ.esm.js.map

package/dist/chunks/mesh.vertexData.functions-B_pMCAzZ.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh.vertexData.functions-B_pMCAzZ.esm.js","sources":["../../../../../dev/core/dist/Misc/bitArray.js","../../../../../dev/core/dist/Meshes/mesh.vertexData.functions.js"],"sourcesContent":["function getByteIndex(bitIndex) {\n    return Math.floor(bitIndex / 8);\n}\nfunction getBitMask(bitIndex) {\n    return 1 << bitIndex % 8;\n}\n/**\n * An fixed size array that effectively stores boolean values where each value is a single bit of backing data.\n * @remarks\n * All bits are initialized to false.\n */\nexport class BitArray {\n    /**\n     * Creates a new bit array with a fixed size.\n     * @param size The number of bits to store.\n     */\n    constructor(size) {\n        this.size = size;\n        this._byteArray = new Uint8Array(Math.ceil(this.size / 8));\n    }\n    /**\n     * Gets the current value at the specified index.\n     * @param bitIndex The index to get the value from.\n     * @returns The value at the specified index.\n     */\n    get(bitIndex) {\n        if (bitIndex >= this.size) {\n            throw new RangeError(\"Bit index out of range\");\n        }\n        const byteIndex = getByteIndex(bitIndex);\n        const bitMask = getBitMask(bitIndex);\n        return (this._byteArray[byteIndex] & bitMask) !== 0;\n    }\n    /**\n     * Sets the value at the specified index.\n     * @param bitIndex The index to set the value at.\n     * @param value The value to set.\n     */\n    set(bitIndex, value) {\n        if (bitIndex >= this.size) {\n            throw new RangeError(\"Bit index out of range\");\n        }\n        const byteIndex = getByteIndex(bitIndex);\n        const bitMask = getBitMask(bitIndex);\n        if (value) {\n            this._byteArray[byteIndex] |= bitMask;\n        }\n        else {\n            this._byteArray[byteIndex] &= ~bitMask;\n        }\n    }\n}\n//# sourceMappingURL=bitArray.js.map","import { BitArray } from \"core/Misc/bitArray\";\n/**\n * Sort (in place) the index array so that faces with common indices are close\n * @param indices the array of indices to sort\n */\nexport function OptimizeIndices(indices) {\n    const faces = [];\n    const faceCount = indices.length / 3;\n    // Step 1: Break the indices array into faces\n    for (let i = 0; i < faceCount; i++) {\n        faces.push([indices[i * 3], indices[i * 3 + 1], indices[i * 3 + 2]]);\n    }\n    // Step 2: Build a graph connecting faces sharing a vertex\n    const vertexToFaceMap = new Map();\n    faces.forEach((face, faceIndex) => {\n        face.forEach((vertex) => {\n            let face = vertexToFaceMap.get(vertex);\n            if (!face) {\n                vertexToFaceMap.set(vertex, (face = []));\n            }\n            face.push(faceIndex);\n        });\n    });\n    // Step 3: Traverse faces using DFS to ensure connected faces are close\n    const visited = new BitArray(faceCount);\n    const sortedFaces = [];\n    // Using a stack and not a recursive version to avoid call stack overflow\n    const deepFirstSearchStack = (startFaceIndex) => {\n        const stack = [startFaceIndex];\n        while (stack.length > 0) {\n            const currentFaceIndex = stack.pop();\n            if (visited.get(currentFaceIndex)) {\n                continue;\n            }\n            visited.set(currentFaceIndex, true);\n            sortedFaces.push(faces[currentFaceIndex]);\n            // Push unvisited neighbors (faces sharing a vertex) onto the stack\n            faces[currentFaceIndex].forEach((vertex) => {\n                const neighbors = vertexToFaceMap.get(vertex);\n                if (!neighbors) {\n                    return;\n                }\n                neighbors.forEach((neighborFaceIndex) => {\n                    if (!visited.get(neighborFaceIndex)) {\n                        stack.push(neighborFaceIndex);\n                    }\n                });\n            });\n        }\n    };\n    // Start DFS from the first face\n    for (let i = 0; i < faceCount; i++) {\n        if (!visited.get(i)) {\n            deepFirstSearchStack(i);\n        }\n    }\n    // Step 4: Flatten the sorted faces back into an array\n    let index = 0;\n    sortedFaces.forEach((face) => {\n        indices[index++] = face[0];\n        indices[index++] = face[1];\n        indices[index++] = face[2];\n    });\n}\n//# sourceMappingURL=mesh.vertexData.functions.js.map"],"names":[],"mappings":"AAAA,SAAS,YAAY,CAAC,QAAQ,EAAE;AAChC,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;AACnC;AACA,SAAS,UAAU,CAAC,QAAQ,EAAE;AAC9B,IAAI,OAAO,CAAC,IAAI,QAAQ,GAAG,CAAC;AAC5B;AACA;AACA;AACA;AACA;AACA;AACO,MAAM,QAAQ,CAAC;AACtB;AACA;AACA;AACA;AACA,IAAI,WAAW,CAAC,IAAI,EAAE;AACtB,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;AACxB,QAAQ,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAClE;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,GAAG,CAAC,QAAQ,EAAE;AAClB,QAAQ,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE;AACnC,YAAY,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC;AAC1D;AACA,QAAQ,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC;AAChD,QAAQ,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC;AAC5C,QAAQ,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,OAAO,MAAM,CAAC;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE;AACzB,QAAQ,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE;AACnC,YAAY,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC;AAC1D;AACA,QAAQ,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC;AAChD,QAAQ,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC;AAC5C,QAAQ,IAAI,KAAK,EAAE;AACnB,YAAY,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO;AACjD;AACA,aAAa;AACb,YAAY,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO;AAClD;AACA;AACA;;AClDA;AACA;AACA;AACA;AACO,SAAS,eAAe,CAAC,OAAO,EAAE;AACzC,IAAI,MAAM,KAAK,GAAG,EAAE;AACpB,IAAI,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;AACxC;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;AACxC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5E;AACA;AACA,IAAI,MAAM,eAAe,GAAG,IAAI,GAAG,EAAE;AACrC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,SAAS,KAAK;AACvC,QAAQ,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK;AACjC,YAAY,IAAI,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;AAClD,YAAY,IAAI,CAAC,IAAI,EAAE;AACvB,gBAAgB,eAAe,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,EAAE;AACxD;AACA,YAAY,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;AAChC,SAAS,CAAC;AACV,KAAK,CAAC;AACN;AACA,IAAI,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC;AAC3C,IAAI,MAAM,WAAW,GAAG,EAAE;AAC1B;AACA,IAAI,MAAM,oBAAoB,GAAG,CAAC,cAAc,KAAK;AACrD,QAAQ,MAAM,KAAK,GAAG,CAAC,cAAc,CAAC;AACtC,QAAQ,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACjC,YAAY,MAAM,gBAAgB,GAAG,KAAK,CAAC,GAAG,EAAE;AAChD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE;AAC/C,gBAAgB;AAChB;AACA,YAAY,OAAO,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC;AAC/C,YAAY,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;AACrD;AACA,YAAY,KAAK,CAAC,gBAAgB,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK;AACxD,gBAAgB,MAAM,SAAS,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;AAC7D,gBAAgB,IAAI,CAAC,SAAS,EAAE;AAChC,oBAAoB;AACpB;AACA,gBAAgB,SAAS,CAAC,OAAO,CAAC,CAAC,iBAAiB,KAAK;AACzD,oBAAoB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE;AACzD,wBAAwB,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC;AACrD;AACA,iBAAiB,CAAC;AAClB,aAAa,CAAC;AACd;AACA,KAAK;AACL;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;AACxC,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC7B,YAAY,oBAAoB,CAAC,CAAC,CAAC;AACnC;AACA;AACA;AACA,IAAI,IAAI,KAAK,GAAG,CAAC;AACjB,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AAClC,QAAQ,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAClC,QAAQ,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAClC,QAAQ,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAClC,KAAK,CAAC;AACN;;;;"}

package/dist/chunks/mesh.vertexData.functions-Bo7e6Of9.esm.min.js

@@ -0,0 +1,2 @@
+function t(t){return Math.floor(t/8)}function e(t){return 1<<t%8}class r{constructor(t){this.size=t,this._byteArray=new Uint8Array(Math.ceil(this.size/8))}get(r){if(r>=this.size)throw new RangeError("Bit index out of range");const o=t(r),n=e(r);return!!(this._byteArray[o]&n)}set(r,o){if(r>=this.size)throw new RangeError("Bit index out of range");const n=t(r),s=e(r);o?this._byteArray[n]|=s:this._byteArray[n]&=~s}}function o(t){const e=[],o=t.length/3;for(let r=0;r<o;r++)e.push([t[3*r],t[3*r+1],t[3*r+2]]);const n=new Map;e.forEach(((t,e)=>{t.forEach((t=>{let r=n.get(t);r||n.set(t,r=[]),r.push(e)}))}));const s=new r(o),h=[],i=t=>{const r=[t];for(;r.length>0;){const t=r.pop();s.get(t)||(s.set(t,!0),h.push(e[t]),e[t].forEach((t=>{const e=n.get(t);e&&e.forEach((t=>{s.get(t)||r.push(t)}))})))}};for(let t=0;t<o;t++)s.get(t)||i(t);let c=0;h.forEach((e=>{t[c++]=e[0],t[c++]=e[1],t[c++]=e[2]}))}export{o as OptimizeIndices};
+//# sourceMappingURL=mesh.vertexData.functions-Bo7e6Of9.esm.min.js.map

package/dist/chunks/mesh.vertexData.functions-Bo7e6Of9.esm.min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh.vertexData.functions-Bo7e6Of9.esm.min.js","sources":["../../../../../dev/core/dist/Misc/bitArray.js","../../../../../dev/core/dist/Meshes/mesh.vertexData.functions.js"],"sourcesContent":["function getByteIndex(bitIndex) {\n    return Math.floor(bitIndex / 8);\n}\nfunction getBitMask(bitIndex) {\n    return 1 << bitIndex % 8;\n}\n/**\n * An fixed size array that effectively stores boolean values where each value is a single bit of backing data.\n * @remarks\n * All bits are initialized to false.\n */\nexport class BitArray {\n    /**\n     * Creates a new bit array with a fixed size.\n     * @param size The number of bits to store.\n     */\n    constructor(size) {\n        this.size = size;\n        this._byteArray = new Uint8Array(Math.ceil(this.size / 8));\n    }\n    /**\n     * Gets the current value at the specified index.\n     * @param bitIndex The index to get the value from.\n     * @returns The value at the specified index.\n     */\n    get(bitIndex) {\n        if (bitIndex >= this.size) {\n            throw new RangeError(\"Bit index out of range\");\n        }\n        const byteIndex = getByteIndex(bitIndex);\n        const bitMask = getBitMask(bitIndex);\n        return (this._byteArray[byteIndex] & bitMask) !== 0;\n    }\n    /**\n     * Sets the value at the specified index.\n     * @param bitIndex The index to set the value at.\n     * @param value The value to set.\n     */\n    set(bitIndex, value) {\n        if (bitIndex >= this.size) {\n            throw new RangeError(\"Bit index out of range\");\n        }\n        const byteIndex = getByteIndex(bitIndex);\n        const bitMask = getBitMask(bitIndex);\n        if (value) {\n            this._byteArray[byteIndex] |= bitMask;\n        }\n        else {\n            this._byteArray[byteIndex] &= ~bitMask;\n        }\n    }\n}\n//# sourceMappingURL=bitArray.js.map","import { BitArray } from \"core/Misc/bitArray\";\n/**\n * Sort (in place) the index array so that faces with common indices are close\n * @param indices the array of indices to sort\n */\nexport function OptimizeIndices(indices) {\n    const faces = [];\n    const faceCount = indices.length / 3;\n    // Step 1: Break the indices array into faces\n    for (let i = 0; i < faceCount; i++) {\n        faces.push([indices[i * 3], indices[i * 3 + 1], indices[i * 3 + 2]]);\n    }\n    // Step 2: Build a graph connecting faces sharing a vertex\n    const vertexToFaceMap = new Map();\n    faces.forEach((face, faceIndex) => {\n        face.forEach((vertex) => {\n            let face = vertexToFaceMap.get(vertex);\n            if (!face) {\n                vertexToFaceMap.set(vertex, (face = []));\n            }\n            face.push(faceIndex);\n        });\n    });\n    // Step 3: Traverse faces using DFS to ensure connected faces are close\n    const visited = new BitArray(faceCount);\n    const sortedFaces = [];\n    // Using a stack and not a recursive version to avoid call stack overflow\n    const deepFirstSearchStack = (startFaceIndex) => {\n        const stack = [startFaceIndex];\n        while (stack.length > 0) {\n            const currentFaceIndex = stack.pop();\n            if (visited.get(currentFaceIndex)) {\n                continue;\n            }\n            visited.set(currentFaceIndex, true);\n            sortedFaces.push(faces[currentFaceIndex]);\n            // Push unvisited neighbors (faces sharing a vertex) onto the stack\n            faces[currentFaceIndex].forEach((vertex) => {\n                const neighbors = vertexToFaceMap.get(vertex);\n                if (!neighbors) {\n                    return;\n                }\n                neighbors.forEach((neighborFaceIndex) => {\n                    if (!visited.get(neighborFaceIndex)) {\n                        stack.push(neighborFaceIndex);\n                    }\n                });\n            });\n        }\n    };\n    // Start DFS from the first face\n    for (let i = 0; i < faceCount; i++) {\n        if (!visited.get(i)) {\n            deepFirstSearchStack(i);\n        }\n    }\n    // Step 4: Flatten the sorted faces back into an array\n    let index = 0;\n    sortedFaces.forEach((face) => {\n        indices[index++] = face[0];\n        indices[index++] = face[1];\n        indices[index++] = face[2];\n    });\n}\n//# sourceMappingURL=mesh.vertexData.functions.js.map"],"names":["getByteIndex","bitIndex","Math","floor","getBitMask","BitArray","constructor","size","this","_byteArray","Uint8Array","ceil","get","RangeError","byteIndex","bitMask","set","value","OptimizeIndices","indices","faces","faceCount","length","i","push","vertexToFaceMap","Map","forEach","face","faceIndex","vertex","visited","sortedFaces","deepFirstSearchStack","startFaceIndex","stack","currentFaceIndex","pop","neighbors","neighborFaceIndex","index"],"mappings":"AAAA,SAASA,EAAaC,GAClB,OAAOC,KAAKC,MAAMF,EAAW,EACjC,CACA,SAASG,EAAWH,GAChB,OAAO,GAAKA,EAAW,CAC3B,CAMO,MAAMI,EAKT,WAAAC,CAAYC,GACRC,KAAKD,KAAOA,EACZC,KAAKC,WAAa,IAAIC,WAAWR,KAAKS,KAAKH,KAAKD,KAAO,GAC/D,CAMI,GAAAK,CAAIX,GACA,GAAIA,GAAYO,KAAKD,KACjB,MAAM,IAAIM,WAAW,0BAEzB,MAAMC,EAAYd,EAAaC,GACzBc,EAAUX,EAAWH,GAC3B,SAAQO,KAAKC,WAAWK,GAAaC,EAC7C,CAMI,GAAAC,CAAIf,EAAUgB,GACV,GAAIhB,GAAYO,KAAKD,KACjB,MAAM,IAAIM,WAAW,0BAEzB,MAAMC,EAAYd,EAAaC,GACzBc,EAAUX,EAAWH,GACvBgB,EACAT,KAAKC,WAAWK,IAAcC,EAG9BP,KAAKC,WAAWK,KAAeC,CAE3C,EC7CO,SAASG,EAAgBC,GAC5B,MAAMC,EAAQ,GACRC,EAAYF,EAAQG,OAAS,EAEnC,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAWE,IAC3BH,EAAMI,KAAK,CAACL,EAAY,EAAJI,GAAQJ,EAAY,EAAJI,EAAQ,GAAIJ,EAAY,EAAJI,EAAQ,KAGpE,MAAME,EAAkB,IAAIC,IAC5BN,EAAMO,SAAQ,CAACC,EAAMC,KACjBD,EAAKD,SAASG,IACV,IAAIF,EAAOH,EAAgBb,IAAIkB,GAC1BF,GACDH,EAAgBT,IAAIc,EAASF,EAAO,IAExCA,EAAKJ,KAAKK,EAAU,GACtB,IAGN,MAAME,EAAU,IAAI1B,EAASgB,GACvBW,EAAc,GAEdC,EAAwBC,IAC1B,MAAMC,EAAQ,CAACD,GACf,KAAOC,EAAMb,OAAS,GAAG,CACrB,MAAMc,EAAmBD,EAAME,MAC3BN,EAAQnB,IAAIwB,KAGhBL,EAAQf,IAAIoB,GAAkB,GAC9BJ,EAAYR,KAAKJ,EAAMgB,IAEvBhB,EAAMgB,GAAkBT,SAASG,IAC7B,MAAMQ,EAAYb,EAAgBb,IAAIkB,GACjCQ,GAGLA,EAAUX,SAASY,IACVR,EAAQnB,IAAI2B,IACbJ,EAAMX,KAAKe,EACnC,GACkB,IAElB,GAGI,IAAK,IAAIhB,EAAI,EAAGA,EAAIF,EAAWE,IACtBQ,EAAQnB,IAAIW,IACbU,EAAqBV,GAI7B,IAAIiB,EAAQ,EACZR,EAAYL,SAASC,IACjBT,EAAQqB,KAAWZ,EAAK,GACxBT,EAAQqB,KAAWZ,EAAK,GACxBT,EAAQqB,KAAWZ,EAAK,EAAE,GAElC"}

package/dist/chunks/meshUboDeclaration-BH4HWAOu.esm.min.js

@@ -0,0 +1,2 @@
+import{i as e}from"./index-dIbBUsdh.esm.min.js";e.IncludesShadersStoreWGSL.sceneUboDeclaration="struct Scene {viewProjection : mat4x4<f32>,\n#ifdef MULTIVIEW\nviewProjectionR : mat4x4<f32>,\n#endif \nview : mat4x4<f32>,\nprojection : mat4x4<f32>,\nvEyePosition : vec4<f32>,};\n#define SCENE_UBO\nvar<uniform> scene : Scene;\n";e.IncludesShadersStoreWGSL.meshUboDeclaration="struct Mesh {world : mat4x4<f32>,\nvisibility : f32,};var<uniform> mesh : Mesh;\n#define WORLD_UBO\n";
+//# sourceMappingURL=meshUboDeclaration-BH4HWAOu.esm.min.js.map

package/dist/chunks/meshUboDeclaration-BH4HWAOu.esm.min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"meshUboDeclaration-BH4HWAOu.esm.min.js","sources":["../../../../../dev/core/dist/ShadersWGSL/ShadersInclude/sceneUboDeclaration.js","../../../../../dev/core/dist/ShadersWGSL/ShadersInclude/meshUboDeclaration.js"],"sourcesContent":["// Do not edit.\nimport { ShaderStore } from \"../../Engines/shaderStore\";\nconst name = \"sceneUboDeclaration\";\nconst shader = `struct Scene {viewProjection : mat4x4<f32>,\n#ifdef MULTIVIEW\nviewProjectionR : mat4x4<f32>,\n#endif \nview : mat4x4<f32>,\nprojection : mat4x4<f32>,\nvEyePosition : vec4<f32>,};\n#define SCENE_UBO\nvar<uniform> scene : Scene;\n`;\n// Sideeffect\nShaderStore.IncludesShadersStoreWGSL[name] = shader;\n/** @internal */\nexport const sceneUboDeclarationWGSL = { name, shader };\n//# sourceMappingURL=sceneUboDeclaration.js.map","// Do not edit.\nimport { ShaderStore } from \"../../Engines/shaderStore\";\nconst name = \"meshUboDeclaration\";\nconst shader = `struct Mesh {world : mat4x4<f32>,\nvisibility : f32,};var<uniform> mesh : Mesh;\n#define WORLD_UBO\n`;\n// Sideeffect\nShaderStore.IncludesShadersStoreWGSL[name] = shader;\n/** @internal */\nexport const meshUboDeclarationWGSL = { name, shader };\n//# sourceMappingURL=meshUboDeclaration.js.map"],"names":["ShaderStore","IncludesShadersStoreWGSL"],"mappings":"gDAcAA,EAAYC,yBAA6B,oBAX1B,wOCKfD,EAAYC,yBAA6B,mBAL1B"}

package/dist/chunks/meshUboDeclaration-Cas60IPQ.esm.js

@@ -0,0 +1,26 @@
+import { i as ShaderStore } from './index-CGxy146H.esm.js';
+
+// Do not edit.
+const name$1 = "sceneUboDeclaration";
+const shader$1 = `struct Scene {viewProjection : mat4x4<f32>,
+#ifdef MULTIVIEW
+viewProjectionR : mat4x4<f32>,
+#endif 
+view : mat4x4<f32>,
+projection : mat4x4<f32>,
+vEyePosition : vec4<f32>,};
+#define SCENE_UBO
+var<uniform> scene : Scene;
+`;
+// Sideeffect
+ShaderStore.IncludesShadersStoreWGSL[name$1] = shader$1;
+
+// Do not edit.
+const name = "meshUboDeclaration";
+const shader = `struct Mesh {world : mat4x4<f32>,
+visibility : f32,};var<uniform> mesh : Mesh;
+#define WORLD_UBO
+`;
+// Sideeffect
+ShaderStore.IncludesShadersStoreWGSL[name] = shader;
+//# sourceMappingURL=meshUboDeclaration-Cas60IPQ.esm.js.map

package/dist/chunks/meshUboDeclaration-Cas60IPQ.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"meshUboDeclaration-Cas60IPQ.esm.js","sources":["../../../../../dev/core/dist/ShadersWGSL/ShadersInclude/sceneUboDeclaration.js","../../../../../dev/core/dist/ShadersWGSL/ShadersInclude/meshUboDeclaration.js"],"sourcesContent":["// Do not edit.\nimport { ShaderStore } from \"../../Engines/shaderStore\";\nconst name = \"sceneUboDeclaration\";\nconst shader = `struct Scene {viewProjection : mat4x4<f32>,\n#ifdef MULTIVIEW\nviewProjectionR : mat4x4<f32>,\n#endif \nview : mat4x4<f32>,\nprojection : mat4x4<f32>,\nvEyePosition : vec4<f32>,};\n#define SCENE_UBO\nvar<uniform> scene : Scene;\n`;\n// Sideeffect\nShaderStore.IncludesShadersStoreWGSL[name] = shader;\n/** @internal */\nexport const sceneUboDeclarationWGSL = { name, shader };\n//# sourceMappingURL=sceneUboDeclaration.js.map","// Do not edit.\nimport { ShaderStore } from \"../../Engines/shaderStore\";\nconst name = \"meshUboDeclaration\";\nconst shader = `struct Mesh {world : mat4x4<f32>,\nvisibility : f32,};var<uniform> mesh : Mesh;\n#define WORLD_UBO\n`;\n// Sideeffect\nShaderStore.IncludesShadersStoreWGSL[name] = shader;\n/** @internal */\nexport const meshUboDeclarationWGSL = { name, shader };\n//# sourceMappingURL=meshUboDeclaration.js.map"],"names":["name","shader"],"mappings":";;AAAA;AAEA,MAAMA,MAAI,GAAG,qBAAqB;AAClC,MAAMC,QAAM,GAAG,CAAC;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA,WAAW,CAAC,wBAAwB,CAACD,MAAI,CAAC,GAAGC,QAAM;;ACdnD;AAEA,MAAM,IAAI,GAAG,oBAAoB;AACjC,MAAM,MAAM,GAAG,CAAC;AAChB;AACA;AACA,CAAC;AACD;AACA,WAAW,CAAC,wBAAwB,CAAC,IAAI,CAAC,GAAG,MAAM"}