@carbonenginejs/runtime 0.1.0-alpha.0 → 0.1.0-alpha.1

package/dist/trinityal/{Tr2DeviceResourceAL.js → Tr2DeviceResourceAL/Tr2BaseDeviceResourceAL.js}

@@ -1,6 +1,8 @@
-// Source: trinity/trinityal/Tr2DeviceResourceAL.h
-// Source: trinity/trinityal/Tr2DeviceResourceAL.cpp
-//
+import { applyDecs2311 as _applyDecs2311 } from '../../_virtual/_rollupPluginBabelHelpers.js';
+import { impl } from '#schema';
+
+let _initProto;
+
 // The base every abstraction-layer resource extends, and the registry that
 // makes them enumerable.
 //
@@ -10,18 +12,12 @@
 // resource and asks it to describe itself; `DestroyDeviceResources` releases
 // everything in a memory class, which is what a device-lost path needs.
 //
-// ONE DELIBERATE DIFFERENCE, AND IT IS FORCED. Carbon registers in the
-// constructor and unregisters in the DESTRUCTOR, so a resource leaves the
-// registry when it goes out of scope. JavaScript has no destructor, and a
-// FinalizationRegistry runs at the garbage collector's convenience - which is
-// no use to a "release everything now" path. So `Destroy()` unregisters, and a
-// resource that is never destroyed stays registered. That is the same shape
-// Carbon has before its destructor runs, and it makes Destroy the single
-// deterministic release point rather than a hint.
-//
-// The registry therefore holds STRONG references on purpose. A WeakRef set
-// would let a resource vanish between "enumerate" and "destroy", which is
-// exactly the case this exists to handle.
+// Existing lifetime adaptation: Carbon registers in the constructor and
+// unregisters in the destructor (Tr2DeviceResourceAL.cpp:32-44). JavaScript has
+// no deterministic destructor. This implementation keeps strong registry
+// references and unregisters at explicit Destroy. A resource never destroyed
+// stays registered; destroying and recreating the same object does not register
+// it again. Restoring the forwarding class does not change that lifetime policy.
 
 function fail(message) {
   const error = new Error(`Tr2DeviceResourceAL: ${message}`);
@@ -40,24 +36,26 @@ const Tr2ALMemoryType = Object.freeze({
 /** Every live resource. Strong by design - see the head comment. */
 const ALL_RESOURCES = new Set();
 
-/**
- * Carbon's `s_resourcesMutated`.
- *
- * Destroying a resource can create or destroy others, which invalidates an
- * iterator mid-walk. Carbon restarts the sweep whenever that happens rather
- * than trusting the iterator, and so does this.
+/**
+ * Carbon's `s_resourcesMutated`.
+ *
+ * Destroying a resource can create or destroy others, which invalidates an
+ * iterator mid-walk. Carbon restarts the sweep whenever that happens rather
+ * than trusting the iterator, and so does this.
  */
 let resourcesMutated = false;
 
-/**
- * The base of every AL resource.
- *
- * Subclasses supply `IsValid()`, `GetMemoryClass()` and the work of `Destroy()`;
- * Carbon's CRTP `Tr2DeviceResourceAL<T>` forwards the first two, which in
- * JavaScript is just ordinary dispatch.
+/**
+ * The base of every AL resource.
+ *
+ * The abstract registry interface is implemented by Tr2DeviceResourceAL's
+ * forwarding methods and the concrete backend's Destroy and Describe methods.
  */
 class Tr2BaseDeviceResourceAL {
-  _registered = false;
+  static {
+    [_initProto] = _applyDecs2311(this, [], [[[impl, impl.adapted, void 0, impl.reason("JavaScript has no pure virtual declarations; calling the missing obligation throws.")], 18, "IsResourceValid"], [[impl, impl.adapted, void 0, impl.reason("JavaScript has no pure virtual declarations; calling the missing obligation throws.")], 18, "GetResourceMemoryClass"], [[impl, impl.adapted, void 0, impl.reason("The empty concrete stub descriptions share this inherited implementation instead of repeating it on each backend class.")], 18, "Describe"], [[impl, impl.adapted, void 0, impl.reason("JavaScript has no deterministic destructor; the existing registry unregisters at explicit Destroy. Recreating that object does not re-register it.")], 18, "Destroy"]]).e;
+  }
+  _registered = (_initProto(this), false);
 
   /** Registers the resource, as Carbon's constructor does. */
   constructor() {
@@ -66,41 +64,41 @@ class Tr2BaseDeviceResourceAL {
     resourcesMutated = true;
   }
 
-  /**
-   * Whether this resource still holds anything.
-   *
-   * @returns {boolean} True when live.
+  /**
+   * Whether this resource still holds anything.
+   *
+   * @returns {boolean} True when live.
    */
-  IsValid() {
-    fail(`${this.constructor.name} must implement IsValid`);
+  IsResourceValid() {
+    fail(`${this.constructor.name} must implement IsResourceValid`);
   }
 
-  /**
-   * Which memory class this resource occupies.
-   *
-   * @returns {number} A `Tr2ALMemoryType` value.
+  /**
+   * Which memory class this resource occupies.
+   *
+   * @returns {number} A `Tr2ALMemoryType` value.
    */
-  GetMemoryClass() {
-    return Tr2ALMemoryType.AL_MEMORY_MANAGED;
+  GetResourceMemoryClass() {
+    fail(`${this.constructor.name} must implement GetResourceMemoryClass`);
   }
 
-  /**
-   * Describes this resource for a device inventory.
-   *
-   * Carbon fills a `map<string,string>`. Every stub resource leaves it empty
-   * EXCEPT `Tr2PipelineStatsQueryAL`, which writes its own type name
-   * (`Tr2PipelineStatsQueryALStub.cpp:65-68`) - so an unoverridden description
-   * is faithful rather than lazy, and that one override is faithful too.
-   *
-   * @param {object} _description Accumulator, keyed by name.
+  /**
+   * Describes this resource for a device inventory.
+   *
+   * Carbon fills a `map<string,string>`. Every stub resource leaves it empty
+   * EXCEPT `Tr2PipelineStatsQueryAL`, which writes its own type name
+   * (`Tr2PipelineStatsQueryALStub.cpp:65-68`) - so an unoverridden description
+   * is faithful rather than lazy, and that one override is faithful too.
+   *
+   * @param {object} _description Accumulator, keyed by name.
    */
   Describe(_description) {}
 
-  /**
-   * Releases the resource. Subclasses override and call `super.Destroy()`.
-   *
-   * Unregistering here rather than in a finaliser is what makes the release
-   * path deterministic; see the head comment.
+  /**
+   * Releases the resource. Subclasses override and call `super.Destroy()`.
+   *
+   * Unregistering here rather than in a finaliser is what makes the release
+   * path deterministic; see the head comment.
    */
   Destroy() {
     if (!this._registered) return;
@@ -114,10 +112,10 @@ class Tr2BaseDeviceResourceAL {
     return this._registered;
   }
 
-  /**
-   * Runs an operation over every live resource.
-   *
-   * @param {Function} operation Called with each resource.
+  /**
+   * Runs an operation over every live resource.
+   *
+   * @param {Function} operation Called with each resource.
    */
   static EnumerateResources(operation) {
     if (typeof operation !== "function") fail("EnumerateResources needs a function");
@@ -133,40 +131,40 @@ class Tr2BaseDeviceResourceAL {
   }
 }
 
-/**
- * Describes every VALID resource to the supplied operation.
- *
- * Carbon skips invalid resources rather than describing them
- * (`Tr2DeviceResourceAL.cpp:61`), so a released handle contributes nothing to
- * an inventory.
- *
- * @param {Function} operation Called with `(memoryClass, description)`.
+/**
+ * Describes every VALID resource to the supplied operation.
+ *
+ * Carbon skips invalid resources rather than describing them
+ * (`Tr2DeviceResourceAL.cpp:61`), so a released handle contributes nothing to
+ * an inventory.
+ *
+ * @param {Function} operation Called with `(memoryClass, description)`.
  */
 function DescribeDeviceResources(operation) {
   if (typeof operation !== "function") fail("DescribeDeviceResources needs a function");
   for (const resource of [...ALL_RESOURCES]) {
-    if (!resource.IsValid()) continue;
+    if (!resource.IsResourceValid()) continue;
     const description = {};
     resource.Describe(description);
-    operation(resource.GetMemoryClass(), description);
+    operation(resource.GetResourceMemoryClass(), description);
   }
 }
 
-/**
- * Destroys every valid resource in the given memory classes.
- *
- * THE RESTART IS CARBON'S AND IS NOT AN OPTIMISATION TO REMOVE. Destroying a
- * resource can create or destroy others, so Carbon breaks out and starts the
- * sweep again whenever the set changed underneath it
- * (`Tr2DeviceResourceAL.cpp:73-89`). Iterating once would skip resources.
- *
- * @param {number} memoryTypes A bit set of `Tr2ALMemoryType`.
+/**
+ * Destroys every valid resource in the given memory classes.
+ *
+ * THE RESTART IS CARBON'S AND IS NOT AN OPTIMISATION TO REMOVE. Destroying a
+ * resource can create or destroy others, so Carbon breaks out and starts the
+ * sweep again whenever the set changed underneath it
+ * (`Tr2DeviceResourceAL.cpp:73-89`). Iterating once would skip resources.
+ *
+ * @param {number} memoryTypes A bit set of `Tr2ALMemoryType`.
  */
 function DestroyDeviceResources(memoryTypes) {
   do {
     resourcesMutated = false;
     for (const resource of [...ALL_RESOURCES]) {
-      if (resource.IsValid() && (resource.GetMemoryClass() & memoryTypes) !== 0) {
+      if (resource.IsResourceValid() && (resource.GetResourceMemoryClass() & memoryTypes) !== 0) {
         resource.Destroy();
       }
       if (resourcesMutated) break;
@@ -175,4 +173,4 @@ function DestroyDeviceResources(memoryTypes) {
 }
 
 export { DescribeDeviceResources, DestroyDeviceResources, Tr2ALMemoryType, Tr2BaseDeviceResourceAL };
-//# sourceMappingURL=Tr2DeviceResourceAL.js.map
+//# sourceMappingURL=Tr2BaseDeviceResourceAL.js.map

package/dist/trinityal/Tr2DeviceResourceAL/Tr2BaseDeviceResourceAL.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tr2BaseDeviceResourceAL.js","sources":["../../../../src/trinityal/Tr2DeviceResourceAL/Tr2BaseDeviceResourceAL.js"],"sourcesContent":["// Source: trinity/trinityal/Tr2DeviceResourceAL.h\r\n// Source: trinity/trinityal/Tr2DeviceResourceAL.cpp\r\n//\r\nimport { impl } from \"#schema\";\r\n\r\n// The base every abstraction-layer resource extends, and the registry that\r\n// makes them enumerable.\r\n//\r\n// Carbon's reason for this base is worth keeping in view: it is how a device\r\n// answers \"what am I holding, and how much of it\" without every resource type\r\n// inventing its own bookkeeping. `DescribeDeviceResources` walks every live\r\n// resource and asks it to describe itself; `DestroyDeviceResources` releases\r\n// everything in a memory class, which is what a device-lost path needs.\r\n//\r\n// Existing lifetime adaptation: Carbon registers in the constructor and\r\n// unregisters in the destructor (Tr2DeviceResourceAL.cpp:32-44). JavaScript has\r\n// no deterministic destructor. This implementation keeps strong registry\r\n// references and unregisters at explicit Destroy. A resource never destroyed\r\n// stays registered; destroying and recreating the same object does not register\r\n// it again. Restoring the forwarding class does not change that lifetime policy.\r\n\r\n\r\n\r\nfunction fail(message)\r\n{\r\n  const error = new Error(`Tr2DeviceResourceAL: ${message}`);\r\n  error.code = \"CJS_AL_RESOURCE_INVALID\";\r\n  throw error;\r\n}\r\n\r\n\r\n/** `Tr2ALMemoryType` (`Tr2DeviceResourceAL.h:5-9`). A bit set, not an enum. */\r\nexport const Tr2ALMemoryType = Object.freeze({\r\n  /** Created in video memory. */\r\n  AL_MEMORY_VIDEO: 1 << 0,\r\n\r\n  /** Created in device-managed memory. */\r\n  AL_MEMORY_MANAGED: 1 << 1\r\n});\r\n\r\n\r\n/** Every live resource. Strong by design - see the head comment. */\r\nconst ALL_RESOURCES = new Set();\r\n\r\n/**\r\n * Carbon's `s_resourcesMutated`.\r\n *\r\n * Destroying a resource can create or destroy others, which invalidates an\r\n * iterator mid-walk. Carbon restarts the sweep whenever that happens rather\r\n * than trusting the iterator, and so does this.\r\n */\r\nlet resourcesMutated = false;\r\n\r\n\r\n/**\r\n * The base of every AL resource.\r\n *\r\n * The abstract registry interface is implemented by Tr2DeviceResourceAL's\r\n * forwarding methods and the concrete backend's Destroy and Describe methods.\r\n */\r\nexport class Tr2BaseDeviceResourceAL\r\n{\r\n  _registered = false;\r\n\r\n  /** Registers the resource, as Carbon's constructor does. */\r\n  constructor()\r\n  {\r\n    ALL_RESOURCES.add(this);\r\n    this._registered = true;\r\n    resourcesMutated = true;\r\n  }\r\n\r\n  /**\r\n   * Whether this resource still holds anything.\r\n   *\r\n   * @returns {boolean} True when live.\r\n   */\r\n  @impl.adapted\r\n  @impl.reason(\"JavaScript has no pure virtual declarations; calling the missing obligation throws.\")\r\n  IsResourceValid()\r\n  {\r\n    fail(`${this.constructor.name} must implement IsResourceValid`);\r\n  }\r\n\r\n  /**\r\n   * Which memory class this resource occupies.\r\n   *\r\n   * @returns {number} A `Tr2ALMemoryType` value.\r\n   */\r\n  @impl.adapted\r\n  @impl.reason(\"JavaScript has no pure virtual declarations; calling the missing obligation throws.\")\r\n  GetResourceMemoryClass()\r\n  {\r\n    fail(`${this.constructor.name} must implement GetResourceMemoryClass`);\r\n  }\r\n\r\n  /**\r\n   * Describes this resource for a device inventory.\r\n   *\r\n   * Carbon fills a `map<string,string>`. Every stub resource leaves it empty\r\n   * EXCEPT `Tr2PipelineStatsQueryAL`, which writes its own type name\r\n   * (`Tr2PipelineStatsQueryALStub.cpp:65-68`) - so an unoverridden description\r\n   * is faithful rather than lazy, and that one override is faithful too.\r\n   *\r\n   * @param {object} _description Accumulator, keyed by name.\r\n   */\r\n  @impl.adapted\r\n  @impl.reason(\"The empty concrete stub descriptions share this inherited implementation instead of repeating it on each backend class.\")\r\n  Describe(_description)\r\n  {\r\n  }\r\n\r\n  /**\r\n   * Releases the resource. Subclasses override and call `super.Destroy()`.\r\n   *\r\n   * Unregistering here rather than in a finaliser is what makes the release\r\n   * path deterministic; see the head comment.\r\n   */\r\n  @impl.adapted\r\n  @impl.reason(\"JavaScript has no deterministic destructor; the existing registry unregisters at explicit Destroy. Recreating that object does not re-register it.\")\r\n  Destroy()\r\n  {\r\n    if (!this._registered) return;\r\n\r\n    ALL_RESOURCES.delete(this);\r\n    this._registered = false;\r\n    resourcesMutated = true;\r\n  }\r\n\r\n  /** Whether this resource is still in the registry. */\r\n  IsRegistered()\r\n  {\r\n    return this._registered;\r\n  }\r\n\r\n  /**\r\n   * Runs an operation over every live resource.\r\n   *\r\n   * @param {Function} operation Called with each resource.\r\n   */\r\n  static EnumerateResources(operation)\r\n  {\r\n    if (typeof operation !== \"function\") fail(\"EnumerateResources needs a function\");\r\n\r\n    // A copy, because Carbon takes a mutex here and an operation that creates\r\n    // or destroys a resource would otherwise mutate the set mid-iteration.\r\n    for (const resource of [ ...ALL_RESOURCES ]) operation(resource);\r\n  }\r\n\r\n  /** How many resources are live. Not Carbon's; the registry is otherwise opaque. */\r\n  static GetResourceCount()\r\n  {\r\n    return ALL_RESOURCES.size;\r\n  }\r\n}\r\n\r\n\r\n/**\r\n * Describes every VALID resource to the supplied operation.\r\n *\r\n * Carbon skips invalid resources rather than describing them\r\n * (`Tr2DeviceResourceAL.cpp:61`), so a released handle contributes nothing to\r\n * an inventory.\r\n *\r\n * @param {Function} operation Called with `(memoryClass, description)`.\r\n */\r\nexport function DescribeDeviceResources(operation)\r\n{\r\n  if (typeof operation !== \"function\") fail(\"DescribeDeviceResources needs a function\");\r\n\r\n  for (const resource of [ ...ALL_RESOURCES ])\r\n  {\r\n    if (!resource.IsResourceValid()) continue;\r\n\r\n    const description = {};\r\n\r\n    resource.Describe(description);\r\n    operation(resource.GetResourceMemoryClass(), description);\r\n  }\r\n}\r\n\r\n/**\r\n * Destroys every valid resource in the given memory classes.\r\n *\r\n * THE RESTART IS CARBON'S AND IS NOT AN OPTIMISATION TO REMOVE. Destroying a\r\n * resource can create or destroy others, so Carbon breaks out and starts the\r\n * sweep again whenever the set changed underneath it\r\n * (`Tr2DeviceResourceAL.cpp:73-89`). Iterating once would skip resources.\r\n *\r\n * @param {number} memoryTypes A bit set of `Tr2ALMemoryType`.\r\n */\r\nexport function DestroyDeviceResources(memoryTypes)\r\n{\r\n  do\r\n  {\r\n    resourcesMutated = false;\r\n\r\n    for (const resource of [ ...ALL_RESOURCES ])\r\n    {\r\n      if (resource.IsResourceValid() && (resource.GetResourceMemoryClass() & memoryTypes) !== 0)\r\n      {\r\n        resource.Destroy();\r\n      }\r\n\r\n      if (resourcesMutated) break;\r\n    }\r\n  }\r\n  while (resourcesMutated);\r\n}\r\n"],"names":["fail","message","error","Error","code","Tr2ALMemoryType","Object","freeze","AL_MEMORY_VIDEO","AL_MEMORY_MANAGED","ALL_RESOURCES","Set","resourcesMutated","Tr2BaseDeviceResourceAL","_initProto","_applyDecs","impl","adapted","reason","e","_registered","constructor","add","IsResourceValid","name","GetResourceMemoryClass","Describe","_description","Destroy","delete","IsRegistered","EnumerateResources","operation","resource","GetResourceCount","size","DescribeDeviceResources","description","DestroyDeviceResources","memoryTypes"],"mappings":";;;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,SAASA,IAAIA,CAACC,OAAO,EACrB;EACE,MAAMC,KAAK,GAAG,IAAIC,KAAK,CAAC,CAAA,qBAAA,EAAwBF,OAAO,EAAE,CAAC;EAC1DC,KAAK,CAACE,IAAI,GAAG,yBAAyB;AACtC,EAAA,MAAMF,KAAK;AACb;;AAGA;MACaG,eAAe,GAAGC,MAAM,CAACC,MAAM,CAAC;AAC3C;EACAC,eAAe,EAAE,CAAC,IAAI,CAAC;AAEvB;EACAC,iBAAiB,EAAE,CAAC,IAAI;AAC1B,CAAC;;AAGD;AACA,MAAMC,aAAa,GAAG,IAAIC,GAAG,EAAE;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,gBAAgB,GAAG,KAAK;;AAG5B;AACA;AACA;AACA;AACA;AACA;AACO,MAAMC,uBAAuB,CACpC;AAAA,EAAA;IAAA,CAAAC,UAAA,CAAA,GAAAC,cAAA,CAAA,IAAA,EAAA,EAAA,EAAA,CAAA,CAAA,CAgBGC,IAAI,EAAJA,IAAI,CAACC,OAAO,EAAA,MAAA,EACZD,IAAI,CAACE,MAAM,CAAC,qFAAqF,CAAC,CAAA,EAAA,EAAA,EAAA,iBAAA,CAAA,EAAA,CAAA,CAWlGF,IAAI,EAAJA,IAAI,CAACC,OAAO,EAAA,MAAA,EACZD,IAAI,CAACE,MAAM,CAAC,qFAAqF,CAAC,CAAA,EAAA,EAAA,EAAA,wBAAA,CAAA,EAAA,CAAA,CAgBlGF,IAAI,EAAJA,IAAI,CAACC,OAAO,EAAA,MAAA,EACZD,IAAI,CAACE,MAAM,CAAC,yHAAyH,CAAC,CAAA,EAAA,EAAA,EAAA,UAAA,CAAA,EAAA,CAAA,CAWtIF,IAAI,EAAJA,IAAI,CAACC,OAAO,EAAA,MAAA,EACZD,IAAI,CAACE,MAAM,CAAC,oJAAoJ,CAAC,CAAA,EAAA,EAAA,EAAA,SAAA,CAAA,CAAA,CAAA,CAAAC,CAAA;AAAA;EAzDlKC,WAAW,IAAAN,UAAA,CAAA,IAAA,CAAA,EAAG,KAAK;;AAEnB;AACAO,EAAAA,WAAWA,GACX;AACEX,IAAAA,aAAa,CAACY,GAAG,CAAC,IAAI,CAAC;IACvB,IAAI,CAACF,WAAW,GAAG,IAAI;AACvBR,IAAAA,gBAAgB,GAAG,IAAI;AACzB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AAGEW,EAAAA,eAAeA,GACf;IACEvB,IAAI,CAAC,GAAG,IAAI,CAACqB,WAAW,CAACG,IAAI,iCAAiC,CAAC;AACjE,EAAA;;AAEA;AACF;AACA;AACA;AACA;AAGEC,EAAAA,sBAAsBA,GACtB;IACEzB,IAAI,CAAC,GAAG,IAAI,CAACqB,WAAW,CAACG,IAAI,wCAAwC,CAAC;AACxE,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EAGEE,QAAQA,CAACC,YAAY,EACrB,CACA;;AAEA;AACF;AACA;AACA;AACA;AACA;AAGEC,EAAAA,OAAOA,GACP;AACE,IAAA,IAAI,CAAC,IAAI,CAACR,WAAW,EAAE;AAEvBV,IAAAA,aAAa,CAACmB,MAAM,CAAC,IAAI,CAAC;IAC1B,IAAI,CAACT,WAAW,GAAG,KAAK;AACxBR,IAAAA,gBAAgB,GAAG,IAAI;AACzB,EAAA;;AAEA;AACAkB,EAAAA,YAAYA,GACZ;IACE,OAAO,IAAI,CAACV,WAAW;AACzB,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAOW,kBAAkBA,CAACC,SAAS,EACnC;IACE,IAAI,OAAOA,SAAS,KAAK,UAAU,EAAEhC,IAAI,CAAC,qCAAqC,CAAC;;AAEhF;AACA;IACA,KAAK,MAAMiC,QAAQ,IAAI,CAAE,GAAGvB,aAAa,CAAE,EAAEsB,SAAS,CAACC,QAAQ,CAAC;AAClE,EAAA;;AAEA;EACA,OAAOC,gBAAgBA,GACvB;IACE,OAAOxB,aAAa,CAACyB,IAAI;AAC3B,EAAA;AACF;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,uBAAuBA,CAACJ,SAAS,EACjD;EACE,IAAI,OAAOA,SAAS,KAAK,UAAU,EAAEhC,IAAI,CAAC,0CAA0C,CAAC;AAErF,EAAA,KAAK,MAAMiC,QAAQ,IAAI,CAAE,GAAGvB,aAAa,CAAE,EAC3C;AACE,IAAA,IAAI,CAACuB,QAAQ,CAACV,eAAe,EAAE,EAAE;IAEjC,MAAMc,WAAW,GAAG,EAAE;AAEtBJ,IAAAA,QAAQ,CAACP,QAAQ,CAACW,WAAW,CAAC;IAC9BL,SAAS,CAACC,QAAQ,CAACR,sBAAsB,EAAE,EAAEY,WAAW,CAAC;AAC3D,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,sBAAsBA,CAACC,WAAW,EAClD;EACE,GACA;AACE3B,IAAAA,gBAAgB,GAAG,KAAK;AAExB,IAAA,KAAK,MAAMqB,QAAQ,IAAI,CAAE,GAAGvB,aAAa,CAAE,EAC3C;AACE,MAAA,IAAIuB,QAAQ,CAACV,eAAe,EAAE,IAAI,CAACU,QAAQ,CAACR,sBAAsB,EAAE,GAAGc,WAAW,MAAM,CAAC,EACzF;QACEN,QAAQ,CAACL,OAAO,EAAE;AACpB,MAAA;AAEA,MAAA,IAAIhB,gBAAgB,EAAE;AACxB,IAAA;AACF,EAAA,CAAC,QACMA,gBAAgB;AACzB;;;;"}

package/dist/trinityal/Tr2DeviceResourceAL/Tr2DeviceResourceAL.js

@@ -0,0 +1,24 @@
+import { Tr2BaseDeviceResourceAL } from './Tr2BaseDeviceResourceAL.js';
+
+// Source: trinity/trinityal/Tr2DeviceResourceAL.h
+
+/**
+ * Forwards the resource registry interface to concrete backend resource methods.
+ *
+ * Carbon's CRTP cast selects the derived resource; JavaScript dispatches the
+ * same IsValid and GetMemoryClass calls through this without a template.
+ */
+class Tr2DeviceResourceAL extends Tr2BaseDeviceResourceAL {
+  /** @returns {boolean} Whether the concrete resource is valid. */
+  IsResourceValid() {
+    return this.IsValid();
+  }
+
+  /** @returns {number} The concrete resource's Tr2ALMemoryType. */
+  GetResourceMemoryClass() {
+    return this.GetMemoryClass();
+  }
+}
+
+export { Tr2DeviceResourceAL };
+//# sourceMappingURL=Tr2DeviceResourceAL.js.map

package/dist/trinityal/Tr2DeviceResourceAL/Tr2DeviceResourceAL.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tr2DeviceResourceAL.js","sources":["../../../../src/trinityal/Tr2DeviceResourceAL/Tr2DeviceResourceAL.js"],"sourcesContent":["// Source: trinity/trinityal/Tr2DeviceResourceAL.h\r\nimport { Tr2BaseDeviceResourceAL } from \"./Tr2BaseDeviceResourceAL.js\";\r\n\r\n/**\r\n * Forwards the resource registry interface to concrete backend resource methods.\r\n *\r\n * Carbon's CRTP cast selects the derived resource; JavaScript dispatches the\r\n * same IsValid and GetMemoryClass calls through this without a template.\r\n */\r\nexport class Tr2DeviceResourceAL extends Tr2BaseDeviceResourceAL\r\n{\r\n  /** @returns {boolean} Whether the concrete resource is valid. */\r\n  IsResourceValid()\r\n  {\r\n    return this.IsValid();\r\n  }\r\n\r\n  /** @returns {number} The concrete resource's Tr2ALMemoryType. */\r\n  GetResourceMemoryClass()\r\n  {\r\n    return this.GetMemoryClass();\r\n  }\r\n}\r\n"],"names":["Tr2DeviceResourceAL","Tr2BaseDeviceResourceAL","IsResourceValid","IsValid","GetResourceMemoryClass","GetMemoryClass"],"mappings":";;AAAA;;AAGA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMA,mBAAmB,SAASC,uBAAuB,CAChE;AACE;AACAC,EAAAA,eAAeA,GACf;AACE,IAAA,OAAO,IAAI,CAACC,OAAO,EAAE;AACvB,EAAA;;AAEA;AACAC,EAAAA,sBAAsBA,GACtB;AACE,IAAA,OAAO,IAAI,CAACC,cAAc,EAAE;AAC9B,EAAA;AACF;;;;"}

package/dist/trinityal/Tr2DrawUPHelper.js

@@ -1,9 +1,10 @@
 import { ALResult, Failed } from './ALResult.js';
-import { Tr2BufferDescriptionAL } from './stub/Tr2BufferALStub.js';
+import './stub/Tr2BufferALStub.js';
 import { CjsSchema } from '#schema';
 import '../global/consts/renderContext/formats.js';
 import { Topology } from '../global/consts/renderContext/pipeline.js';
 import { Tr2GpuUsage, Tr2CpuUsage } from '../global/consts/renderContext/resources.js';
+import { Tr2BufferDescriptionAL } from './Tr2BufferAL/Tr2BufferDescriptionAL.js';
 
 // Source: trinity/trinityal/Tr2DrawUPHelper.cpp, trinity/trinityal/Tr2DrawUPHelper.h
 //

package/dist/trinityal/Tr2DrawUPHelper.js.map

@@ -1 +1 @@
-{"version":3,"file":"Tr2DrawUPHelper.js","sources":["../../../src/trinityal/Tr2DrawUPHelper.js"],"sourcesContent":["// Source: trinity/trinityal/Tr2DrawUPHelper.cpp, trinity/trinityal/Tr2DrawUPHelper.h\n//\n// The DX9 `Draw*PrimitiveUP` calls let a caller hand the driver vertices and\n// indices out of its own memory, with nothing bound. No modern API can do that,\n// so Carbon emulates them ONCE, in a backend-agnostic helper every backend\n// delegates to: DX11 `m_drawUP` (`Tr2RenderContextDx11.cpp:1114-1139`), DX12\n// `m_drawUPHelper` (`Tr2RenderContextDx12.cpp:1199-1224`), Metal the same\n// (`Tr2RenderContextMetal.mm:558-571`). The emulation is the obvious one: copy\n// the caller's bytes into a scratch buffer, bind it, issue an ordinary draw.\n//\n// THE RING IS WHY IT IS A CLASS AND NOT A FUNCTION. Four vertex buffers, four\n// 16-bit index buffers, four 32-bit, each cursor advancing after use. A single\n// scratch buffer would be rewritten while a previous draw in the same frame\n// still referred to it, and the second draw would silently take the first's\n// geometry. Four is Carbon's number (`DRAW_UP_RING_SIZE`), and it is not a\n// guess about GPU latency: these draws come from line sets and debug geometry,\n// which issue a handful per frame.\n//\n// GROWTH IS ONE-WAY. A buffer too small for the request is recreated at the new\n// size and never shrinks again, so a frame that draws one big batch leaves the\n// slot large. Carbon does the same by calling `Create` on the existing\n// `Tr2BufferAL`; here the context's `CreateBuffer` hands back a fresh buffer of\n// the running backend's kind, because a shared file cannot name one.\n//\n// ONE SIGNATURE DIFFERENCE. Carbon's methods take the render context AND the\n// device, because its `Tr2BufferAL::Create` wants the device. Ours reaches the\n// device through the context, as every other buffer creation here does, so the\n// parameter is gone. Carbon's two indexed overloads differ only in index width;\n// this is one method that reads the width off the array it is given.\n\nimport { ALResult, Failed } from \"./ALResult.js\";\nimport { Tr2BufferDescriptionAL } from \"./stub/Tr2BufferALStub.js\";\nimport { CjsSchema } from \"#schema\";\nimport { Topology, Tr2CpuUsage, Tr2GpuUsage } from \"../global/consts/renderContext/index.js\";\n\n\n/** `DRAW_UP_RING_SIZE`. */\nconst RING_SIZE = 4;\n\n\n// Carbon's file-local `ComputeVertexCount` (`Tr2DrawUPHelper.cpp:13-33`).\n//\n// IT DISAGREES WITH THE RENDER CONTEXT'S OWN TABLE ON ONE ENTRY, and the\n// disagreement is Carbon's: a triangle fan counts as `primitiveCount` here and\n// as `primitiveCount + 2` where a fan is converted. Transcribed as written,\n// because no backend draws a fan at all - DX11 calls the topology invalid\n// (`Tr2RenderContextEnum.h:138`), Metal says NOT SUPPORTED\n// (`Tr2RenderContextMetal.mm:370`) - so the entry describes a path that cannot\n// be reached rather than a count anything relies on.\nconst VERTEX_COUNT = Object.freeze({\n  [Topology.TOP_TRIANGLES]: count => count * 3,\n  [Topology.TOP_TRIANGLE_STRIP]: count => count + 2,\n  [Topology.TOP_LINES]: count => count * 2,\n  [Topology.TOP_LINE_STRIP]: count => count + 1,\n  [Topology.TOP_POINTS]: count => count,\n  [Topology.TOP_TRIANGLE_FAN]: count => count\n});\n\n\n/**\n * Returns the caller's bytes as a byte view, whatever view they arrived in.\n *\n * @param {ArrayBufferView} data The caller's data.\n * @returns {Uint8Array} A view over the same bytes.\n */\nfunction bytesOf(data)\n{\n  return new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n}\n\n\n/**\n * Emulates the user-pointer draws with scratch buffers.\n *\n * A backend owns one of these and forwards its `Draw*PrimitiveUP` to it.\n */\nexport class Tr2DrawUPHelper\n{\n  /** m_nextRingVB. */\n  _nextRingVB = 0;\n\n  /** m_nextRingIB16. */\n  _nextRingIB16 = 0;\n\n  /** m_nextRingIB32. */\n  _nextRingIB32 = 0;\n\n  /** m_vertexUP. */\n  _vertexUP = new Array(RING_SIZE).fill(null);\n\n  /** m_indexUP16. */\n  _indexUP16 = new Array(RING_SIZE).fill(null);\n\n  /** m_indexUP32. */\n  _indexUP32 = new Array(RING_SIZE).fill(null);\n\n  /**\n   * Drops every scratch buffer and rewinds the ring.\n   *\n   * @returns {void}\n   */\n  Destroy()\n  {\n    for (const ring of [ this._vertexUP, this._indexUP16, this._indexUP32 ])\n    {\n      for (let i = 0; i !== RING_SIZE; ++i)\n      {\n        ring[i]?.Destroy();\n        ring[i] = null;\n      }\n    }\n\n    this._nextRingVB = 0;\n    this._nextRingIB16 = 0;\n    this._nextRingIB32 = 0;\n  }\n\n  /**\n   * Draws non-indexed from caller memory.\n   *\n   * @param {number} topology A `Topology` value; the context's bound topology.\n   * @param {number} primitiveCount Primitives to draw.\n   * @param {ArrayBufferView} vertexStreamZeroData The vertices.\n   * @param {number} vertexStreamZeroStride Bytes per vertex.\n   * @param {object} renderContext The render context to bind and draw through.\n   * @returns {number} An `ALResult` value.\n   */\n  DrawPrimitiveUP(topology, primitiveCount, vertexStreamZeroData, vertexStreamZeroStride, renderContext)\n  {\n    if (primitiveCount === 0) return ALResult.S_OK;\n\n    const vertexCount = this._VertexCount(topology, primitiveCount);\n\n    if (vertexCount === 0) return ALResult.E_INVALIDARG;\n\n    const slot = this._nextRingVB;\n    const filled = this._FillVertices(vertexCount, vertexStreamZeroData, vertexStreamZeroStride, slot, renderContext);\n\n    if (Failed(filled)) return filled;\n\n    if (!renderContext.SetStreamSource(0, this._vertexUP[slot], 0, vertexStreamZeroStride))\n    {\n      return ALResult.E_FAIL;\n    }\n\n    this._nextRingVB = (this._nextRingVB + 1) % RING_SIZE;\n\n    return renderContext.DrawPrimitive(0, primitiveCount) ? ALResult.S_OK : ALResult.E_FAIL;\n  }\n\n  /**\n   * Draws indexed from caller memory.\n   *\n   * @param {number} topology A `Topology` value; the context's bound topology.\n   * @param {number} numVertices Vertices the index data spans.\n   * @param {number} primitiveCount Primitives to draw.\n   * @param {Uint16Array|Uint32Array} indexData The indices; its width picks the ring.\n   * @param {ArrayBufferView} vertexStreamZeroData The vertices.\n   * @param {number} vertexStreamZeroStride Bytes per vertex.\n   * @param {object} renderContext The render context to bind and draw through.\n   * @returns {number} An `ALResult` value.\n   */\n  DrawIndexedPrimitiveUP(\n    topology,\n    numVertices,\n    primitiveCount,\n    indexData,\n    vertexStreamZeroData,\n    vertexStreamZeroStride,\n    renderContext\n  )\n  {\n    if (primitiveCount === 0) return ALResult.S_OK;\n    if (!indexData || !vertexStreamZeroData) return ALResult.E_INVALIDARG;\n\n    // Carbon picks the overload at the call site and so picks the ring with it.\n    // A JavaScript caller hands one array, so the ELEMENT WIDTH decides - which\n    // is the same information, read later.\n    const bytesPerIndex = indexData.BYTES_PER_ELEMENT;\n\n    if (bytesPerIndex !== 2 && bytesPerIndex !== 4) return ALResult.E_INVALIDARG;\n\n    const indexCount = this._VertexCount(topology, primitiveCount);\n\n    if (indexCount === 0) return ALResult.E_INVALIDARG;\n\n    const vertexSlot = this._nextRingVB;\n    const filled = this._FillVertices(\n      numVertices,\n      vertexStreamZeroData,\n      vertexStreamZeroStride,\n      vertexSlot,\n      renderContext\n    );\n\n    if (Failed(filled)) return filled;\n\n    if (!renderContext.SetStreamSource(0, this._vertexUP[vertexSlot], 0, vertexStreamZeroStride))\n    {\n      return ALResult.E_FAIL;\n    }\n\n    this._nextRingVB = (this._nextRingVB + 1) % RING_SIZE;\n\n    const ring = bytesPerIndex === 2 ? this._indexUP16 : this._indexUP32;\n    const indexSlot = bytesPerIndex === 2 ? this._nextRingIB16 : this._nextRingIB32;\n    const indices = this._FillIndices(indexCount, indexData, bytesPerIndex, ring, indexSlot, renderContext);\n\n    if (Failed(indices)) return indices;\n\n    if (!renderContext.SetIndices(ring[indexSlot], bytesPerIndex)) return ALResult.E_FAIL;\n\n    if (bytesPerIndex === 2) this._nextRingIB16 = (this._nextRingIB16 + 1) % RING_SIZE;\n    else this._nextRingIB32 = (this._nextRingIB32 + 1) % RING_SIZE;\n\n    return renderContext.DrawIndexedPrimitive(numVertices, 0, primitiveCount) ? ALResult.S_OK : ALResult.E_FAIL;\n  }\n\n  /**\n   * Carbon's `ComputeVertexCount`, refusing a topology it has no entry for.\n   *\n   * Carbon asserts and returns zero; an assert is not available here, so zero\n   * is the whole answer and the callers turn it into `E_INVALIDARG`.\n   *\n   * @param {number} topology A `Topology` value.\n   * @param {number} primitiveCount Primitives.\n   * @returns {number} Vertices, or zero for an unsupported topology.\n   */\n  _VertexCount(topology, primitiveCount)\n  {\n    return VERTEX_COUNT[topology]?.(primitiveCount) ?? 0;\n  }\n\n  /**\n   * `FillUPVertexBuffer`: grows the slot if needed, then copies the vertices in.\n   *\n   * @param {number} vertexCount Vertices to copy.\n   * @param {ArrayBufferView} vertexStreamZeroData The vertices.\n   * @param {number} vertexStreamZeroStride Bytes per vertex.\n   * @param {number} slot Ring slot to fill.\n   * @param {object} renderContext The render context.\n   * @returns {number} An `ALResult` value.\n   */\n  _FillVertices(vertexCount, vertexStreamZeroData, vertexStreamZeroStride, slot, renderContext)\n  {\n    const totalSize = vertexCount * vertexStreamZeroStride;\n\n    // Carbon returns S_OK for nothing to copy and goes on to bind and draw the\n    // slot anyway, so a zero-size request is not an error. It IS a no-draw here\n    // when the slot is still empty, because there is no buffer to bind.\n    if (totalSize === 0) return this._vertexUP[slot] ? ALResult.S_OK : ALResult.E_INVALIDARG;\n\n    if (!vertexStreamZeroData) return ALResult.E_INVALIDARG;\n    if (bytesOf(vertexStreamZeroData).length < totalSize) return ALResult.E_INVALIDARG;\n\n    const existing = this._vertexUP[slot];\n\n    if (!existing || existing.GetDesc().GetSizeInBytes() < totalSize)\n    {\n      // Carbon's own rounding: a four-byte stride over `(totalSize + 3) / 4`\n      // elements, so the buffer is described in words whatever the vertex\n      // stride is. The stride the DRAW uses comes from `SetStreamSource`, not\n      // from the description, so the two never have to agree.\n      const created = renderContext.CreateBuffer(\n        Tr2BufferDescriptionAL.FromStride(\n          4,\n          Math.floor((totalSize + 3) / 4),\n          Tr2GpuUsage.VERTEX_BUFFER,\n          Tr2CpuUsage.WRITE_OFTEN\n        )\n      );\n\n      if (!created) return ALResult.E_FAIL;\n\n      existing?.Destroy();\n      this._vertexUP[slot] = created;\n    }\n\n    return this._Copy(this._vertexUP[slot], bytesOf(vertexStreamZeroData).subarray(0, totalSize), renderContext);\n  }\n\n  /**\n   * `FillUPIndexBuffer`: grows the slot if needed, then copies the indices in.\n   *\n   * @param {number} indexCount Indices to copy.\n   * @param {Uint16Array|Uint32Array} indices The indices.\n   * @param {number} bytesPerIndex Index width in bytes.\n   * @param {Array<object|null>} ring The ring for this width.\n   * @param {number} slot Ring slot to fill.\n   * @param {object} renderContext The render context.\n   * @returns {number} An `ALResult` value.\n   */\n  _FillIndices(indexCount, indices, bytesPerIndex, ring, slot, renderContext)\n  {\n    if (indices.length < indexCount) return ALResult.E_INVALIDARG;\n\n    const existing = ring[slot];\n\n    // Carbon compares the COUNT here and the byte size for vertices\n    // (`:74,164`), which comes to the same thing while the width is fixed.\n    if (!existing || existing.GetDesc().count < indexCount)\n    {\n      const created = renderContext.CreateBuffer(\n        Tr2BufferDescriptionAL.FromStride(bytesPerIndex, indexCount, Tr2GpuUsage.INDEX_BUFFER, Tr2CpuUsage.WRITE_OFTEN)\n      );\n\n      if (!created) return ALResult.E_FAIL;\n\n      existing?.Destroy();\n      ring[slot] = created;\n    }\n\n    const source = new Uint8Array(indices.buffer, indices.byteOffset, indexCount * bytesPerIndex);\n\n    return this._Copy(ring[slot], source, renderContext);\n  }\n\n  /**\n   * Maps a scratch buffer, copies bytes into it and unmaps.\n   *\n   * @param {object} buffer The scratch buffer.\n   * @param {Uint8Array} source The bytes to copy.\n   * @param {object} renderContext The render context.\n   * @returns {number} An `ALResult` value.\n   */\n  _Copy(buffer, source, renderContext)\n  {\n    // `UpdateBuffer` is NOT the route: it refuses a `WRITE_OFTEN` buffer, as\n    // Carbon's stub does (`Tr2BufferALStub.cpp:138-141`), and these are all\n    // `WRITE_OFTEN`. The map family is the write path for this usage, which is\n    // what Carbon's helper uses too.\n    const { result, data } = buffer.MapForWriting(renderContext);\n\n    if (Failed(result) || !data)\n    {\n      buffer.UnmapForWriting(renderContext);\n\n      return Failed(result) ? result : ALResult.E_FAIL;\n    }\n\n    data.set(source);\n    buffer.UnmapForWriting(renderContext);\n\n    return ALResult.S_OK;\n  }\n}\n\n\n// DECLARED AS A CALL, NOT A DECORATOR. The abstraction layer is imported\n// straight from source by its tests - `#trinityal/...` resolves to `src/` - and\n// raw Node cannot parse decorator syntax, so a decorator here breaks every test\n// that reaches this file without a build first.\nCjsSchema.define(Tr2DrawUPHelper, { className: \"Tr2DrawUPHelper\", carbon: \"Tr2DrawUPHelper\" });\n"],"names":["RING_SIZE","VERTEX_COUNT","Object","freeze","Topology","TOP_TRIANGLES","count","TOP_TRIANGLE_STRIP","TOP_LINES","TOP_LINE_STRIP","TOP_POINTS","TOP_TRIANGLE_FAN","bytesOf","data","Uint8Array","buffer","byteOffset","byteLength","Tr2DrawUPHelper","_nextRingVB","_nextRingIB16","_nextRingIB32","_vertexUP","Array","fill","_indexUP16","_indexUP32","Destroy","ring","i","DrawPrimitiveUP","topology","primitiveCount","vertexStreamZeroData","vertexStreamZeroStride","renderContext","ALResult","S_OK","vertexCount","_VertexCount","E_INVALIDARG","slot","filled","_FillVertices","Failed","SetStreamSource","E_FAIL","DrawPrimitive","DrawIndexedPrimitiveUP","numVertices","indexData","bytesPerIndex","BYTES_PER_ELEMENT","indexCount","vertexSlot","indexSlot","indices","_FillIndices","SetIndices","DrawIndexedPrimitive","totalSize","length","existing","GetDesc","GetSizeInBytes","created","CreateBuffer","Tr2BufferDescriptionAL","FromStride","Math","floor","Tr2GpuUsage","VERTEX_BUFFER","Tr2CpuUsage","WRITE_OFTEN","_Copy","subarray","INDEX_BUFFER","source","result","MapForWriting","UnmapForWriting","set","CjsSchema","define","className","carbon"],"mappings":";;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAQA;AACA,MAAMA,SAAS,GAAG,CAAC;;AAGnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,YAAY,GAAGC,MAAM,CAACC,MAAM,CAAC;EACjC,CAACC,QAAQ,CAACC,aAAa,GAAGC,KAAK,IAAIA,KAAK,GAAG,CAAC;EAC5C,CAACF,QAAQ,CAACG,kBAAkB,GAAGD,KAAK,IAAIA,KAAK,GAAG,CAAC;EACjD,CAACF,QAAQ,CAACI,SAAS,GAAGF,KAAK,IAAIA,KAAK,GAAG,CAAC;EACxC,CAACF,QAAQ,CAACK,cAAc,GAAGH,KAAK,IAAIA,KAAK,GAAG,CAAC;AAC7C,EAAA,CAACF,QAAQ,CAACM,UAAU,GAAGJ,KAAK,IAAIA,KAAK;AACrC,EAAA,CAACF,QAAQ,CAACO,gBAAgB,GAAGL,KAAK,IAAIA;AACxC,CAAC,CAAC;;AAGF;AACA;AACA;AACA;AACA;AACA;AACA,SAASM,OAAOA,CAACC,IAAI,EACrB;AACE,EAAA,OAAO,IAAIC,UAAU,CAACD,IAAI,CAACE,MAAM,EAAEF,IAAI,CAACG,UAAU,EAAEH,IAAI,CAACI,UAAU,CAAC;AACtE;;AAGA;AACA;AACA;AACA;AACA;AACO,MAAMC,eAAe,CAC5B;AACE;AACAC,EAAAA,WAAW,GAAG,CAAC;;AAEf;AACAC,EAAAA,aAAa,GAAG,CAAC;;AAEjB;AACAC,EAAAA,aAAa,GAAG,CAAC;;AAEjB;EACAC,SAAS,GAAG,IAAIC,KAAK,CAACvB,SAAS,CAAC,CAACwB,IAAI,CAAC,IAAI,CAAC;;AAE3C;EACAC,UAAU,GAAG,IAAIF,KAAK,CAACvB,SAAS,CAAC,CAACwB,IAAI,CAAC,IAAI,CAAC;;AAE5C;EACAE,UAAU,GAAG,IAAIH,KAAK,CAACvB,SAAS,CAAC,CAACwB,IAAI,CAAC,IAAI,CAAC;;AAE5C;AACF;AACA;AACA;AACA;AACEG,EAAAA,OAAOA,GACP;AACE,IAAA,KAAK,MAAMC,IAAI,IAAI,CAAE,IAAI,CAACN,SAAS,EAAE,IAAI,CAACG,UAAU,EAAE,IAAI,CAACC,UAAU,CAAE,EACvE;MACE,KAAK,IAAIG,CAAC,GAAG,CAAC,EAAEA,CAAC,KAAK7B,SAAS,EAAE,EAAE6B,CAAC,EACpC;AACED,QAAAA,IAAI,CAACC,CAAC,CAAC,EAAEF,OAAO,EAAE;AAClBC,QAAAA,IAAI,CAACC,CAAC,CAAC,GAAG,IAAI;AAChB,MAAA;AACF,IAAA;IAEA,IAAI,CAACV,WAAW,GAAG,CAAC;IACpB,IAAI,CAACC,aAAa,GAAG,CAAC;IACtB,IAAI,CAACC,aAAa,GAAG,CAAC;AACxB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACES,eAAeA,CAACC,QAAQ,EAAEC,cAAc,EAAEC,oBAAoB,EAAEC,sBAAsB,EAAEC,aAAa,EACrG;AACE,IAAA,IAAIH,cAAc,KAAK,CAAC,EAAE,OAAOI,QAAQ,CAACC,IAAI;IAE9C,MAAMC,WAAW,GAAG,IAAI,CAACC,YAAY,CAACR,QAAQ,EAAEC,cAAc,CAAC;AAE/D,IAAA,IAAIM,WAAW,KAAK,CAAC,EAAE,OAAOF,QAAQ,CAACI,YAAY;AAEnD,IAAA,MAAMC,IAAI,GAAG,IAAI,CAACtB,WAAW;AAC7B,IAAA,MAAMuB,MAAM,GAAG,IAAI,CAACC,aAAa,CAACL,WAAW,EAAEL,oBAAoB,EAAEC,sBAAsB,EAAEO,IAAI,EAAEN,aAAa,CAAC;AAEjH,IAAA,IAAIS,MAAM,CAACF,MAAM,CAAC,EAAE,OAAOA,MAAM;AAEjC,IAAA,IAAI,CAACP,aAAa,CAACU,eAAe,CAAC,CAAC,EAAE,IAAI,CAACvB,SAAS,CAACmB,IAAI,CAAC,EAAE,CAAC,EAAEP,sBAAsB,CAAC,EACtF;MACE,OAAOE,QAAQ,CAACU,MAAM;AACxB,IAAA;IAEA,IAAI,CAAC3B,WAAW,GAAG,CAAC,IAAI,CAACA,WAAW,GAAG,CAAC,IAAInB,SAAS;AAErD,IAAA,OAAOmC,aAAa,CAACY,aAAa,CAAC,CAAC,EAAEf,cAAc,CAAC,GAAGI,QAAQ,CAACC,IAAI,GAAGD,QAAQ,CAACU,MAAM;AACzF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEE,EAAAA,sBAAsBA,CACpBjB,QAAQ,EACRkB,WAAW,EACXjB,cAAc,EACdkB,SAAS,EACTjB,oBAAoB,EACpBC,sBAAsB,EACtBC,aAAa,EAEf;AACE,IAAA,IAAIH,cAAc,KAAK,CAAC,EAAE,OAAOI,QAAQ,CAACC,IAAI;IAC9C,IAAI,CAACa,SAAS,IAAI,CAACjB,oBAAoB,EAAE,OAAOG,QAAQ,CAACI,YAAY;;AAErE;AACA;AACA;AACA,IAAA,MAAMW,aAAa,GAAGD,SAAS,CAACE,iBAAiB;IAEjD,IAAID,aAAa,KAAK,CAAC,IAAIA,aAAa,KAAK,CAAC,EAAE,OAAOf,QAAQ,CAACI,YAAY;IAE5E,MAAMa,UAAU,GAAG,IAAI,CAACd,YAAY,CAACR,QAAQ,EAAEC,cAAc,CAAC;AAE9D,IAAA,IAAIqB,UAAU,KAAK,CAAC,EAAE,OAAOjB,QAAQ,CAACI,YAAY;AAElD,IAAA,MAAMc,UAAU,GAAG,IAAI,CAACnC,WAAW;AACnC,IAAA,MAAMuB,MAAM,GAAG,IAAI,CAACC,aAAa,CAC/BM,WAAW,EACXhB,oBAAoB,EACpBC,sBAAsB,EACtBoB,UAAU,EACVnB,aACF,CAAC;AAED,IAAA,IAAIS,MAAM,CAACF,MAAM,CAAC,EAAE,OAAOA,MAAM;AAEjC,IAAA,IAAI,CAACP,aAAa,CAACU,eAAe,CAAC,CAAC,EAAE,IAAI,CAACvB,SAAS,CAACgC,UAAU,CAAC,EAAE,CAAC,EAAEpB,sBAAsB,CAAC,EAC5F;MACE,OAAOE,QAAQ,CAACU,MAAM;AACxB,IAAA;IAEA,IAAI,CAAC3B,WAAW,GAAG,CAAC,IAAI,CAACA,WAAW,GAAG,CAAC,IAAInB,SAAS;AAErD,IAAA,MAAM4B,IAAI,GAAGuB,aAAa,KAAK,CAAC,GAAG,IAAI,CAAC1B,UAAU,GAAG,IAAI,CAACC,UAAU;AACpE,IAAA,MAAM6B,SAAS,GAAGJ,aAAa,KAAK,CAAC,GAAG,IAAI,CAAC/B,aAAa,GAAG,IAAI,CAACC,aAAa;AAC/E,IAAA,MAAMmC,OAAO,GAAG,IAAI,CAACC,YAAY,CAACJ,UAAU,EAAEH,SAAS,EAAEC,aAAa,EAAEvB,IAAI,EAAE2B,SAAS,EAAEpB,aAAa,CAAC;AAEvG,IAAA,IAAIS,MAAM,CAACY,OAAO,CAAC,EAAE,OAAOA,OAAO;AAEnC,IAAA,IAAI,CAACrB,aAAa,CAACuB,UAAU,CAAC9B,IAAI,CAAC2B,SAAS,CAAC,EAAEJ,aAAa,CAAC,EAAE,OAAOf,QAAQ,CAACU,MAAM;AAErF,IAAA,IAAIK,aAAa,KAAK,CAAC,EAAE,IAAI,CAAC/B,aAAa,GAAG,CAAC,IAAI,CAACA,aAAa,GAAG,CAAC,IAAIpB,SAAS,CAAC,KAC9E,IAAI,CAACqB,aAAa,GAAG,CAAC,IAAI,CAACA,aAAa,GAAG,CAAC,IAAIrB,SAAS;AAE9D,IAAA,OAAOmC,aAAa,CAACwB,oBAAoB,CAACV,WAAW,EAAE,CAAC,EAAEjB,cAAc,CAAC,GAAGI,QAAQ,CAACC,IAAI,GAAGD,QAAQ,CAACU,MAAM;AAC7G,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEP,EAAAA,YAAYA,CAACR,QAAQ,EAAEC,cAAc,EACrC;IACE,OAAO/B,YAAY,CAAC8B,QAAQ,CAAC,GAAGC,cAAc,CAAC,IAAI,CAAC;AACtD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEW,aAAaA,CAACL,WAAW,EAAEL,oBAAoB,EAAEC,sBAAsB,EAAEO,IAAI,EAAEN,aAAa,EAC5F;AACE,IAAA,MAAMyB,SAAS,GAAGtB,WAAW,GAAGJ,sBAAsB;;AAEtD;AACA;AACA;AACA,IAAA,IAAI0B,SAAS,KAAK,CAAC,EAAE,OAAO,IAAI,CAACtC,SAAS,CAACmB,IAAI,CAAC,GAAGL,QAAQ,CAACC,IAAI,GAAGD,QAAQ,CAACI,YAAY;AAExF,IAAA,IAAI,CAACP,oBAAoB,EAAE,OAAOG,QAAQ,CAACI,YAAY;AACvD,IAAA,IAAI5B,OAAO,CAACqB,oBAAoB,CAAC,CAAC4B,MAAM,GAAGD,SAAS,EAAE,OAAOxB,QAAQ,CAACI,YAAY;AAElF,IAAA,MAAMsB,QAAQ,GAAG,IAAI,CAACxC,SAAS,CAACmB,IAAI,CAAC;AAErC,IAAA,IAAI,CAACqB,QAAQ,IAAIA,QAAQ,CAACC,OAAO,EAAE,CAACC,cAAc,EAAE,GAAGJ,SAAS,EAChE;AACE;AACA;AACA;AACA;AACA,MAAA,MAAMK,OAAO,GAAG9B,aAAa,CAAC+B,YAAY,CACxCC,sBAAsB,CAACC,UAAU,CAC/B,CAAC,EACDC,IAAI,CAACC,KAAK,CAAC,CAACV,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,EAC/BW,WAAW,CAACC,aAAa,EACzBC,WAAW,CAACC,WACd,CACF,CAAC;AAED,MAAA,IAAI,CAACT,OAAO,EAAE,OAAO7B,QAAQ,CAACU,MAAM;MAEpCgB,QAAQ,EAAEnC,OAAO,EAAE;AACnB,MAAA,IAAI,CAACL,SAAS,CAACmB,IAAI,CAAC,GAAGwB,OAAO;AAChC,IAAA;IAEA,OAAO,IAAI,CAACU,KAAK,CAAC,IAAI,CAACrD,SAAS,CAACmB,IAAI,CAAC,EAAE7B,OAAO,CAACqB,oBAAoB,CAAC,CAAC2C,QAAQ,CAAC,CAAC,EAAEhB,SAAS,CAAC,EAAEzB,aAAa,CAAC;AAC9G,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEsB,EAAAA,YAAYA,CAACJ,UAAU,EAAEG,OAAO,EAAEL,aAAa,EAAEvB,IAAI,EAAEa,IAAI,EAAEN,aAAa,EAC1E;IACE,IAAIqB,OAAO,CAACK,MAAM,GAAGR,UAAU,EAAE,OAAOjB,QAAQ,CAACI,YAAY;AAE7D,IAAA,MAAMsB,QAAQ,GAAGlC,IAAI,CAACa,IAAI,CAAC;;AAE3B;AACA;AACA,IAAA,IAAI,CAACqB,QAAQ,IAAIA,QAAQ,CAACC,OAAO,EAAE,CAACzD,KAAK,GAAG+C,UAAU,EACtD;MACE,MAAMY,OAAO,GAAG9B,aAAa,CAAC+B,YAAY,CACxCC,sBAAsB,CAACC,UAAU,CAACjB,aAAa,EAAEE,UAAU,EAAEkB,WAAW,CAACM,YAAY,EAAEJ,WAAW,CAACC,WAAW,CAChH,CAAC;AAED,MAAA,IAAI,CAACT,OAAO,EAAE,OAAO7B,QAAQ,CAACU,MAAM;MAEpCgB,QAAQ,EAAEnC,OAAO,EAAE;AACnBC,MAAAA,IAAI,CAACa,IAAI,CAAC,GAAGwB,OAAO;AACtB,IAAA;AAEA,IAAA,MAAMa,MAAM,GAAG,IAAIhE,UAAU,CAAC0C,OAAO,CAACzC,MAAM,EAAEyC,OAAO,CAACxC,UAAU,EAAEqC,UAAU,GAAGF,aAAa,CAAC;AAE7F,IAAA,OAAO,IAAI,CAACwB,KAAK,CAAC/C,IAAI,CAACa,IAAI,CAAC,EAAEqC,MAAM,EAAE3C,aAAa,CAAC;AACtD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACEwC,EAAAA,KAAKA,CAAC5D,MAAM,EAAE+D,MAAM,EAAE3C,aAAa,EACnC;AACE;AACA;AACA;AACA;IACA,MAAM;MAAE4C,MAAM;AAAElE,MAAAA;AAAK,KAAC,GAAGE,MAAM,CAACiE,aAAa,CAAC7C,aAAa,CAAC;AAE5D,IAAA,IAAIS,MAAM,CAACmC,MAAM,CAAC,IAAI,CAAClE,IAAI,EAC3B;AACEE,MAAAA,MAAM,CAACkE,eAAe,CAAC9C,aAAa,CAAC;MAErC,OAAOS,MAAM,CAACmC,MAAM,CAAC,GAAGA,MAAM,GAAG3C,QAAQ,CAACU,MAAM;AAClD,IAAA;AAEAjC,IAAAA,IAAI,CAACqE,GAAG,CAACJ,MAAM,CAAC;AAChB/D,IAAAA,MAAM,CAACkE,eAAe,CAAC9C,aAAa,CAAC;IAErC,OAAOC,QAAQ,CAACC,IAAI;AACtB,EAAA;AACF;;AAGA;AACA;AACA;AACA;AACA8C,SAAS,CAACC,MAAM,CAAClE,eAAe,EAAE;AAAEmE,EAAAA,SAAS,EAAE,iBAAiB;AAAEC,EAAAA,MAAM,EAAE;AAAkB,CAAC,CAAC;;;;"}
+{"version":3,"file":"Tr2DrawUPHelper.js","sources":["../../../src/trinityal/Tr2DrawUPHelper.js"],"sourcesContent":["// Source: trinity/trinityal/Tr2DrawUPHelper.cpp, trinity/trinityal/Tr2DrawUPHelper.h\n//\n// The DX9 `Draw*PrimitiveUP` calls let a caller hand the driver vertices and\n// indices out of its own memory, with nothing bound. No modern API can do that,\n// so Carbon emulates them ONCE, in a backend-agnostic helper every backend\n// delegates to: DX11 `m_drawUP` (`Tr2RenderContextDx11.cpp:1114-1139`), DX12\n// `m_drawUPHelper` (`Tr2RenderContextDx12.cpp:1199-1224`), Metal the same\n// (`Tr2RenderContextMetal.mm:558-571`). The emulation is the obvious one: copy\n// the caller's bytes into a scratch buffer, bind it, issue an ordinary draw.\n//\n// THE RING IS WHY IT IS A CLASS AND NOT A FUNCTION. Four vertex buffers, four\n// 16-bit index buffers, four 32-bit, each cursor advancing after use. A single\n// scratch buffer would be rewritten while a previous draw in the same frame\n// still referred to it, and the second draw would silently take the first's\n// geometry. Four is Carbon's number (`DRAW_UP_RING_SIZE`), and it is not a\n// guess about GPU latency: these draws come from line sets and debug geometry,\n// which issue a handful per frame.\n//\n// GROWTH IS ONE-WAY. A buffer too small for the request is recreated at the new\n// size and never shrinks again, so a frame that draws one big batch leaves the\n// slot large. Carbon does the same by calling `Create` on the existing\n// `Tr2BufferAL`; here the context's `CreateBuffer` hands back a fresh buffer of\n// the running backend's kind, because a shared file cannot name one.\n//\n// ONE SIGNATURE DIFFERENCE. Carbon's methods take the render context AND the\n// device, because its `Tr2BufferAL::Create` wants the device. Ours reaches the\n// device through the context, as every other buffer creation here does, so the\n// parameter is gone. Carbon's two indexed overloads differ only in index width;\n// this is one method that reads the width off the array it is given.\n\nimport { ALResult, Failed } from \"./ALResult.js\";\nimport { Tr2BufferDescriptionAL } from \"./stub/Tr2BufferALStub.js\";\nimport { CjsSchema } from \"#schema\";\nimport { Topology, Tr2CpuUsage, Tr2GpuUsage } from \"../global/consts/renderContext/index.js\";\n\n\n/** `DRAW_UP_RING_SIZE`. */\nconst RING_SIZE = 4;\n\n\n// Carbon's file-local `ComputeVertexCount` (`Tr2DrawUPHelper.cpp:13-33`).\n//\n// IT DISAGREES WITH THE RENDER CONTEXT'S OWN TABLE ON ONE ENTRY, and the\n// disagreement is Carbon's: a triangle fan counts as `primitiveCount` here and\n// as `primitiveCount + 2` where a fan is converted. Transcribed as written,\n// because no backend draws a fan at all - DX11 calls the topology invalid\n// (`Tr2RenderContextEnum.h:138`), Metal says NOT SUPPORTED\n// (`Tr2RenderContextMetal.mm:370`) - so the entry describes a path that cannot\n// be reached rather than a count anything relies on.\nconst VERTEX_COUNT = Object.freeze({\n  [Topology.TOP_TRIANGLES]: count => count * 3,\n  [Topology.TOP_TRIANGLE_STRIP]: count => count + 2,\n  [Topology.TOP_LINES]: count => count * 2,\n  [Topology.TOP_LINE_STRIP]: count => count + 1,\n  [Topology.TOP_POINTS]: count => count,\n  [Topology.TOP_TRIANGLE_FAN]: count => count\n});\n\n\n/**\n * Returns the caller's bytes as a byte view, whatever view they arrived in.\n *\n * @param {ArrayBufferView} data The caller's data.\n * @returns {Uint8Array} A view over the same bytes.\n */\nfunction bytesOf(data)\n{\n  return new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n}\n\n\n/**\n * Emulates the user-pointer draws with scratch buffers.\n *\n * A backend owns one of these and forwards its `Draw*PrimitiveUP` to it.\n */\nexport class Tr2DrawUPHelper\n{\n  /** m_nextRingVB. */\n  _nextRingVB = 0;\n\n  /** m_nextRingIB16. */\n  _nextRingIB16 = 0;\n\n  /** m_nextRingIB32. */\n  _nextRingIB32 = 0;\n\n  /** m_vertexUP. */\n  _vertexUP = new Array(RING_SIZE).fill(null);\n\n  /** m_indexUP16. */\n  _indexUP16 = new Array(RING_SIZE).fill(null);\n\n  /** m_indexUP32. */\n  _indexUP32 = new Array(RING_SIZE).fill(null);\n\n  /**\n   * Drops every scratch buffer and rewinds the ring.\n   *\n   * @returns {void}\n   */\n  Destroy()\n  {\n    for (const ring of [ this._vertexUP, this._indexUP16, this._indexUP32 ])\n    {\n      for (let i = 0; i !== RING_SIZE; ++i)\n      {\n        ring[i]?.Destroy();\n        ring[i] = null;\n      }\n    }\n\n    this._nextRingVB = 0;\n    this._nextRingIB16 = 0;\n    this._nextRingIB32 = 0;\n  }\n\n  /**\n   * Draws non-indexed from caller memory.\n   *\n   * @param {number} topology A `Topology` value; the context's bound topology.\n   * @param {number} primitiveCount Primitives to draw.\n   * @param {ArrayBufferView} vertexStreamZeroData The vertices.\n   * @param {number} vertexStreamZeroStride Bytes per vertex.\n   * @param {object} renderContext The render context to bind and draw through.\n   * @returns {number} An `ALResult` value.\n   */\n  DrawPrimitiveUP(topology, primitiveCount, vertexStreamZeroData, vertexStreamZeroStride, renderContext)\n  {\n    if (primitiveCount === 0) return ALResult.S_OK;\n\n    const vertexCount = this._VertexCount(topology, primitiveCount);\n\n    if (vertexCount === 0) return ALResult.E_INVALIDARG;\n\n    const slot = this._nextRingVB;\n    const filled = this._FillVertices(vertexCount, vertexStreamZeroData, vertexStreamZeroStride, slot, renderContext);\n\n    if (Failed(filled)) return filled;\n\n    if (!renderContext.SetStreamSource(0, this._vertexUP[slot], 0, vertexStreamZeroStride))\n    {\n      return ALResult.E_FAIL;\n    }\n\n    this._nextRingVB = (this._nextRingVB + 1) % RING_SIZE;\n\n    return renderContext.DrawPrimitive(0, primitiveCount) ? ALResult.S_OK : ALResult.E_FAIL;\n  }\n\n  /**\n   * Draws indexed from caller memory.\n   *\n   * @param {number} topology A `Topology` value; the context's bound topology.\n   * @param {number} numVertices Vertices the index data spans.\n   * @param {number} primitiveCount Primitives to draw.\n   * @param {Uint16Array|Uint32Array} indexData The indices; its width picks the ring.\n   * @param {ArrayBufferView} vertexStreamZeroData The vertices.\n   * @param {number} vertexStreamZeroStride Bytes per vertex.\n   * @param {object} renderContext The render context to bind and draw through.\n   * @returns {number} An `ALResult` value.\n   */\n  DrawIndexedPrimitiveUP(\n    topology,\n    numVertices,\n    primitiveCount,\n    indexData,\n    vertexStreamZeroData,\n    vertexStreamZeroStride,\n    renderContext\n  )\n  {\n    if (primitiveCount === 0) return ALResult.S_OK;\n    if (!indexData || !vertexStreamZeroData) return ALResult.E_INVALIDARG;\n\n    // Carbon picks the overload at the call site and so picks the ring with it.\n    // A JavaScript caller hands one array, so the ELEMENT WIDTH decides - which\n    // is the same information, read later.\n    const bytesPerIndex = indexData.BYTES_PER_ELEMENT;\n\n    if (bytesPerIndex !== 2 && bytesPerIndex !== 4) return ALResult.E_INVALIDARG;\n\n    const indexCount = this._VertexCount(topology, primitiveCount);\n\n    if (indexCount === 0) return ALResult.E_INVALIDARG;\n\n    const vertexSlot = this._nextRingVB;\n    const filled = this._FillVertices(\n      numVertices,\n      vertexStreamZeroData,\n      vertexStreamZeroStride,\n      vertexSlot,\n      renderContext\n    );\n\n    if (Failed(filled)) return filled;\n\n    if (!renderContext.SetStreamSource(0, this._vertexUP[vertexSlot], 0, vertexStreamZeroStride))\n    {\n      return ALResult.E_FAIL;\n    }\n\n    this._nextRingVB = (this._nextRingVB + 1) % RING_SIZE;\n\n    const ring = bytesPerIndex === 2 ? this._indexUP16 : this._indexUP32;\n    const indexSlot = bytesPerIndex === 2 ? this._nextRingIB16 : this._nextRingIB32;\n    const indices = this._FillIndices(indexCount, indexData, bytesPerIndex, ring, indexSlot, renderContext);\n\n    if (Failed(indices)) return indices;\n\n    if (!renderContext.SetIndices(ring[indexSlot], bytesPerIndex)) return ALResult.E_FAIL;\n\n    if (bytesPerIndex === 2) this._nextRingIB16 = (this._nextRingIB16 + 1) % RING_SIZE;\n    else this._nextRingIB32 = (this._nextRingIB32 + 1) % RING_SIZE;\n\n    return renderContext.DrawIndexedPrimitive(numVertices, 0, primitiveCount) ? ALResult.S_OK : ALResult.E_FAIL;\n  }\n\n  /**\n   * Carbon's `ComputeVertexCount`, refusing a topology it has no entry for.\n   *\n   * Carbon asserts and returns zero; an assert is not available here, so zero\n   * is the whole answer and the callers turn it into `E_INVALIDARG`.\n   *\n   * @param {number} topology A `Topology` value.\n   * @param {number} primitiveCount Primitives.\n   * @returns {number} Vertices, or zero for an unsupported topology.\n   */\n  _VertexCount(topology, primitiveCount)\n  {\n    return VERTEX_COUNT[topology]?.(primitiveCount) ?? 0;\n  }\n\n  /**\n   * `FillUPVertexBuffer`: grows the slot if needed, then copies the vertices in.\n   *\n   * @param {number} vertexCount Vertices to copy.\n   * @param {ArrayBufferView} vertexStreamZeroData The vertices.\n   * @param {number} vertexStreamZeroStride Bytes per vertex.\n   * @param {number} slot Ring slot to fill.\n   * @param {object} renderContext The render context.\n   * @returns {number} An `ALResult` value.\n   */\n  _FillVertices(vertexCount, vertexStreamZeroData, vertexStreamZeroStride, slot, renderContext)\n  {\n    const totalSize = vertexCount * vertexStreamZeroStride;\n\n    // Carbon returns S_OK for nothing to copy and goes on to bind and draw the\n    // slot anyway, so a zero-size request is not an error. It IS a no-draw here\n    // when the slot is still empty, because there is no buffer to bind.\n    if (totalSize === 0) return this._vertexUP[slot] ? ALResult.S_OK : ALResult.E_INVALIDARG;\n\n    if (!vertexStreamZeroData) return ALResult.E_INVALIDARG;\n    if (bytesOf(vertexStreamZeroData).length < totalSize) return ALResult.E_INVALIDARG;\n\n    const existing = this._vertexUP[slot];\n\n    if (!existing || existing.GetDesc().GetSizeInBytes() < totalSize)\n    {\n      // Carbon's own rounding: a four-byte stride over `(totalSize + 3) / 4`\n      // elements, so the buffer is described in words whatever the vertex\n      // stride is. The stride the DRAW uses comes from `SetStreamSource`, not\n      // from the description, so the two never have to agree.\n      const created = renderContext.CreateBuffer(\n        Tr2BufferDescriptionAL.FromStride(\n          4,\n          Math.floor((totalSize + 3) / 4),\n          Tr2GpuUsage.VERTEX_BUFFER,\n          Tr2CpuUsage.WRITE_OFTEN\n        )\n      );\n\n      if (!created) return ALResult.E_FAIL;\n\n      existing?.Destroy();\n      this._vertexUP[slot] = created;\n    }\n\n    return this._Copy(this._vertexUP[slot], bytesOf(vertexStreamZeroData).subarray(0, totalSize), renderContext);\n  }\n\n  /**\n   * `FillUPIndexBuffer`: grows the slot if needed, then copies the indices in.\n   *\n   * @param {number} indexCount Indices to copy.\n   * @param {Uint16Array|Uint32Array} indices The indices.\n   * @param {number} bytesPerIndex Index width in bytes.\n   * @param {Array<object|null>} ring The ring for this width.\n   * @param {number} slot Ring slot to fill.\n   * @param {object} renderContext The render context.\n   * @returns {number} An `ALResult` value.\n   */\n  _FillIndices(indexCount, indices, bytesPerIndex, ring, slot, renderContext)\n  {\n    if (indices.length < indexCount) return ALResult.E_INVALIDARG;\n\n    const existing = ring[slot];\n\n    // Carbon compares the COUNT here and the byte size for vertices\n    // (`:74,164`), which comes to the same thing while the width is fixed.\n    if (!existing || existing.GetDesc().count < indexCount)\n    {\n      const created = renderContext.CreateBuffer(\n        Tr2BufferDescriptionAL.FromStride(bytesPerIndex, indexCount, Tr2GpuUsage.INDEX_BUFFER, Tr2CpuUsage.WRITE_OFTEN)\n      );\n\n      if (!created) return ALResult.E_FAIL;\n\n      existing?.Destroy();\n      ring[slot] = created;\n    }\n\n    const source = new Uint8Array(indices.buffer, indices.byteOffset, indexCount * bytesPerIndex);\n\n    return this._Copy(ring[slot], source, renderContext);\n  }\n\n  /**\n   * Maps a scratch buffer, copies bytes into it and unmaps.\n   *\n   * @param {object} buffer The scratch buffer.\n   * @param {Uint8Array} source The bytes to copy.\n   * @param {object} renderContext The render context.\n   * @returns {number} An `ALResult` value.\n   */\n  _Copy(buffer, source, renderContext)\n  {\n    // `UpdateBuffer` is NOT the route: it refuses a `WRITE_OFTEN` buffer, as\n    // Carbon's stub does (`Tr2BufferALStub.cpp:138-141`), and these are all\n    // `WRITE_OFTEN`. The map family is the write path for this usage, which is\n    // what Carbon's helper uses too.\n    const { result, data } = buffer.MapForWriting(renderContext);\n\n    if (Failed(result) || !data)\n    {\n      buffer.UnmapForWriting(renderContext);\n\n      return Failed(result) ? result : ALResult.E_FAIL;\n    }\n\n    data.set(source);\n    buffer.UnmapForWriting(renderContext);\n\n    return ALResult.S_OK;\n  }\n}\n\n\n// DECLARED AS A CALL, NOT A DECORATOR. The abstraction layer is imported\n// straight from source by its tests - `#trinityal/...` resolves to `src/` - and\n// raw Node cannot parse decorator syntax, so a decorator here breaks every test\n// that reaches this file without a build first.\nCjsSchema.define(Tr2DrawUPHelper, { className: \"Tr2DrawUPHelper\", carbon: \"Tr2DrawUPHelper\" });\n"],"names":["RING_SIZE","VERTEX_COUNT","Object","freeze","Topology","TOP_TRIANGLES","count","TOP_TRIANGLE_STRIP","TOP_LINES","TOP_LINE_STRIP","TOP_POINTS","TOP_TRIANGLE_FAN","bytesOf","data","Uint8Array","buffer","byteOffset","byteLength","Tr2DrawUPHelper","_nextRingVB","_nextRingIB16","_nextRingIB32","_vertexUP","Array","fill","_indexUP16","_indexUP32","Destroy","ring","i","DrawPrimitiveUP","topology","primitiveCount","vertexStreamZeroData","vertexStreamZeroStride","renderContext","ALResult","S_OK","vertexCount","_VertexCount","E_INVALIDARG","slot","filled","_FillVertices","Failed","SetStreamSource","E_FAIL","DrawPrimitive","DrawIndexedPrimitiveUP","numVertices","indexData","bytesPerIndex","BYTES_PER_ELEMENT","indexCount","vertexSlot","indexSlot","indices","_FillIndices","SetIndices","DrawIndexedPrimitive","totalSize","length","existing","GetDesc","GetSizeInBytes","created","CreateBuffer","Tr2BufferDescriptionAL","FromStride","Math","floor","Tr2GpuUsage","VERTEX_BUFFER","Tr2CpuUsage","WRITE_OFTEN","_Copy","subarray","INDEX_BUFFER","source","result","MapForWriting","UnmapForWriting","set","CjsSchema","define","className","carbon"],"mappings":";;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAQA;AACA,MAAMA,SAAS,GAAG,CAAC;;AAGnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,YAAY,GAAGC,MAAM,CAACC,MAAM,CAAC;EACjC,CAACC,QAAQ,CAACC,aAAa,GAAGC,KAAK,IAAIA,KAAK,GAAG,CAAC;EAC5C,CAACF,QAAQ,CAACG,kBAAkB,GAAGD,KAAK,IAAIA,KAAK,GAAG,CAAC;EACjD,CAACF,QAAQ,CAACI,SAAS,GAAGF,KAAK,IAAIA,KAAK,GAAG,CAAC;EACxC,CAACF,QAAQ,CAACK,cAAc,GAAGH,KAAK,IAAIA,KAAK,GAAG,CAAC;AAC7C,EAAA,CAACF,QAAQ,CAACM,UAAU,GAAGJ,KAAK,IAAIA,KAAK;AACrC,EAAA,CAACF,QAAQ,CAACO,gBAAgB,GAAGL,KAAK,IAAIA;AACxC,CAAC,CAAC;;AAGF;AACA;AACA;AACA;AACA;AACA;AACA,SAASM,OAAOA,CAACC,IAAI,EACrB;AACE,EAAA,OAAO,IAAIC,UAAU,CAACD,IAAI,CAACE,MAAM,EAAEF,IAAI,CAACG,UAAU,EAAEH,IAAI,CAACI,UAAU,CAAC;AACtE;;AAGA;AACA;AACA;AACA;AACA;AACO,MAAMC,eAAe,CAC5B;AACE;AACAC,EAAAA,WAAW,GAAG,CAAC;;AAEf;AACAC,EAAAA,aAAa,GAAG,CAAC;;AAEjB;AACAC,EAAAA,aAAa,GAAG,CAAC;;AAEjB;EACAC,SAAS,GAAG,IAAIC,KAAK,CAACvB,SAAS,CAAC,CAACwB,IAAI,CAAC,IAAI,CAAC;;AAE3C;EACAC,UAAU,GAAG,IAAIF,KAAK,CAACvB,SAAS,CAAC,CAACwB,IAAI,CAAC,IAAI,CAAC;;AAE5C;EACAE,UAAU,GAAG,IAAIH,KAAK,CAACvB,SAAS,CAAC,CAACwB,IAAI,CAAC,IAAI,CAAC;;AAE5C;AACF;AACA;AACA;AACA;AACEG,EAAAA,OAAOA,GACP;AACE,IAAA,KAAK,MAAMC,IAAI,IAAI,CAAE,IAAI,CAACN,SAAS,EAAE,IAAI,CAACG,UAAU,EAAE,IAAI,CAACC,UAAU,CAAE,EACvE;MACE,KAAK,IAAIG,CAAC,GAAG,CAAC,EAAEA,CAAC,KAAK7B,SAAS,EAAE,EAAE6B,CAAC,EACpC;AACED,QAAAA,IAAI,CAACC,CAAC,CAAC,EAAEF,OAAO,EAAE;AAClBC,QAAAA,IAAI,CAACC,CAAC,CAAC,GAAG,IAAI;AAChB,MAAA;AACF,IAAA;IAEA,IAAI,CAACV,WAAW,GAAG,CAAC;IACpB,IAAI,CAACC,aAAa,GAAG,CAAC;IACtB,IAAI,CAACC,aAAa,GAAG,CAAC;AACxB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACES,eAAeA,CAACC,QAAQ,EAAEC,cAAc,EAAEC,oBAAoB,EAAEC,sBAAsB,EAAEC,aAAa,EACrG;AACE,IAAA,IAAIH,cAAc,KAAK,CAAC,EAAE,OAAOI,QAAQ,CAACC,IAAI;IAE9C,MAAMC,WAAW,GAAG,IAAI,CAACC,YAAY,CAACR,QAAQ,EAAEC,cAAc,CAAC;AAE/D,IAAA,IAAIM,WAAW,KAAK,CAAC,EAAE,OAAOF,QAAQ,CAACI,YAAY;AAEnD,IAAA,MAAMC,IAAI,GAAG,IAAI,CAACtB,WAAW;AAC7B,IAAA,MAAMuB,MAAM,GAAG,IAAI,CAACC,aAAa,CAACL,WAAW,EAAEL,oBAAoB,EAAEC,sBAAsB,EAAEO,IAAI,EAAEN,aAAa,CAAC;AAEjH,IAAA,IAAIS,MAAM,CAACF,MAAM,CAAC,EAAE,OAAOA,MAAM;AAEjC,IAAA,IAAI,CAACP,aAAa,CAACU,eAAe,CAAC,CAAC,EAAE,IAAI,CAACvB,SAAS,CAACmB,IAAI,CAAC,EAAE,CAAC,EAAEP,sBAAsB,CAAC,EACtF;MACE,OAAOE,QAAQ,CAACU,MAAM;AACxB,IAAA;IAEA,IAAI,CAAC3B,WAAW,GAAG,CAAC,IAAI,CAACA,WAAW,GAAG,CAAC,IAAInB,SAAS;AAErD,IAAA,OAAOmC,aAAa,CAACY,aAAa,CAAC,CAAC,EAAEf,cAAc,CAAC,GAAGI,QAAQ,CAACC,IAAI,GAAGD,QAAQ,CAACU,MAAM;AACzF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEE,EAAAA,sBAAsBA,CACpBjB,QAAQ,EACRkB,WAAW,EACXjB,cAAc,EACdkB,SAAS,EACTjB,oBAAoB,EACpBC,sBAAsB,EACtBC,aAAa,EAEf;AACE,IAAA,IAAIH,cAAc,KAAK,CAAC,EAAE,OAAOI,QAAQ,CAACC,IAAI;IAC9C,IAAI,CAACa,SAAS,IAAI,CAACjB,oBAAoB,EAAE,OAAOG,QAAQ,CAACI,YAAY;;AAErE;AACA;AACA;AACA,IAAA,MAAMW,aAAa,GAAGD,SAAS,CAACE,iBAAiB;IAEjD,IAAID,aAAa,KAAK,CAAC,IAAIA,aAAa,KAAK,CAAC,EAAE,OAAOf,QAAQ,CAACI,YAAY;IAE5E,MAAMa,UAAU,GAAG,IAAI,CAACd,YAAY,CAACR,QAAQ,EAAEC,cAAc,CAAC;AAE9D,IAAA,IAAIqB,UAAU,KAAK,CAAC,EAAE,OAAOjB,QAAQ,CAACI,YAAY;AAElD,IAAA,MAAMc,UAAU,GAAG,IAAI,CAACnC,WAAW;AACnC,IAAA,MAAMuB,MAAM,GAAG,IAAI,CAACC,aAAa,CAC/BM,WAAW,EACXhB,oBAAoB,EACpBC,sBAAsB,EACtBoB,UAAU,EACVnB,aACF,CAAC;AAED,IAAA,IAAIS,MAAM,CAACF,MAAM,CAAC,EAAE,OAAOA,MAAM;AAEjC,IAAA,IAAI,CAACP,aAAa,CAACU,eAAe,CAAC,CAAC,EAAE,IAAI,CAACvB,SAAS,CAACgC,UAAU,CAAC,EAAE,CAAC,EAAEpB,sBAAsB,CAAC,EAC5F;MACE,OAAOE,QAAQ,CAACU,MAAM;AACxB,IAAA;IAEA,IAAI,CAAC3B,WAAW,GAAG,CAAC,IAAI,CAACA,WAAW,GAAG,CAAC,IAAInB,SAAS;AAErD,IAAA,MAAM4B,IAAI,GAAGuB,aAAa,KAAK,CAAC,GAAG,IAAI,CAAC1B,UAAU,GAAG,IAAI,CAACC,UAAU;AACpE,IAAA,MAAM6B,SAAS,GAAGJ,aAAa,KAAK,CAAC,GAAG,IAAI,CAAC/B,aAAa,GAAG,IAAI,CAACC,aAAa;AAC/E,IAAA,MAAMmC,OAAO,GAAG,IAAI,CAACC,YAAY,CAACJ,UAAU,EAAEH,SAAS,EAAEC,aAAa,EAAEvB,IAAI,EAAE2B,SAAS,EAAEpB,aAAa,CAAC;AAEvG,IAAA,IAAIS,MAAM,CAACY,OAAO,CAAC,EAAE,OAAOA,OAAO;AAEnC,IAAA,IAAI,CAACrB,aAAa,CAACuB,UAAU,CAAC9B,IAAI,CAAC2B,SAAS,CAAC,EAAEJ,aAAa,CAAC,EAAE,OAAOf,QAAQ,CAACU,MAAM;AAErF,IAAA,IAAIK,aAAa,KAAK,CAAC,EAAE,IAAI,CAAC/B,aAAa,GAAG,CAAC,IAAI,CAACA,aAAa,GAAG,CAAC,IAAIpB,SAAS,CAAC,KAC9E,IAAI,CAACqB,aAAa,GAAG,CAAC,IAAI,CAACA,aAAa,GAAG,CAAC,IAAIrB,SAAS;AAE9D,IAAA,OAAOmC,aAAa,CAACwB,oBAAoB,CAACV,WAAW,EAAE,CAAC,EAAEjB,cAAc,CAAC,GAAGI,QAAQ,CAACC,IAAI,GAAGD,QAAQ,CAACU,MAAM;AAC7G,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEP,EAAAA,YAAYA,CAACR,QAAQ,EAAEC,cAAc,EACrC;IACE,OAAO/B,YAAY,CAAC8B,QAAQ,CAAC,GAAGC,cAAc,CAAC,IAAI,CAAC;AACtD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEW,aAAaA,CAACL,WAAW,EAAEL,oBAAoB,EAAEC,sBAAsB,EAAEO,IAAI,EAAEN,aAAa,EAC5F;AACE,IAAA,MAAMyB,SAAS,GAAGtB,WAAW,GAAGJ,sBAAsB;;AAEtD;AACA;AACA;AACA,IAAA,IAAI0B,SAAS,KAAK,CAAC,EAAE,OAAO,IAAI,CAACtC,SAAS,CAACmB,IAAI,CAAC,GAAGL,QAAQ,CAACC,IAAI,GAAGD,QAAQ,CAACI,YAAY;AAExF,IAAA,IAAI,CAACP,oBAAoB,EAAE,OAAOG,QAAQ,CAACI,YAAY;AACvD,IAAA,IAAI5B,OAAO,CAACqB,oBAAoB,CAAC,CAAC4B,MAAM,GAAGD,SAAS,EAAE,OAAOxB,QAAQ,CAACI,YAAY;AAElF,IAAA,MAAMsB,QAAQ,GAAG,IAAI,CAACxC,SAAS,CAACmB,IAAI,CAAC;AAErC,IAAA,IAAI,CAACqB,QAAQ,IAAIA,QAAQ,CAACC,OAAO,EAAE,CAACC,cAAc,EAAE,GAAGJ,SAAS,EAChE;AACE;AACA;AACA;AACA;AACA,MAAA,MAAMK,OAAO,GAAG9B,aAAa,CAAC+B,YAAY,CACxCC,sBAAsB,CAACC,UAAU,CAC/B,CAAC,EACDC,IAAI,CAACC,KAAK,CAAC,CAACV,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,EAC/BW,WAAW,CAACC,aAAa,EACzBC,WAAW,CAACC,WACd,CACF,CAAC;AAED,MAAA,IAAI,CAACT,OAAO,EAAE,OAAO7B,QAAQ,CAACU,MAAM;MAEpCgB,QAAQ,EAAEnC,OAAO,EAAE;AACnB,MAAA,IAAI,CAACL,SAAS,CAACmB,IAAI,CAAC,GAAGwB,OAAO;AAChC,IAAA;IAEA,OAAO,IAAI,CAACU,KAAK,CAAC,IAAI,CAACrD,SAAS,CAACmB,IAAI,CAAC,EAAE7B,OAAO,CAACqB,oBAAoB,CAAC,CAAC2C,QAAQ,CAAC,CAAC,EAAEhB,SAAS,CAAC,EAAEzB,aAAa,CAAC;AAC9G,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEsB,EAAAA,YAAYA,CAACJ,UAAU,EAAEG,OAAO,EAAEL,aAAa,EAAEvB,IAAI,EAAEa,IAAI,EAAEN,aAAa,EAC1E;IACE,IAAIqB,OAAO,CAACK,MAAM,GAAGR,UAAU,EAAE,OAAOjB,QAAQ,CAACI,YAAY;AAE7D,IAAA,MAAMsB,QAAQ,GAAGlC,IAAI,CAACa,IAAI,CAAC;;AAE3B;AACA;AACA,IAAA,IAAI,CAACqB,QAAQ,IAAIA,QAAQ,CAACC,OAAO,EAAE,CAACzD,KAAK,GAAG+C,UAAU,EACtD;MACE,MAAMY,OAAO,GAAG9B,aAAa,CAAC+B,YAAY,CACxCC,sBAAsB,CAACC,UAAU,CAACjB,aAAa,EAAEE,UAAU,EAAEkB,WAAW,CAACM,YAAY,EAAEJ,WAAW,CAACC,WAAW,CAChH,CAAC;AAED,MAAA,IAAI,CAACT,OAAO,EAAE,OAAO7B,QAAQ,CAACU,MAAM;MAEpCgB,QAAQ,EAAEnC,OAAO,EAAE;AACnBC,MAAAA,IAAI,CAACa,IAAI,CAAC,GAAGwB,OAAO;AACtB,IAAA;AAEA,IAAA,MAAMa,MAAM,GAAG,IAAIhE,UAAU,CAAC0C,OAAO,CAACzC,MAAM,EAAEyC,OAAO,CAACxC,UAAU,EAAEqC,UAAU,GAAGF,aAAa,CAAC;AAE7F,IAAA,OAAO,IAAI,CAACwB,KAAK,CAAC/C,IAAI,CAACa,IAAI,CAAC,EAAEqC,MAAM,EAAE3C,aAAa,CAAC;AACtD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACEwC,EAAAA,KAAKA,CAAC5D,MAAM,EAAE+D,MAAM,EAAE3C,aAAa,EACnC;AACE;AACA;AACA;AACA;IACA,MAAM;MAAE4C,MAAM;AAAElE,MAAAA;AAAK,KAAC,GAAGE,MAAM,CAACiE,aAAa,CAAC7C,aAAa,CAAC;AAE5D,IAAA,IAAIS,MAAM,CAACmC,MAAM,CAAC,IAAI,CAAClE,IAAI,EAC3B;AACEE,MAAAA,MAAM,CAACkE,eAAe,CAAC9C,aAAa,CAAC;MAErC,OAAOS,MAAM,CAACmC,MAAM,CAAC,GAAGA,MAAM,GAAG3C,QAAQ,CAACU,MAAM;AAClD,IAAA;AAEAjC,IAAAA,IAAI,CAACqE,GAAG,CAACJ,MAAM,CAAC;AAChB/D,IAAAA,MAAM,CAACkE,eAAe,CAAC9C,aAAa,CAAC;IAErC,OAAOC,QAAQ,CAACC,IAAI;AACtB,EAAA;AACF;;AAGA;AACA;AACA;AACA;AACA8C,SAAS,CAACC,MAAM,CAAClE,eAAe,EAAE;AAAEmE,EAAAA,SAAS,EAAE,iBAAiB;AAAEC,EAAAA,MAAM,EAAE;AAAkB,CAAC,CAAC;;;;"}

package/dist/trinityal/Tr2HalHelperStructures/Tr2MsaaDesc.js

@@ -0,0 +1,45 @@
+// Source: trinity/trinityal/Tr2HalHelperStructures.h
+// Source: trinity/trinityal/Tr2HalHelperStructures.cpp
+//
+// ONE FOLDER PER DONOR HEADER. Carbon declares six types in this header, and a
+// C++ header is an include unit rather than a class container. Splitting them one
+// per file keeps every class findable by its own name without inventing anything:
+// the folder still names the donor, so each file has something to be diffed
+// against. It also makes an unported sibling visible as a missing FILE, which is
+// how two of these were found absent.
+
+/**
+ * A multisample description.
+ */
+class Tr2MsaaDesc {
+  /** Samples per pixel; never below one. */
+  samples = 1;
+
+  /** Backend-defined quality level. */
+  quality = 0;
+
+  /**
+   * @param {number} [samples] Samples per pixel.
+   * @param {number} [quality] Quality level.
+   */
+  constructor(samples = 1, quality = 0) {
+    this.samples = Math.max(samples, 1);
+    this.quality = quality;
+  }
+
+  /**
+   * Whether two descriptions match.
+   *
+   * Carbon clamps both sample counts to at least one before comparing, so a
+   * zero and a one are the same description.
+   *
+   * @param {Tr2MsaaDesc} other The description to compare with.
+   * @returns {boolean} True when they match.
+   */
+  Equals(other) {
+    return Math.max(this.samples, 1) === Math.max(other.samples, 1) && this.quality === other.quality;
+  }
+}
+
+export { Tr2MsaaDesc };
+//# sourceMappingURL=Tr2MsaaDesc.js.map

package/dist/trinityal/Tr2HalHelperStructures/Tr2MsaaDesc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tr2MsaaDesc.js","sources":["../../../../src/trinityal/Tr2HalHelperStructures/Tr2MsaaDesc.js"],"sourcesContent":["// Source: trinity/trinityal/Tr2HalHelperStructures.h\n// Source: trinity/trinityal/Tr2HalHelperStructures.cpp\n//\n// ONE FOLDER PER DONOR HEADER. Carbon declares six types in this header, and a\n// C++ header is an include unit rather than a class container. Splitting them one\n// per file keeps every class findable by its own name without inventing anything:\n// the folder still names the donor, so each file has something to be diffed\n// against. It also makes an unported sibling visible as a missing FILE, which is\n// how two of these were found absent.\n\n/**\n * A multisample description.\n */\nexport class Tr2MsaaDesc\n{\n  /** Samples per pixel; never below one. */\n  samples = 1;\n\n  /** Backend-defined quality level. */\n  quality = 0;\n\n  /**\n   * @param {number} [samples] Samples per pixel.\n   * @param {number} [quality] Quality level.\n   */\n  constructor(samples = 1, quality = 0)\n  {\n    this.samples = Math.max(samples, 1);\n    this.quality = quality;\n  }\n\n  /**\n   * Whether two descriptions match.\n   *\n   * Carbon clamps both sample counts to at least one before comparing, so a\n   * zero and a one are the same description.\n   *\n   * @param {Tr2MsaaDesc} other The description to compare with.\n   * @returns {boolean} True when they match.\n   */\n  Equals(other)\n  {\n    return Math.max(this.samples, 1) === Math.max(other.samples, 1) && this.quality === other.quality;\n  }\n}\n"],"names":["Tr2MsaaDesc","samples","quality","constructor","Math","max","Equals","other"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACO,MAAMA,WAAW,CACxB;AACE;AACAC,EAAAA,OAAO,GAAG,CAAC;;AAEX;AACAC,EAAAA,OAAO,GAAG,CAAC;;AAEX;AACF;AACA;AACA;EACEC,WAAWA,CAACF,OAAO,GAAG,CAAC,EAAEC,OAAO,GAAG,CAAC,EACpC;IACE,IAAI,CAACD,OAAO,GAAGG,IAAI,CAACC,GAAG,CAACJ,OAAO,EAAE,CAAC,CAAC;IACnC,IAAI,CAACC,OAAO,GAAGA,OAAO;AACxB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEI,MAAMA,CAACC,KAAK,EACZ;AACE,IAAA,OAAOH,IAAI,CAACC,GAAG,CAAC,IAAI,CAACJ,OAAO,EAAE,CAAC,CAAC,KAAKG,IAAI,CAACC,GAAG,CAACE,KAAK,CAACN,OAAO,EAAE,CAAC,CAAC,IAAI,IAAI,CAACC,OAAO,KAAKK,KAAK,CAACL,OAAO;AACnG,EAAA;AACF;;;;"}

package/dist/trinityal/Tr2HalHelperStructures/Tr2SamplerDescription.js

@@ -0,0 +1,154 @@
+import '../../global/consts/renderContext/formats.js';
+import '../../global/consts/renderContext/pipeline.js';
+import { CompareFunc, TextureAddressMode, TextureFilter } from '../../global/consts/renderContext/renderStates.js';
+
+// Source: trinity/trinityal/Tr2HalHelperStructures.h:137-254 (struct Tr2SamplerDescription)
+//   trinity/trinityal/Tr2HalHelperStructures.h:255-277 (struct hash<Tr2SamplerDescription>)
+//   trinity/trinityal/include/Tr2SamplerStateAL.h (forward declaration, and the factory)
+//
+// ONE FOLDER PER DONOR HEADER - see the sibling files for why.
+//
+// THE CLASS WAS MISSING AND THIS FILE HELD ONLY FUNCTIONS. Carbon declares a
+// struct with a documented default constructor; we had a normaliser returning an
+// anonymous object, and the previous provenance header named `Tr2SamplerAL.h`,
+// which does not declare it. A struct with defaults reduced to a literal with
+// `?? 0` is how those defaults drifted - see below.
+//
+// THREE DEFAULTS WERE WRONG, and two were not even members of their enum. Carbon's
+// default constructor sets TF_POINT (1), TA_WRAP (1) and CMP_ALWAYS (8); the
+// normaliser defaulted all three to 0. `TextureFilter` does have a zero
+// (`TF_NONE`), so an omitted filter silently meant NO filtering rather than point
+// sampling. `TextureAddressMode` and `CompareFunc` are 1-based and have no zero at
+// all, so an omitted address mode or comparison produced a value outside the enum,
+// which no backend can map and nothing reported.
+//
+// THE FACTORY KEY IS CARBON'S TOO. `Tr2SamplerStateAL::Create` is a lookup in a
+// `Tr2ObjectFactory<..., Tr2SamplerDescription>` owned by the primary context
+// (`Tr2SamplerStateAL.cpp:25-28`), so two equal descriptions yield one state and
+// `operator==` on states is identity. Carbon reaches that through
+// `std::hash<Tr2SamplerDescription>`; JavaScript has no hash specialisation to
+// install, so `SamplerDescriptionKey` is the equivalent and the Map it feeds is
+// the factory.
+const rawView = new DataView(new ArrayBuffer(4));
+
+/** A float from its raw IEEE-754 bits, or the float itself. */
+function floatOf(value, raw, fallback) {
+  if (Number.isFinite(value)) return value;
+  if (Number.isInteger(raw)) {
+    rawView.setUint32(0, raw >>> 0, true);
+    return rawView.getFloat32(0, true);
+  }
+  return fallback;
+}
+
+/**
+ * Carbon's `std::numeric_limits<float>::max()`, the open upper LOD bound an author
+ * leaves unbounded.
+ */
+const SAMPLER_LOD_UNBOUNDED = 3.4028234663852886e38;
+
+/**
+ * The authored sampler state a `Tr2SamplerStateAL` is created from, and the key
+ * its factory dedupes on.
+ */
+class Tr2SamplerDescription {
+  m_minFilter = TextureFilter.TF_POINT;
+  m_magFilter = TextureFilter.TF_POINT;
+  m_mipFilter = TextureFilter.TF_POINT;
+  m_isComparisonFilter = false;
+  m_addressU = TextureAddressMode.TA_WRAP;
+  m_addressV = TextureAddressMode.TA_WRAP;
+  m_addressW = TextureAddressMode.TA_WRAP;
+  m_mipLODBias = 0;
+  m_maxAnisotropy = 1;
+  m_comparisonFunc = CompareFunc.CMP_ALWAYS;
+
+  /** Four floats, RGBA. Carbon's constructor zeroes all four. */
+  m_borderColor = [0, 0, 0, 0];
+  m_minLOD = 0;
+  m_maxLOD = SAMPLER_LOD_UNBOUNDED;
+
+  /**
+   * Carbon's second constructor, which takes every field.
+   *
+   * Its first form is the default constructor, which is the field initialisers
+   * above. Passing nothing here is that form.
+   *
+   * @param {object} [values] Field values in the normal form, as
+   *   {@link NormalizeSamplerDescription} produces.
+   */
+  constructor(values = undefined) {
+    if (!values) return;
+    Object.assign(this, {
+      m_minFilter: values.minFilter,
+      m_magFilter: values.magFilter,
+      m_mipFilter: values.mipFilter,
+      m_isComparisonFilter: values.isComparisonFilter,
+      m_addressU: values.addressU,
+      m_addressV: values.addressV,
+      m_addressW: values.addressW,
+      m_mipLODBias: values.mipLODBias,
+      m_maxAnisotropy: values.maxAnisotropy,
+      m_comparisonFunc: values.comparisonFunc,
+      m_borderColor: [...values.borderColor],
+      m_minLOD: values.minLOD,
+      m_maxLOD: values.maxLOD
+    });
+  }
+}
+
+/**
+ * The normal form of a sampler description.
+ *
+ * TWO SPELLINGS ARRIVE HERE. The effect reader keeps floats as their raw bits
+ * (`Tr2SamplerSetup.fromCarbonBinary`: `minLODRaw`, `maxLODRaw`, `mipLODBiasRaw`,
+ * `borderColorRaw`) so a round trip is byte-exact; an override built at runtime
+ * carries plain floats. The normal form is the floats, and both spellings
+ * normalise to it, so the factory key is the same whichever road a description
+ * took.
+ *
+ * @param {object|null} description Authored state in either spelling.
+ * @returns {object|null} The normalised description, or null for nothing.
+ */
+function NormalizeSamplerDescription(description) {
+  if (!description || typeof description !== "object") return null;
+  const border = description.borderColor ?? description.borderColorRaw ?? [];
+  const rawBorder = description.borderColor ? null : description.borderColorRaw ?? null;
+
+  // Defaults are Carbon's default constructor, NOT zero. `isComparisonFilter` is
+  // also Carbon's field name; it was `comparison` here, which reads as the
+  // comparison FUNCTION rather than the flag selecting a comparison sampler.
+  return {
+    minFilter: description.minFilter ?? TextureFilter.TF_POINT,
+    magFilter: description.magFilter ?? TextureFilter.TF_POINT,
+    mipFilter: description.mipFilter ?? TextureFilter.TF_POINT,
+    isComparisonFilter: Boolean(description.isComparisonFilter ?? description.comparison),
+    addressU: description.addressU ?? TextureAddressMode.TA_WRAP,
+    addressV: description.addressV ?? TextureAddressMode.TA_WRAP,
+    addressW: description.addressW ?? TextureAddressMode.TA_WRAP,
+    mipLODBias: floatOf(description.mipLODBias, description.mipLODBiasRaw, 0),
+    maxAnisotropy: description.maxAnisotropy ?? 1,
+    comparisonFunc: description.comparisonFunc ?? CompareFunc.CMP_ALWAYS,
+    borderColor: [0, 1, 2, 3].map(index => floatOf(rawBorder ? undefined : border[index], rawBorder?.[index], 0)),
+    minLOD: floatOf(description.minLOD, description.minLODRaw, 0),
+    maxLOD: floatOf(description.maxLOD, description.maxLODRaw, SAMPLER_LOD_UNBOUNDED)
+  };
+}
+
+/**
+ * The factory key for a description: two descriptions with equal keys are one
+ * sampler state.
+ *
+ * This is what Carbon reaches through `std::hash<Tr2SamplerDescription>`
+ * (`Tr2HalHelperStructures.h:255-277`), which JavaScript cannot install.
+ *
+ * @param {object} description A description in either spelling.
+ * @returns {string|null} The key, or null for nothing.
+ */
+function SamplerDescriptionKey(description) {
+  const normalized = NormalizeSamplerDescription(description);
+  return normalized ? JSON.stringify(normalized) : null;
+}
+
+export { NormalizeSamplerDescription, SAMPLER_LOD_UNBOUNDED, SamplerDescriptionKey, Tr2SamplerDescription };
+//# sourceMappingURL=Tr2SamplerDescription.js.map