| 1 |
- {"ast":null,"code":"/**\n * Defines an GC Friendly array where the backfield array do not shrink to prevent over allocations.\n */\nexport class SmartArray {\n /**\n * Instantiates a Smart Array.\n * @param capacity defines the default capacity of the array.\n */\n constructor(capacity) {\n /**\n * The active length of the array.\n */\n this.length = 0;\n this.data = new Array(capacity);\n this._id = SmartArray._GlobalId++;\n }\n /**\n * Pushes a value at the end of the active data.\n * @param value defines the object to push in the array.\n */\n push(value) {\n this.data[this.length++] = value;\n if (this.length > this.data.length) {\n this.data.length *= 2;\n }\n }\n /**\n * Iterates over the active data and apply the lambda to them.\n * @param func defines the action to apply on each value.\n */\n forEach(func) {\n for (let index = 0; index < this.length; index++) {\n func(this.data[index]);\n }\n }\n /**\n * Sorts the full sets of data.\n * @param compareFn defines the comparison function to apply.\n */\n sort(compareFn) {\n this.data.sort(compareFn);\n }\n /**\n * Resets the active data to an empty array.\n */\n reset() {\n this.length = 0;\n }\n /**\n * Releases all the data from the array as well as the array.\n */\n dispose() {\n this.reset();\n if (this.data) {\n this.data.length = 0;\n }\n }\n /**\n * Concats the active data with a given array.\n * @param array defines the data to concatenate with.\n */\n concat(array) {\n if (array.length === 0) {\n return;\n }\n if (this.length + array.length > this.data.length) {\n this.data.length = (this.length + array.length) * 2;\n }\n for (let index = 0; index < array.length; index++) {\n this.data[this.length++] = (array.data || array)[index];\n }\n }\n /**\n * Returns the position of a value in the active data.\n * @param value defines the value to find the index for\n * @returns the index if found in the active data otherwise -1\n */\n indexOf(value) {\n const position = this.data.indexOf(value);\n if (position >= this.length) {\n return -1;\n }\n return position;\n }\n /**\n * Returns whether an element is part of the active data.\n * @param value defines the value to look for\n * @returns true if found in the active data otherwise false\n */\n contains(value) {\n return this.indexOf(value) !== -1;\n }\n}\n// Statics\nSmartArray._GlobalId = 0;\n/**\n * Defines an GC Friendly array where the backfield array do not shrink to prevent over allocations.\n * The data in this array can only be present once\n */\nexport class SmartArrayNoDuplicate extends SmartArray {\n constructor() {\n super(...arguments);\n this._duplicateId = 0;\n }\n /**\n * Pushes a value at the end of the active data.\n * THIS DOES NOT PREVENT DUPPLICATE DATA\n * @param value defines the object to push in the array.\n */\n push(value) {\n super.push(value);\n if (!value.__smartArrayFlags) {\n value.__smartArrayFlags = {};\n }\n value.__smartArrayFlags[this._id] = this._duplicateId;\n }\n /**\n * Pushes a value at the end of the active data.\n * If the data is already present, it won t be added again\n * @param value defines the object to push in the array.\n * @returns true if added false if it was already present\n */\n pushNoDuplicate(value) {\n if (value.__smartArrayFlags && value.__smartArrayFlags[this._id] === this._duplicateId) {\n return false;\n }\n this.push(value);\n return true;\n }\n /**\n * Resets the active data to an empty array.\n */\n reset() {\n super.reset();\n this._duplicateId++;\n }\n /**\n * Concats the active data with a given array.\n * This ensures no duplicate will be present in the result.\n * @param array defines the data to concatenate with.\n */\n concatWithNoDuplicate(array) {\n if (array.length === 0) {\n return;\n }\n if (this.length + array.length > this.data.length) {\n this.data.length = (this.length + array.length) * 2;\n }\n for (let index = 0; index < array.length; index++) {\n const item = (array.data || array)[index];\n this.pushNoDuplicate(item);\n }\n }\n}","map":{"version":3,"names":["SmartArray","constructor","capacity","length","data","Array","_id","_GlobalId","push","value","forEach","func","index","sort","compareFn","reset","dispose","concat","array","indexOf","position","contains","SmartArrayNoDuplicate","arguments","_duplicateId","__smartArrayFlags","pushNoDuplicate","concatWithNoDuplicate","item"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/@babylonjs/core/Misc/smartArray.js"],"sourcesContent":["/**\n * Defines an GC Friendly array where the backfield array do not shrink to prevent over allocations.\n */\nexport class SmartArray {\n /**\n * Instantiates a Smart Array.\n * @param capacity defines the default capacity of the array.\n */\n constructor(capacity) {\n /**\n * The active length of the array.\n */\n this.length = 0;\n this.data = new Array(capacity);\n this._id = SmartArray._GlobalId++;\n }\n /**\n * Pushes a value at the end of the active data.\n * @param value defines the object to push in the array.\n */\n push(value) {\n this.data[this.length++] = value;\n if (this.length > this.data.length) {\n this.data.length *= 2;\n }\n }\n /**\n * Iterates over the active data and apply the lambda to them.\n * @param func defines the action to apply on each value.\n */\n forEach(func) {\n for (let index = 0; index < this.length; index++) {\n func(this.data[index]);\n }\n }\n /**\n * Sorts the full sets of data.\n * @param compareFn defines the comparison function to apply.\n */\n sort(compareFn) {\n this.data.sort(compareFn);\n }\n /**\n * Resets the active data to an empty array.\n */\n reset() {\n this.length = 0;\n }\n /**\n * Releases all the data from the array as well as the array.\n */\n dispose() {\n this.reset();\n if (this.data) {\n this.data.length = 0;\n }\n }\n /**\n * Concats the active data with a given array.\n * @param array defines the data to concatenate with.\n */\n concat(array) {\n if (array.length === 0) {\n return;\n }\n if (this.length + array.length > this.data.length) {\n this.data.length = (this.length + array.length) * 2;\n }\n for (let index = 0; index < array.length; index++) {\n this.data[this.length++] = (array.data || array)[index];\n }\n }\n /**\n * Returns the position of a value in the active data.\n * @param value defines the value to find the index for\n * @returns the index if found in the active data otherwise -1\n */\n indexOf(value) {\n const position = this.data.indexOf(value);\n if (position >= this.length) {\n return -1;\n }\n return position;\n }\n /**\n * Returns whether an element is part of the active data.\n * @param value defines the value to look for\n * @returns true if found in the active data otherwise false\n */\n contains(value) {\n return this.indexOf(value) !== -1;\n }\n}\n// Statics\nSmartArray._GlobalId = 0;\n/**\n * Defines an GC Friendly array where the backfield array do not shrink to prevent over allocations.\n * The data in this array can only be present once\n */\nexport class SmartArrayNoDuplicate extends SmartArray {\n constructor() {\n super(...arguments);\n this._duplicateId = 0;\n }\n /**\n * Pushes a value at the end of the active data.\n * THIS DOES NOT PREVENT DUPPLICATE DATA\n * @param value defines the object to push in the array.\n */\n push(value) {\n super.push(value);\n if (!value.__smartArrayFlags) {\n value.__smartArrayFlags = {};\n }\n value.__smartArrayFlags[this._id] = this._duplicateId;\n }\n /**\n * Pushes a value at the end of the active data.\n * If the data is already present, it won t be added again\n * @param value defines the object to push in the array.\n * @returns true if added false if it was already present\n */\n pushNoDuplicate(value) {\n if (value.__smartArrayFlags && value.__smartArrayFlags[this._id] === this._duplicateId) {\n return false;\n }\n this.push(value);\n return true;\n }\n /**\n * Resets the active data to an empty array.\n */\n reset() {\n super.reset();\n this._duplicateId++;\n }\n /**\n * Concats the active data with a given array.\n * This ensures no duplicate will be present in the result.\n * @param array defines the data to concatenate with.\n */\n concatWithNoDuplicate(array) {\n if (array.length === 0) {\n return;\n }\n if (this.length + array.length > this.data.length) {\n this.data.length = (this.length + array.length) * 2;\n }\n for (let index = 0; index < array.length; index++) {\n const item = (array.data || array)[index];\n this.pushNoDuplicate(item);\n }\n }\n}\n"],"mappings":"AAAA;AACA;AACA;AACA,OAAO,MAAMA,UAAU,CAAC;EACpB;AACJ;AACA;AACA;EACIC,WAAWA,CAACC,QAAQ,EAAE;IAClB;AACR;AACA;IACQ,IAAI,CAACC,MAAM,GAAG,CAAC;IACf,IAAI,CAACC,IAAI,GAAG,IAAIC,KAAK,CAACH,QAAQ,CAAC;IAC/B,IAAI,CAACI,GAAG,GAAGN,UAAU,CAACO,SAAS,EAAE;EACrC;EACA;AACJ;AACA;AACA;EACIC,IAAIA,CAACC,KAAK,EAAE;IACR,IAAI,CAACL,IAAI,CAAC,IAAI,CAACD,MAAM,EAAE,CAAC,GAAGM,KAAK;IAChC,IAAI,IAAI,CAACN,MAAM,GAAG,IAAI,CAACC,IAAI,CAACD,MAAM,EAAE;MAChC,IAAI,CAACC,IAAI,CAACD,MAAM,IAAI,CAAC;IACzB;EACJ;EACA;AACJ;AACA;AACA;EACIO,OAAOA,CAACC,IAAI,EAAE;IACV,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,IAAI,CAACT,MAAM,EAAES,KAAK,EAAE,EAAE;MAC9CD,IAAI,CAAC,IAAI,CAACP,IAAI,CAACQ,KAAK,CAAC,CAAC;IAC1B;EACJ;EACA;AACJ;AACA;AACA;EACIC,IAAIA,CAACC,SAAS,EAAE;IACZ,IAAI,CAACV,IAAI,CAACS,IAAI,CAACC,SAAS,CAAC;EAC7B;EACA;AACJ;AACA;EACIC,KAAKA,CAAA,EAAG;IACJ,IAAI,CAACZ,MAAM,GAAG,CAAC;EACnB;EACA;AACJ;AACA;EACIa,OAAOA,CAAA,EAAG;IACN,IAAI,CAACD,KAAK,CAAC,CAAC;IACZ,IAAI,IAAI,CAACX,IAAI,EAAE;MACX,IAAI,CAACA,IAAI,CAACD,MAAM,GAAG,CAAC;IACxB;EACJ;EACA;AACJ;AACA;AACA;EACIc,MAAMA,CAACC,KAAK,EAAE;IACV,IAAIA,KAAK,CAACf,MAAM,KAAK,CAAC,EAAE;MACpB;IACJ;IACA,IAAI,IAAI,CAACA,MAAM,GAAGe,KAAK,CAACf,MAAM,GAAG,IAAI,CAACC,IAAI,CAACD,MAAM,EAAE;MAC/C,IAAI,CAACC,IAAI,CAACD,MAAM,GAAG,CAAC,IAAI,CAACA,MAAM,GAAGe,KAAK,CAACf,MAAM,IAAI,CAAC;IACvD;IACA,KAAK,IAAIS,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGM,KAAK,CAACf,MAAM,EAAES,KAAK,EAAE,EAAE;MAC/C,IAAI,CAACR,IAAI,CAAC,IAAI,CAACD,MAAM,EAAE,CAAC,GAAG,CAACe,KAAK,CAACd,IAAI,IAAIc,KAAK,EAAEN,KAAK,CAAC;IAC3D;EACJ;EACA;AACJ;AACA;AACA;AACA;EACIO,OAAOA,CAACV,KAAK,EAAE;IACX,MAAMW,QAAQ,GAAG,IAAI,CAAChB,IAAI,CAACe,OAAO,CAACV,KAAK,CAAC;IACzC,IAAIW,QAAQ,IAAI,IAAI,CAACjB,MAAM,EAAE;MACzB,OAAO,CAAC,CAAC;IACb;IACA,OAAOiB,QAAQ;EACnB;EACA;AACJ;AACA;AACA;AACA;EACIC,QAAQA,CAACZ,KAAK,EAAE;IACZ,OAAO,IAAI,CAACU,OAAO,CAACV,KAAK,CAAC,KAAK,CAAC,CAAC;EACrC;AACJ;AACA;AACAT,UAAU,CAACO,SAAS,GAAG,CAAC;AACxB;AACA;AACA;AACA;AACA,OAAO,MAAMe,qBAAqB,SAAStB,UAAU,CAAC;EAClDC,WAAWA,CAAA,EAAG;IACV,KAAK,CAAC,GAAGsB,SAAS,CAAC;IACnB,IAAI,CAACC,YAAY,GAAG,CAAC;EACzB;EACA;AACJ;AACA;AACA;AACA;EACIhB,IAAIA,CAACC,KAAK,EAAE;IACR,KAAK,CAACD,IAAI,CAACC,KAAK,CAAC;IACjB,IAAI,CAACA,KAAK,CAACgB,iBAAiB,EAAE;MAC1BhB,KAAK,CAACgB,iBAAiB,GAAG,CAAC,CAAC;IAChC;IACAhB,KAAK,CAACgB,iBAAiB,CAAC,IAAI,CAACnB,GAAG,CAAC,GAAG,IAAI,CAACkB,YAAY;EACzD;EACA;AACJ;AACA;AACA;AACA;AACA;EACIE,eAAeA,CAACjB,KAAK,EAAE;IACnB,IAAIA,KAAK,CAACgB,iBAAiB,IAAIhB,KAAK,CAACgB,iBAAiB,CAAC,IAAI,CAACnB,GAAG,CAAC,KAAK,IAAI,CAACkB,YAAY,EAAE;MACpF,OAAO,KAAK;IAChB;IACA,IAAI,CAAChB,IAAI,CAACC,KAAK,CAAC;IAChB,OAAO,IAAI;EACf;EACA;AACJ;AACA;EACIM,KAAKA,CAAA,EAAG;IACJ,KAAK,CAACA,KAAK,CAAC,CAAC;IACb,IAAI,CAACS,YAAY,EAAE;EACvB;EACA;AACJ;AACA;AACA;AACA;EACIG,qBAAqBA,CAACT,KAAK,EAAE;IACzB,IAAIA,KAAK,CAACf,MAAM,KAAK,CAAC,EAAE;MACpB;IACJ;IACA,IAAI,IAAI,CAACA,MAAM,GAAGe,KAAK,CAACf,MAAM,GAAG,IAAI,CAACC,IAAI,CAACD,MAAM,EAAE;MAC/C,IAAI,CAACC,IAAI,CAACD,MAAM,GAAG,CAAC,IAAI,CAACA,MAAM,GAAGe,KAAK,CAACf,MAAM,IAAI,CAAC;IACvD;IACA,KAAK,IAAIS,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGM,KAAK,CAACf,MAAM,EAAES,KAAK,EAAE,EAAE;MAC/C,MAAMgB,IAAI,GAAG,CAACV,KAAK,CAACd,IAAI,IAAIc,KAAK,EAAEN,KAAK,CAAC;MACzC,IAAI,CAACc,eAAe,CAACE,IAAI,CAAC;IAC9B;EACJ;AACJ","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}
|
