| 1 |
- {"ast":null,"code":"/* eslint-disable @typescript-eslint/naming-convention */\n/** @internal */\nexport class ShaderDefineExpression {\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n isTrue(preprocessors) {\n return true;\n }\n static postfixToInfix(postfix) {\n const stack = [];\n for (const c of postfix) {\n if (ShaderDefineExpression._OperatorPriority[c] === undefined) {\n stack.push(c);\n } else {\n const v1 = stack[stack.length - 1],\n v2 = stack[stack.length - 2];\n stack.length -= 2;\n stack.push(`(${v2}${c}${v1})`);\n }\n }\n return stack[stack.length - 1];\n }\n /**\n * Converts an infix expression to a postfix expression.\n *\n * This method is used to transform infix expressions, which are more human-readable,\n * into postfix expressions, also known as Reverse Polish Notation (RPN), that can be\n * evaluated more efficiently by a computer. The conversion is based on the operator\n * priority defined in _OperatorPriority.\n *\n * The function employs a stack-based algorithm for the conversion and caches the result\n * to improve performance. The cache keeps track of each converted expression's access time\n * to manage the cache size and optimize memory usage. When the cache size exceeds a specified\n * limit, the least recently accessed items in the cache are deleted.\n *\n * The cache mechanism is particularly helpful for shader compilation, where the same infix\n * expressions might be encountered repeatedly, hence the caching can speed up the process.\n *\n * @param infix - The infix expression to be converted.\n * @returns The postfix expression as an array of strings.\n */\n static infixToPostfix(infix) {\n // Is infix already in cache\n const cacheItem = ShaderDefineExpression._InfixToPostfixCache.get(infix);\n if (cacheItem) {\n cacheItem.accessTime = Date.now();\n return cacheItem.result;\n }\n // Is infix contain any operator\n if (!infix.includes(\"&&\") && !infix.includes(\"||\") && !infix.includes(\")\") && !infix.includes(\"(\")) {\n return [infix];\n }\n const result = [];\n let stackIdx = -1;\n const pushOperand = () => {\n operand = operand.trim();\n if (operand !== \"\") {\n result.push(operand);\n operand = \"\";\n }\n };\n const push = s => {\n if (stackIdx < ShaderDefineExpression._Stack.length - 1) {\n ShaderDefineExpression._Stack[++stackIdx] = s;\n }\n };\n const peek = () => ShaderDefineExpression._Stack[stackIdx];\n const pop = () => stackIdx === -1 ? \"!!INVALID EXPRESSION!!\" : ShaderDefineExpression._Stack[stackIdx--];\n let idx = 0,\n operand = \"\";\n while (idx < infix.length) {\n const c = infix.charAt(idx),\n token = idx < infix.length - 1 ? infix.substring(idx, 2 + idx) : \"\";\n if (c === \"(\") {\n operand = \"\";\n push(c);\n } else if (c === \")\") {\n pushOperand();\n while (stackIdx !== -1 && peek() !== \"(\") {\n result.push(pop());\n }\n pop();\n } else if (ShaderDefineExpression._OperatorPriority[token] > 1) {\n pushOperand();\n while (stackIdx !== -1 && ShaderDefineExpression._OperatorPriority[peek()] >= ShaderDefineExpression._OperatorPriority[token]) {\n result.push(pop());\n }\n push(token);\n idx++;\n } else {\n operand += c;\n }\n idx++;\n }\n pushOperand();\n while (stackIdx !== -1) {\n if (peek() === \"(\") {\n pop();\n } else {\n result.push(pop());\n }\n }\n // If the cache is at capacity, clear it before adding a new item\n if (ShaderDefineExpression._InfixToPostfixCache.size >= ShaderDefineExpression.InfixToPostfixCacheLimitSize) {\n ShaderDefineExpression.ClearCache();\n }\n // Add the new item to the cache, including the current time as the last access time\n ShaderDefineExpression._InfixToPostfixCache.set(infix, {\n result,\n accessTime: Date.now()\n });\n return result;\n }\n static ClearCache() {\n // Convert the cache to an array and sort by last access time\n const sortedCache = Array.from(ShaderDefineExpression._InfixToPostfixCache.entries()).sort((a, b) => a[1].accessTime - b[1].accessTime);\n // Remove the least recently accessed half of the cache\n for (let i = 0; i < ShaderDefineExpression.InfixToPostfixCacheCleanupSize; i++) {\n ShaderDefineExpression._InfixToPostfixCache.delete(sortedCache[i][0]);\n }\n }\n}\n/**\n * Cache items count limit for the InfixToPostfix cache.\n * It uses to improve the performance of the shader compilation.\n * For details see PR: https://github.com/BabylonJS/Babylon.js/pull/13936\n */\nShaderDefineExpression.InfixToPostfixCacheLimitSize = 50000;\n/**\n * When the cache size is exceeded, a cache cleanup will be triggered\n * and the cache will be reduced by the size specified\n * in the InfixToPostfixCacheCleanupSize variable, removing entries\n * that have not been accessed the longest.\n */\nShaderDefineExpression.InfixToPostfixCacheCleanupSize = 25000;\nShaderDefineExpression._InfixToPostfixCache = new Map();\nShaderDefineExpression._OperatorPriority = {\n \")\": 0,\n \"(\": 1,\n \"||\": 2,\n \"&&\": 3\n};\nShaderDefineExpression._Stack = [\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"];","map":{"version":3,"names":["ShaderDefineExpression","isTrue","preprocessors","postfixToInfix","postfix","stack","c","_OperatorPriority","undefined","push","v1","length","v2","infixToPostfix","infix","cacheItem","_InfixToPostfixCache","get","accessTime","Date","now","result","includes","stackIdx","pushOperand","operand","trim","s","_Stack","peek","pop","idx","charAt","token","substring","size","InfixToPostfixCacheLimitSize","ClearCache","set","sortedCache","Array","from","entries","sort","a","b","i","InfixToPostfixCacheCleanupSize","delete","Map"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/@babylonjs/core/Engines/Processors/Expressions/shaderDefineExpression.js"],"sourcesContent":["/* eslint-disable @typescript-eslint/naming-convention */\n/** @internal */\nexport class ShaderDefineExpression {\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n isTrue(preprocessors) {\n return true;\n }\n static postfixToInfix(postfix) {\n const stack = [];\n for (const c of postfix) {\n if (ShaderDefineExpression._OperatorPriority[c] === undefined) {\n stack.push(c);\n }\n else {\n const v1 = stack[stack.length - 1], v2 = stack[stack.length - 2];\n stack.length -= 2;\n stack.push(`(${v2}${c}${v1})`);\n }\n }\n return stack[stack.length - 1];\n }\n /**\n * Converts an infix expression to a postfix expression.\n *\n * This method is used to transform infix expressions, which are more human-readable,\n * into postfix expressions, also known as Reverse Polish Notation (RPN), that can be\n * evaluated more efficiently by a computer. The conversion is based on the operator\n * priority defined in _OperatorPriority.\n *\n * The function employs a stack-based algorithm for the conversion and caches the result\n * to improve performance. The cache keeps track of each converted expression's access time\n * to manage the cache size and optimize memory usage. When the cache size exceeds a specified\n * limit, the least recently accessed items in the cache are deleted.\n *\n * The cache mechanism is particularly helpful for shader compilation, where the same infix\n * expressions might be encountered repeatedly, hence the caching can speed up the process.\n *\n * @param infix - The infix expression to be converted.\n * @returns The postfix expression as an array of strings.\n */\n static infixToPostfix(infix) {\n // Is infix already in cache\n const cacheItem = ShaderDefineExpression._InfixToPostfixCache.get(infix);\n if (cacheItem) {\n cacheItem.accessTime = Date.now();\n return cacheItem.result;\n }\n // Is infix contain any operator\n if (!infix.includes(\"&&\") && !infix.includes(\"||\") && !infix.includes(\")\") && !infix.includes(\"(\")) {\n return [infix];\n }\n const result = [];\n let stackIdx = -1;\n const pushOperand = () => {\n operand = operand.trim();\n if (operand !== \"\") {\n result.push(operand);\n operand = \"\";\n }\n };\n const push = (s) => {\n if (stackIdx < ShaderDefineExpression._Stack.length - 1) {\n ShaderDefineExpression._Stack[++stackIdx] = s;\n }\n };\n const peek = () => ShaderDefineExpression._Stack[stackIdx];\n const pop = () => (stackIdx === -1 ? \"!!INVALID EXPRESSION!!\" : ShaderDefineExpression._Stack[stackIdx--]);\n let idx = 0, operand = \"\";\n while (idx < infix.length) {\n const c = infix.charAt(idx), token = idx < infix.length - 1 ? infix.substring(idx, 2 + idx) : \"\";\n if (c === \"(\") {\n operand = \"\";\n push(c);\n }\n else if (c === \")\") {\n pushOperand();\n while (stackIdx !== -1 && peek() !== \"(\") {\n result.push(pop());\n }\n pop();\n }\n else if (ShaderDefineExpression._OperatorPriority[token] > 1) {\n pushOperand();\n while (stackIdx !== -1 && ShaderDefineExpression._OperatorPriority[peek()] >= ShaderDefineExpression._OperatorPriority[token]) {\n result.push(pop());\n }\n push(token);\n idx++;\n }\n else {\n operand += c;\n }\n idx++;\n }\n pushOperand();\n while (stackIdx !== -1) {\n if (peek() === \"(\") {\n pop();\n }\n else {\n result.push(pop());\n }\n }\n // If the cache is at capacity, clear it before adding a new item\n if (ShaderDefineExpression._InfixToPostfixCache.size >= ShaderDefineExpression.InfixToPostfixCacheLimitSize) {\n ShaderDefineExpression.ClearCache();\n }\n // Add the new item to the cache, including the current time as the last access time\n ShaderDefineExpression._InfixToPostfixCache.set(infix, { result, accessTime: Date.now() });\n return result;\n }\n static ClearCache() {\n // Convert the cache to an array and sort by last access time\n const sortedCache = Array.from(ShaderDefineExpression._InfixToPostfixCache.entries()).sort((a, b) => a[1].accessTime - b[1].accessTime);\n // Remove the least recently accessed half of the cache\n for (let i = 0; i < ShaderDefineExpression.InfixToPostfixCacheCleanupSize; i++) {\n ShaderDefineExpression._InfixToPostfixCache.delete(sortedCache[i][0]);\n }\n }\n}\n/**\n * Cache items count limit for the InfixToPostfix cache.\n * It uses to improve the performance of the shader compilation.\n * For details see PR: https://github.com/BabylonJS/Babylon.js/pull/13936\n */\nShaderDefineExpression.InfixToPostfixCacheLimitSize = 50000;\n/**\n * When the cache size is exceeded, a cache cleanup will be triggered\n * and the cache will be reduced by the size specified\n * in the InfixToPostfixCacheCleanupSize variable, removing entries\n * that have not been accessed the longest.\n */\nShaderDefineExpression.InfixToPostfixCacheCleanupSize = 25000;\nShaderDefineExpression._InfixToPostfixCache = new Map();\nShaderDefineExpression._OperatorPriority = {\n \")\": 0,\n \"(\": 1,\n \"||\": 2,\n \"&&\": 3,\n};\nShaderDefineExpression._Stack = [\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"];\n"],"mappings":"AAAA;AACA;AACA,OAAO,MAAMA,sBAAsB,CAAC;EAChC;EACAC,MAAMA,CAACC,aAAa,EAAE;IAClB,OAAO,IAAI;EACf;EACA,OAAOC,cAAcA,CAACC,OAAO,EAAE;IAC3B,MAAMC,KAAK,GAAG,EAAE;IAChB,KAAK,MAAMC,CAAC,IAAIF,OAAO,EAAE;MACrB,IAAIJ,sBAAsB,CAACO,iBAAiB,CAACD,CAAC,CAAC,KAAKE,SAAS,EAAE;QAC3DH,KAAK,CAACI,IAAI,CAACH,CAAC,CAAC;MACjB,CAAC,MACI;QACD,MAAMI,EAAE,GAAGL,KAAK,CAACA,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC;UAAEC,EAAE,GAAGP,KAAK,CAACA,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC;QAChEN,KAAK,CAACM,MAAM,IAAI,CAAC;QACjBN,KAAK,CAACI,IAAI,CAAC,IAAIG,EAAE,GAAGN,CAAC,GAAGI,EAAE,GAAG,CAAC;MAClC;IACJ;IACA,OAAOL,KAAK,CAACA,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC;EAClC;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACI,OAAOE,cAAcA,CAACC,KAAK,EAAE;IACzB;IACA,MAAMC,SAAS,GAAGf,sBAAsB,CAACgB,oBAAoB,CAACC,GAAG,CAACH,KAAK,CAAC;IACxE,IAAIC,SAAS,EAAE;MACXA,SAAS,CAACG,UAAU,GAAGC,IAAI,CAACC,GAAG,CAAC,CAAC;MACjC,OAAOL,SAAS,CAACM,MAAM;IAC3B;IACA;IACA,IAAI,CAACP,KAAK,CAACQ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAACR,KAAK,CAACQ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAACR,KAAK,CAACQ,QAAQ,CAAC,GAAG,CAAC,IAAI,CAACR,KAAK,CAACQ,QAAQ,CAAC,GAAG,CAAC,EAAE;MAChG,OAAO,CAACR,KAAK,CAAC;IAClB;IACA,MAAMO,MAAM,GAAG,EAAE;IACjB,IAAIE,QAAQ,GAAG,CAAC,CAAC;IACjB,MAAMC,WAAW,GAAGA,CAAA,KAAM;MACtBC,OAAO,GAAGA,OAAO,CAACC,IAAI,CAAC,CAAC;MACxB,IAAID,OAAO,KAAK,EAAE,EAAE;QAChBJ,MAAM,CAACZ,IAAI,CAACgB,OAAO,CAAC;QACpBA,OAAO,GAAG,EAAE;MAChB;IACJ,CAAC;IACD,MAAMhB,IAAI,GAAIkB,CAAC,IAAK;MAChB,IAAIJ,QAAQ,GAAGvB,sBAAsB,CAAC4B,MAAM,CAACjB,MAAM,GAAG,CAAC,EAAE;QACrDX,sBAAsB,CAAC4B,MAAM,CAAC,EAAEL,QAAQ,CAAC,GAAGI,CAAC;MACjD;IACJ,CAAC;IACD,MAAME,IAAI,GAAGA,CAAA,KAAM7B,sBAAsB,CAAC4B,MAAM,CAACL,QAAQ,CAAC;IAC1D,MAAMO,GAAG,GAAGA,CAAA,KAAOP,QAAQ,KAAK,CAAC,CAAC,GAAG,wBAAwB,GAAGvB,sBAAsB,CAAC4B,MAAM,CAACL,QAAQ,EAAE,CAAE;IAC1G,IAAIQ,GAAG,GAAG,CAAC;MAAEN,OAAO,GAAG,EAAE;IACzB,OAAOM,GAAG,GAAGjB,KAAK,CAACH,MAAM,EAAE;MACvB,MAAML,CAAC,GAAGQ,KAAK,CAACkB,MAAM,CAACD,GAAG,CAAC;QAAEE,KAAK,GAAGF,GAAG,GAAGjB,KAAK,CAACH,MAAM,GAAG,CAAC,GAAGG,KAAK,CAACoB,SAAS,CAACH,GAAG,EAAE,CAAC,GAAGA,GAAG,CAAC,GAAG,EAAE;MAChG,IAAIzB,CAAC,KAAK,GAAG,EAAE;QACXmB,OAAO,GAAG,EAAE;QACZhB,IAAI,CAACH,CAAC,CAAC;MACX,CAAC,MACI,IAAIA,CAAC,KAAK,GAAG,EAAE;QAChBkB,WAAW,CAAC,CAAC;QACb,OAAOD,QAAQ,KAAK,CAAC,CAAC,IAAIM,IAAI,CAAC,CAAC,KAAK,GAAG,EAAE;UACtCR,MAAM,CAACZ,IAAI,CAACqB,GAAG,CAAC,CAAC,CAAC;QACtB;QACAA,GAAG,CAAC,CAAC;MACT,CAAC,MACI,IAAI9B,sBAAsB,CAACO,iBAAiB,CAAC0B,KAAK,CAAC,GAAG,CAAC,EAAE;QAC1DT,WAAW,CAAC,CAAC;QACb,OAAOD,QAAQ,KAAK,CAAC,CAAC,IAAIvB,sBAAsB,CAACO,iBAAiB,CAACsB,IAAI,CAAC,CAAC,CAAC,IAAI7B,sBAAsB,CAACO,iBAAiB,CAAC0B,KAAK,CAAC,EAAE;UAC3HZ,MAAM,CAACZ,IAAI,CAACqB,GAAG,CAAC,CAAC,CAAC;QACtB;QACArB,IAAI,CAACwB,KAAK,CAAC;QACXF,GAAG,EAAE;MACT,CAAC,MACI;QACDN,OAAO,IAAInB,CAAC;MAChB;MACAyB,GAAG,EAAE;IACT;IACAP,WAAW,CAAC,CAAC;IACb,OAAOD,QAAQ,KAAK,CAAC,CAAC,EAAE;MACpB,IAAIM,IAAI,CAAC,CAAC,KAAK,GAAG,EAAE;QAChBC,GAAG,CAAC,CAAC;MACT,CAAC,MACI;QACDT,MAAM,CAACZ,IAAI,CAACqB,GAAG,CAAC,CAAC,CAAC;MACtB;IACJ;IACA;IACA,IAAI9B,sBAAsB,CAACgB,oBAAoB,CAACmB,IAAI,IAAInC,sBAAsB,CAACoC,4BAA4B,EAAE;MACzGpC,sBAAsB,CAACqC,UAAU,CAAC,CAAC;IACvC;IACA;IACArC,sBAAsB,CAACgB,oBAAoB,CAACsB,GAAG,CAACxB,KAAK,EAAE;MAAEO,MAAM;MAAEH,UAAU,EAAEC,IAAI,CAACC,GAAG,CAAC;IAAE,CAAC,CAAC;IAC1F,OAAOC,MAAM;EACjB;EACA,OAAOgB,UAAUA,CAAA,EAAG;IAChB;IACA,MAAME,WAAW,GAAGC,KAAK,CAACC,IAAI,CAACzC,sBAAsB,CAACgB,oBAAoB,CAAC0B,OAAO,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC,CAAC,CAAC,CAAC1B,UAAU,GAAG2B,CAAC,CAAC,CAAC,CAAC,CAAC3B,UAAU,CAAC;IACvI;IACA,KAAK,IAAI4B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG9C,sBAAsB,CAAC+C,8BAA8B,EAAED,CAAC,EAAE,EAAE;MAC5E9C,sBAAsB,CAACgB,oBAAoB,CAACgC,MAAM,CAACT,WAAW,CAACO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE;EACJ;AACJ;AACA;AACA;AACA;AACA;AACA;AACA9C,sBAAsB,CAACoC,4BAA4B,GAAG,KAAK;AAC3D;AACA;AACA;AACA;AACA;AACA;AACApC,sBAAsB,CAAC+C,8BAA8B,GAAG,KAAK;AAC7D/C,sBAAsB,CAACgB,oBAAoB,GAAG,IAAIiC,GAAG,CAAC,CAAC;AACvDjD,sBAAsB,CAACO,iBAAiB,GAAG;EACvC,GAAG,EAAE,CAAC;EACN,GAAG,EAAE,CAAC;EACN,IAAI,EAAE,CAAC;EACP,IAAI,EAAE;AACV,CAAC;AACDP,sBAAsB,CAAC4B,MAAM,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}
|
