@atlaspack/graph 3.5.9 → 3.5.10-typescript-08dcc1c9b.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright (c) 2024 Atlassian US., Inc.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/lib/AdjacencyList.js

@@ -23,9 +23,13 @@ var _types = require("./types");
 var _Graph = require("./Graph");
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 /** The address of the node in the nodes map. */
+
 /** The address of the edge in the edges map. */
+
 // eslint-disable-next-line no-unused-vars
+
 // eslint-disable-next-line no-unused-vars
+
 const DEFAULT_PARAMS = {
   initialCapacity: 2,
   unloadFactor: 0.3,
@@ -99,7 +103,10 @@ class AdjacencyList {
   constructor(opts) {
     let nodes;
     let edges;
+
+    // @ts-expect-error TS2339
     if (opts !== null && opts !== void 0 && opts.nodes) {
+      // @ts-expect-error TS2339
       ({
         nodes,
         edges
@@ -152,6 +159,7 @@ class AdjacencyList {
   get stats() {
     let edgeTypes = new Set();
     let buckets = new Map();
+    // @ts-expect-error TS2488
     for (let {
       from,
       to,
@@ -224,13 +232,17 @@ class AdjacencyList {
 
     // Copy the existing edges into the new array.
     nodes.nextId = this.#nodes.nextId;
-    this.#edges.forEach(edge => void link(this.#edges.from(edge), this.#edges.to(edge), this.#edges.typeOf(edge), edges, nodes, this.#params.unloadFactor));
+    this.#edges.forEach(edge => void link(this.#edges.from(edge), this.#edges.to(edge), this.#edges.typeOf(edge),
+    // @ts-expect-error TS2345
+    edges, nodes, this.#params.unloadFactor));
 
     // We expect to preserve the same number of edges.
     (0, _assert().default)(this.#edges.count === edges.count, `Edge mismatch! ${this.#edges.count} does not match ${edges.count}.`);
 
     // Finally, copy the new data arrays over to this graph.
+    // @ts-expect-error TS2322
     this.#nodes = nodes;
+    // @ts-expect-error TS2322
     this.#edges = edges;
   }
 
@@ -599,6 +611,7 @@ class SharedTypeMap {
   static #TYPE = 1;
 
   /** The largest possible capacity. */
+  // @ts-expect-error TS1094
   static get MAX_CAPACITY() {
     return Math.floor(
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Errors/Invalid_array_length#what_went_wrong
@@ -631,6 +644,7 @@ class SharedTypeMap {
 
   /** The address of the first item in the map. */
   get addressableLimit() {
+    // @ts-expect-error TS2339
     return this.constructor.HEADER_SIZE + this.capacity;
   }
 
@@ -653,7 +667,6 @@ class SharedTypeMap {
         BYTES_PER_ELEMENT
       } = Uint32Array;
       let CAPACITY = SharedTypeMap.#CAPACITY;
-      // $FlowFixMe[incompatible-call]
       this.data = new Uint32Array(new _sharedBuffer.SharedBuffer(this.getLength(capacityOrData) * BYTES_PER_ELEMENT));
       this.data[CAPACITY] = capacityOrData;
     } else {
@@ -670,6 +683,7 @@ class SharedTypeMap {
    * and is expected to be of equal or smaller capacity to this map.
    */
   set(data) {
+    // @ts-expect-error TS2339
     let {
       HEADER_SIZE,
       ITEM_SIZE
@@ -720,6 +734,7 @@ class SharedTypeMap {
    * get the length of the map, in bytes.
    */
   getLength(capacity = this.capacity) {
+    // @ts-expect-error TS2339
     let {
       HEADER_SIZE,
       ITEM_SIZE
@@ -729,6 +744,7 @@ class SharedTypeMap {
 
   /** Get the next available address in the map. */
   getNextAddress() {
+    // @ts-expect-error TS2339
     let {
       HEADER_SIZE,
       ITEM_SIZE
@@ -738,6 +754,7 @@ class SharedTypeMap {
 
   /** Get the address of the first item with the given hash. */
   head(hash) {
+    // @ts-expect-error TS2339
     let {
       HEADER_SIZE
     } = this.constructor;
@@ -763,6 +780,7 @@ class SharedTypeMap {
     let COUNT = SharedTypeMap.#COUNT;
     let NEXT = SharedTypeMap.#NEXT;
     let TYPE = SharedTypeMap.#TYPE;
+    // @ts-expect-error TS2339
     let {
       HEADER_SIZE
     } = this.constructor;
@@ -789,6 +807,7 @@ class SharedTypeMap {
     let COUNT = SharedTypeMap.#COUNT;
     let NEXT = SharedTypeMap.#NEXT;
     let TYPE = SharedTypeMap.#TYPE;
+    // @ts-expect-error TS2339
     let {
       HEADER_SIZE
     } = this.constructor;
@@ -801,6 +820,7 @@ class SharedTypeMap {
     let candidate = head;
     while (candidate !== null && candidate !== item) {
       prev = candidate;
+      // @ts-expect-error TS2322
       candidate = this.next(candidate);
     }
     if (prev !== null && next !== null) {
@@ -818,6 +838,7 @@ class SharedTypeMap {
   forEach(cb) {
     let max = this.count;
     let len = this.length;
+    // @ts-expect-error TS2339
     let {
       ITEM_SIZE
     } = this.constructor;
@@ -834,10 +855,10 @@ class SharedTypeMap {
   // See https://github.com/facebook/flow/issues/1163#issuecomment-353523840
   /*:: @@iterator(): Iterator<TAddress> { return ({}: any); } */
 
-  // $FlowFixMe[unsupported-syntax]
   *[Symbol.iterator]() {
     let max = this.count;
     let len = this.length;
+    // @ts-expect-error TS2339
     let {
       ITEM_SIZE
     } = this.constructor;
@@ -849,6 +870,7 @@ class SharedTypeMap {
     }
   }
   inspect() {
+    // @ts-expect-error TS2339
     const {
       HEADER_SIZE
     } = this.constructor;
@@ -1168,6 +1190,7 @@ class EdgeTypeMap extends SharedTypeMap {
 
   /** Get the next available address in the map. */
   getNextAddress() {
+    // @ts-expect-error TS2339
     let {
       ITEM_SIZE
     } = this.constructor;

package/lib/BitSet.js

@@ -102,7 +102,6 @@ class BitSet {
       let v = bits[k];
       while (v !== 0) {
         let t = (v & -v) >>> 0;
-        // $FlowFixMe
         fn((k << 5) + ctz32(v));
         v ^= t;
       }

package/lib/ContentGraph.js

@@ -30,18 +30,14 @@ class ContentGraph extends _Graph.default {
       this._nodeIdToContentKey = new Map();
     }
   }
-
-  // $FlowFixMe[prop-missing]
   static deserialize(opts) {
     return new ContentGraph(opts);
   }
-
-  // $FlowFixMe[prop-missing]
   serialize() {
-    // $FlowFixMe[prop-missing]
     return {
       ...super.serialize(),
       _contentKeyToNodeId: this._contentKeyToNodeId,
+      // @ts-expect-error TS2353
       _nodeIdToContentKey: this._nodeIdToContentKey
     };
   }

package/lib/Graph.js

@@ -248,6 +248,7 @@ class Graph {
       context: null
     }];
     while (queue.length !== 0) {
+      // @ts-expect-error TS2339
       let {
         nodeId,
         context
@@ -257,7 +258,6 @@ class Graph {
       skipped = false;
       let newContext = visit(nodeId, context, actions);
       if (typeof newContext !== 'undefined') {
-        // $FlowFixMe[reassign-const]
         context = newContext;
       }
       if (skipped) {
@@ -366,15 +366,18 @@ class Graph {
     const enter = typeof visit === 'function' ? visit : visit.enter;
     while (queue.length !== 0) {
       const command = queue.pop();
+
+      // @ts-expect-error TS18048
       if (command.exit != null) {
+        // @ts-expect-error TS2339
         let {
           nodeId,
           context,
           exit
         } = command;
+        // @ts-expect-error TS18048
         let newContext = exit(nodeId, command.context, actions);
         if (typeof newContext !== 'undefined') {
-          // $FlowFixMe[reassign-const]
           context = newContext;
         }
         if (skipped) {
@@ -385,6 +388,7 @@ class Graph {
           return context;
         }
       } else {
+        // @ts-expect-error TS2339
         let {
           nodeId,
           context
@@ -395,7 +399,6 @@ class Graph {
         if (enter) {
           let newContext = enter(nodeId, context, actions);
           if (typeof newContext !== 'undefined') {
-            // $FlowFixMe[reassign-const]
             context = newContext;
           }
         }
@@ -440,6 +443,8 @@ class Graph {
       if (stop === true) {
         return node;
       }
+
+      // @ts-expect-error TS2345
       for (let child of this.getNodeIdsConnectedFrom(node)) {
         if (!visited.has(child)) {
           visited.add(child);

package/lib/shared-buffer.js

@@ -7,7 +7,7 @@ exports.SharedBuffer = void 0;
 // Copy from @atlaspack/utils to fix: https://github.com/stackblitz/core/issues/1855
 let SharedBuffer = exports.SharedBuffer = void 0;
 
-// $FlowFixMe[prop-missing]
+// @ts-expect-error TS2339
 if (process.browser) {
   exports.SharedBuffer = SharedBuffer = ArrayBuffer;
   // Safari has removed the constructor

package/lib/types.js

@@ -6,6 +6,7 @@ Object.defineProperty(exports, "__esModule", {
 exports.fromNodeId = fromNodeId;
 exports.toNodeId = toNodeId;
 // forcing NodeId to be opaque as it should only be created once
+
 function toNodeId(x) {
   return x;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/graph",
-  "version": "3.5.9",
+  "version": "3.5.10-typescript-08dcc1c9b.0",
   "description": "Blazing fast, zero configuration web application bundler",
   "license": "(MIT OR Apache-2.0)",
   "publishConfig": {
@@ -11,20 +11,23 @@
     "url": "https://github.com/atlassian-labs/atlaspack.git"
   },
   "main": "lib/index.js",
-  "source": "src/index.js",
+  "source": "src/index.ts",
   "engines": {
     "node": ">= 16.0.0"
   },
   "scripts": {
-    "benchmark": "node ./benchmark/BitSet.js"
+    "benchmark": "node ./benchmark/BitSet.js",
+    "check-ts": "tsc --noEmit"
   },
   "dependencies": {
-    "@atlaspack/feature-flags": "2.19.2",
+    "@atlaspack/feature-flags": "2.19.3-typescript-08dcc1c9b.0",
     "nullthrows": "^1.1.1"
   },
   "devDependencies": {
-    "@atlaspack/babel-register": "2.14.1",
+    "@atlaspack/babel-register": "2.14.2-typescript-08dcc1c9b.0",
     "benny": "^3.7.1"
   },
-  "type": "commonjs"
+  "type": "commonjs",
+  "types": "src/index.ts",
+  "gitHead": "08dcc1c9bcdc6ab931d55e05ccc0f45669de2f22"
 }