@atlaspack/graph 3.5.10 → 3.5.11-typescript-17c3d1dec.0

package/src/{Graph.js → Graph.ts}

@@ -1,7 +1,5 @@
-// @flow strict-local
-
 import {fromNodeId} from './types';
-import AdjacencyList, {type SerializedAdjacencyList} from './AdjacencyList';
+import AdjacencyList, {SerializedAdjacencyList} from './AdjacencyList';
 import type {Edge, NodeId} from './types';
 import type {
   TraversalActions,
@@ -14,32 +12,32 @@ import nullthrows from 'nullthrows';
 
 export type NullEdgeType = 1;
 export const NULL_EDGE_TYPE: NullEdgeType = 1;
-export type GraphOpts<TNode, TEdgeType: number = NullEdgeType> = {|
-  nodes?: Array<TNode | null>,
-  adjacencyList?: SerializedAdjacencyList<TEdgeType>,
-  rootNodeId?: ?NodeId,
-  initialCapacity?: number,
-|};
-
-export type SerializedGraph<TNode, TEdgeType: number = NullEdgeType> = {|
-  nodes: Array<TNode | null>,
-  adjacencyList: SerializedAdjacencyList<TEdgeType>,
-  rootNodeId: ?NodeId,
-|};
+export type GraphOpts<TNode, TEdgeType extends number = NullEdgeType> = {
+  nodes?: Array<TNode | null>;
+  adjacencyList?: SerializedAdjacencyList<TEdgeType>;
+  rootNodeId?: NodeId | null | undefined;
+  initialCapacity?: number;
+};
+
+export type SerializedGraph<TNode, TEdgeType extends number = NullEdgeType> = {
+  nodes: Array<TNode | null>;
+  adjacencyList: SerializedAdjacencyList<TEdgeType>;
+  rootNodeId: NodeId | null | undefined;
+};
 
 export type AllEdgeTypes = -1;
 export const ALL_EDGE_TYPES: AllEdgeTypes = -1;
 
-type DFSCommandVisit<TContext> = {|
-  nodeId: NodeId,
-  context: TContext | null,
-|};
+type DFSCommandVisit<TContext> = {
+  nodeId: NodeId;
+  context: TContext | null;
+};
 
-type DFSCommandExit<TContext> = {|
-  nodeId: NodeId,
-  exit: GraphTraversalCallback<NodeId, TContext>,
-  context: TContext | null,
-|};
+type DFSCommandExit<TContext> = {
+  nodeId: NodeId;
+  exit: GraphTraversalCallback<NodeId, TContext>;
+  context: TContext | null;
+};
 
 /**
  * Internal type used for queue iterative DFS implementation.
@@ -51,8 +49,8 @@ type DFSCommand<TContext> =
 /**
  * Options for DFS traversal.
  */
-export type DFSParams<TContext> = {|
-  visit: GraphVisitor<NodeId, TContext>,
+export type DFSParams<TContext> = {
+  visit: GraphVisitor<NodeId, TContext>;
   /**
    * Custom function to get next entries to visit.
    *
@@ -71,17 +69,17 @@ export type DFSParams<TContext> = {|
    *
    * Only due to the latter we aren't replacing this.
    */
-  getChildren: (nodeId: NodeId) => Array<NodeId>,
-  startNodeId?: ?NodeId,
-|};
+  getChildren: (nodeId: NodeId) => Array<NodeId>;
+  startNodeId?: NodeId | null | undefined;
+};
 
-export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
+export default class Graph<TNode, TEdgeType extends number = NullEdgeType> {
   nodes: Array<TNode | null>;
   adjacencyList: AdjacencyList<TEdgeType>;
-  rootNodeId: ?NodeId;
-  _visited: ?BitSet;
+  rootNodeId: NodeId | null | undefined;
+  _visited: BitSet | null | undefined;
 
-  constructor(opts: ?GraphOpts<TNode, TEdgeType>) {
+  constructor(opts?: GraphOpts<TNode, TEdgeType> | null) {
     this.nodes = opts?.nodes || [];
     this.setRootNodeId(opts?.rootNodeId);
 
@@ -94,11 +92,11 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
         );
   }
 
-  setRootNodeId(id: ?NodeId) {
+  setRootNodeId(id?: NodeId | null) {
     this.rootNodeId = id;
   }
 
-  static deserialize(
+  static deserialize<TNode, TEdgeType extends number = NullEdgeType>(
     opts: GraphOpts<TNode, TEdgeType>,
   ): Graph<TNode, TEdgeType> {
     return new this({
@@ -132,7 +130,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     return this.nodes[id] != null;
   }
 
-  getNode(id: NodeId): ?TNode {
+  getNode(id: NodeId): TNode | null | undefined {
     return this.nodes[id];
   }
 
@@ -159,7 +157,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
   hasEdge(
     from: NodeId,
     to: NodeId,
-    type?:
+    type:
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType> = NULL_EDGE_TYPE,
@@ -169,7 +167,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
 
   forEachNodeIdConnectedTo(
     to: NodeId,
-    fn: (nodeId: NodeId) => boolean | void,
+    fn: (nodeId: NodeId) => boolean | undefined,
     type: AllEdgeTypes | TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ) {
     this._assertHasNodeId(to);
@@ -327,9 +325,9 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
   // Update a node's downstream nodes making sure to prune any orphaned branches
   replaceNodeIdsConnectedTo(
     fromNodeId: NodeId,
-    toNodeIds: $ReadOnlyArray<NodeId>,
-    replaceFilter?: null | ((NodeId) => boolean),
-    type?: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
+    toNodeIds: ReadonlyArray<NodeId>,
+    replaceFilter?: null | ((arg1: NodeId) => boolean),
+    type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
     removeOrphans: boolean = true,
   ): void {
     this._assertHasNodeId(fromNodeId);
@@ -355,13 +353,13 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
 
   traverse<TContext>(
     visit: GraphVisitor<NodeId, TContext>,
-    startNodeId: ?NodeId,
+    startNodeId?: NodeId | null,
     type:
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType>
       | AllEdgeTypes = NULL_EDGE_TYPE,
-  ): ?TContext {
+  ): TContext | null | undefined {
     let enter = typeof visit === 'function' ? visit : visit.enter;
     if (
       type === ALL_EDGE_TYPES &&
@@ -379,23 +377,23 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
   }
 
   filteredTraverse<TValue, TContext>(
-    filter: (NodeId, TraversalActions) => ?TValue,
+    filter: (arg1: NodeId, arg2: TraversalActions) => TValue | null | undefined,
     visit: GraphVisitor<TValue, TContext>,
-    startNodeId: ?NodeId,
+    startNodeId?: NodeId | null,
     type?: TEdgeType | Array<TEdgeType | NullEdgeType> | AllEdgeTypes,
-  ): ?TContext {
+  ): TContext | null | undefined {
     return this.traverse(mapVisitor(filter, visit), startNodeId, type);
   }
 
   traverseAncestors<TContext>(
-    startNodeId: ?NodeId,
+    startNodeId: NodeId | null | undefined,
     visit: GraphVisitor<NodeId, TContext>,
     type:
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType>
       | AllEdgeTypes = NULL_EDGE_TYPE,
-  ): ?TContext {
+  ): TContext | null | undefined {
     return this.dfs({
       visit,
       startNodeId,
@@ -405,8 +403,8 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
 
   dfsFast<TContext>(
     visit: GraphTraversalCallback<NodeId, TContext>,
-    startNodeId: ?NodeId,
-  ): ?TContext {
+    startNodeId?: NodeId | null,
+  ): TContext | null | undefined {
     let traversalStartNode = nullthrows(
       startNodeId ?? this.rootNodeId,
       'A start node is required to traverse',
@@ -437,6 +435,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
 
     let queue = [{nodeId: traversalStartNode, context: null}];
     while (queue.length !== 0) {
+      // @ts-expect-error TS2339
       let {nodeId, context} = queue.pop();
       if (!this.hasNode(nodeId) || visited.has(nodeId)) continue;
       visited.add(nodeId);
@@ -444,7 +443,6 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
       skipped = false;
       let newContext = visit(nodeId, context, actions);
       if (typeof newContext !== 'undefined') {
-        // $FlowFixMe[reassign-const]
         context = newContext;
       }
 
@@ -472,7 +470,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
   // A post-order implementation of dfsFast
   postOrderDfsFast(
     visit: GraphTraversalCallback<NodeId, TraversalActions>,
-    startNodeId: ?NodeId,
+    startNodeId?: NodeId | null,
   ): void {
     let traversalStartNode = nullthrows(
       startNodeId ?? this.rootNodeId,
@@ -542,7 +540,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     visit,
     startNodeId,
     getChildren,
-  }: DFSParams<TContext>): ?TContext {
+  }: DFSParams<TContext>): TContext | null | undefined {
     let traversalStartNode = nullthrows(
       startNodeId ?? this.rootNodeId,
       'A start node is required to traverse',
@@ -578,11 +576,13 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     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;
         }
 
@@ -595,6 +595,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
           return context;
         }
       } else {
+        // @ts-expect-error TS2339
         let {nodeId, context} = command;
         if (!this.hasNode(nodeId) || visited.has(nodeId)) continue;
         visited.add(nodeId);
@@ -603,7 +604,6 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
         if (enter) {
           let newContext = enter(nodeId, context, actions);
           if (typeof newContext !== 'undefined') {
-            // $FlowFixMe[reassign-const]
             context = newContext;
           }
         }
@@ -641,7 +641,9 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     this._visited = visited;
   }
 
-  bfs(visit: (nodeId: NodeId) => ?boolean): ?NodeId {
+  bfs(
+    visit: (nodeId: NodeId) => boolean | null | undefined,
+  ): NodeId | null | undefined {
     let rootNodeId = nullthrows(
       this.rootNodeId,
       'A root node is required to traverse',
@@ -657,6 +659,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
         return node;
       }
 
+      // @ts-expect-error TS2345
       for (let child of this.getNodeIdsConnectedFrom(node)) {
         if (!visited.has(child)) {
           visited.add(child);
@@ -682,7 +685,10 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     return sorted.reverse();
   }
 
-  findAncestor(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): ?NodeId {
+  findAncestor(
+    nodeId: NodeId,
+    fn: (nodeId: NodeId) => boolean,
+  ): NodeId | null | undefined {
     let res = null;
     this.traverseAncestors(nodeId, (nodeId, ctx, traversal) => {
       if (fn(nodeId)) {
@@ -697,7 +703,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     nodeId: NodeId,
     fn: (nodeId: NodeId) => boolean,
   ): Array<NodeId> {
-    let res = [];
+    let res: Array<NodeId> = [];
     this.traverseAncestors(nodeId, (nodeId, ctx, traversal) => {
       if (fn(nodeId)) {
         res.push(nodeId);
@@ -707,7 +713,10 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     return res;
   }
 
-  findDescendant(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): ?NodeId {
+  findDescendant(
+    nodeId: NodeId,
+    fn: (nodeId: NodeId) => boolean,
+  ): NodeId | null | undefined {
     let res = null;
     this.traverse((nodeId, ctx, traversal) => {
       if (fn(nodeId)) {
@@ -722,7 +731,7 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
     nodeId: NodeId,
     fn: (nodeId: NodeId) => boolean,
   ): Array<NodeId> {
-    let res = [];
+    let res: Array<NodeId> = [];
     this.traverse((nodeId, ctx, traversal) => {
       if (fn(nodeId)) {
         res.push(nodeId);
@@ -740,11 +749,21 @@ export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
 }
 
 export function mapVisitor<NodeId, TValue, TContext>(
-  filter: (NodeId, TraversalActions) => ?TValue,
+  filter: (arg1: NodeId, arg2: TraversalActions) => TValue | null | undefined,
   visit: GraphVisitor<TValue, TContext>,
 ): GraphVisitor<NodeId, TContext> {
-  function makeEnter(visit) {
-    return function mappedEnter(nodeId, context, actions) {
+  function makeEnter(
+    visit: (
+      node: TValue,
+      context: TContext | null | undefined,
+      actions: TraversalActions,
+    ) => TContext | null | undefined,
+  ) {
+    return function mappedEnter(
+      nodeId: NodeId,
+      context: TContext | null | undefined,
+      actions: TraversalActions,
+    ) {
       let value = filter(nodeId, actions);
       if (value != null) {
         return visit(value, context, actions);
@@ -756,13 +775,17 @@ export function mapVisitor<NodeId, TValue, TContext>(
     return makeEnter(visit);
   }
 
-  let mapped = {};
+  let mapped: Record<string, any> = {};
   if (visit.enter != null) {
     mapped.enter = makeEnter(visit.enter);
   }
 
   if (visit.exit != null) {
-    mapped.exit = function mappedExit(nodeId, context, actions) {
+    mapped.exit = function mappedExit(
+      nodeId: NodeId,
+      context: TContext | null | undefined,
+      actions: TraversalActions,
+    ) {
       let exit = visit.exit;
       if (!exit) {
         return;

package/src/{index.js → index.ts}

@@ -1,5 +1,3 @@
-// @flow strict-local
-
 export type {NodeId, ContentKey, Edge} from './types';
 export type {GraphOpts} from './Graph';
 export type {ContentGraphOpts, SerializedContentGraph} from './ContentGraph';

package/src/{shared-buffer.js → shared-buffer.ts}

@@ -1,8 +1,11 @@
-// @flow
+// flow-to-ts helpers
+export type Class<T> = new (...args: any[]) => T;
+// /flow-to-ts helpers
+
 // Copy from @atlaspack/utils to fix: https://github.com/stackblitz/core/issues/1855
 export let SharedBuffer: Class<ArrayBuffer> | Class<SharedArrayBuffer>;
 
-// $FlowFixMe[prop-missing]
+// @ts-expect-error TS2339
 if (process.browser) {
   SharedBuffer = ArrayBuffer;
   // Safari has removed the constructor
@@ -12,7 +15,7 @@ if (process.browser) {
       // Firefox might throw when sending the Buffer over a MessagePort
       channel.port1.postMessage(new SharedArrayBuffer(0));
       SharedBuffer = SharedArrayBuffer;
-    } catch (_) {
+    } catch (_: any) {
       // NOOP
     }
     channel.port1.close();

package/src/{types.js → types.ts}

@@ -1,5 +1,3 @@
-// @flow strict-local
-
 // forcing NodeId to be opaque as it should only be created once
 export type NodeId = number;
 export function toNodeId(x: number): NodeId {
@@ -11,8 +9,8 @@ export function fromNodeId(x: NodeId): number {
 
 export type ContentKey = string;
 
-export type Edge<TEdgeType: number> = {|
-  from: NodeId,
-  to: NodeId,
-  type: TEdgeType,
-|};
+export type Edge<TEdgeType extends number> = {
+  from: NodeId;
+  to: NodeId;
+  type: TEdgeType;
+};

package/test/{AdjacencyList.test.js → AdjacencyList.test.ts}

@@ -1,5 +1,3 @@
-// @flow strict-local
-
 import assert from 'assert';
 import sinon from 'sinon';
 import path from 'path';
@@ -214,9 +212,7 @@ describe('AdjacencyList', () => {
 
   it('addEdge should not replace a deleted edge if the edge was already added', () => {
     // Mock hash fn to generate collisions
-    // $FlowFixMe[prop-missing]
     let originalHash = AdjacencyList.prototype.hash;
-    // $FlowFixMe[prop-missing]
     AdjacencyList.prototype.hash = () => 1;
 
     let graph = new AdjacencyList();
@@ -229,15 +225,12 @@ describe('AdjacencyList', () => {
     assert(graph.addEdge(n0, n1, 1) === false);
     assert(graph.stats.edges === 1);
 
-    // $FlowFixMe[prop-missing]
     AdjacencyList.prototype.hash = originalHash;
   });
 
   it('addEdge should replace a deleted edge', () => {
     // Mock hash fn to generate collisions
-    // $FlowFixMe[prop-missing]
     let originalHash = AdjacencyList.prototype.hash;
-    // $FlowFixMe[prop-missing]
     AdjacencyList.prototype.hash = () => 1;
 
     try {
@@ -254,7 +247,6 @@ describe('AdjacencyList', () => {
       assert(graph.stats.edges === 1);
       assert(graph.stats.deleted === 0);
     } finally {
-      // $FlowFixMe[prop-missing]
       AdjacencyList.prototype.hash = originalHash;
     }
   });
@@ -299,8 +291,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(a, b);
       graph.addEdge(c, b);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedTo(b, (id) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedTo(b, (id: any) => {
         nodeIds.push(id);
       });
 
@@ -318,8 +310,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(b, d);
       graph.addEdge(c, d);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedTo(d, (nodeId) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedTo(d, (nodeId: any) => {
         nodeIds.push(nodeId);
         return true;
       });
@@ -337,8 +329,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(c, b);
       graph.addEdge(b, b);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedTo(b, (id) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedTo(b, (id: any) => {
         nodeIds.push(id);
       });
 
@@ -354,8 +346,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(a, b);
       graph.addEdge(c, b, 2);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedTo(b, (id) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedTo(b, (id: any) => {
         nodeIds.push(id);
       });
 
@@ -371,10 +363,10 @@ describe('AdjacencyList', () => {
       graph.addEdge(a, b);
       graph.addEdge(c, b, 2);
 
-      const nodeIds = [];
+      const nodeIds: Array<any> = [];
       graph.forEachNodeIdConnectedTo(
         b,
-        (id) => {
+        (id: any) => {
           nodeIds.push(id);
         },
         ALL_EDGE_TYPES,
@@ -413,8 +405,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(b, d, 3);
       graph.addEdge(c, e, 4);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedFromReverse(a, (nodeId) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedFromReverse(a, (nodeId: any) => {
         nodeIds.push(nodeId);
         return false;
       });
@@ -432,8 +424,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(a, c);
       graph.addEdge(a, a);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedFromReverse(a, (nodeId) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedFromReverse(a, (nodeId: any) => {
         nodeIds.push(nodeId);
         return false;
       });
@@ -452,8 +444,8 @@ describe('AdjacencyList', () => {
       graph.addEdge(a, c);
       graph.addEdge(a, d);
 
-      const nodeIds = [];
-      graph.forEachNodeIdConnectedFromReverse(a, (nodeId) => {
+      const nodeIds: Array<any> = [];
+      graph.forEachNodeIdConnectedFromReverse(a, (nodeId: any) => {
         nodeIds.push(nodeId);
         return true;
       });
@@ -472,10 +464,10 @@ describe('AdjacencyList', () => {
       graph.addEdge(a, c, 2);
       graph.addEdge(a, d);
 
-      const nodeIds = [];
+      const nodeIds: Array<any> = [];
       graph.forEachNodeIdConnectedFromReverse(
         a,
-        (nodeId) => {
+        (nodeId: any) => {
           nodeIds.push(nodeId);
           return false;
         },
@@ -503,7 +495,7 @@ describe('AdjacencyList', () => {
       let originalSerialized = graph.serialize();
       let originalNodes = [...originalSerialized.nodes];
       let originalEdges = [...originalSerialized.edges];
-      let work = new Promise((resolve) => worker.on('message', resolve));
+      let work = new Promise((resolve: any) => worker.on('message', resolve));
       worker.postMessage(originalSerialized);
       let received = AdjacencyList.deserialize(await work);
       // eslint-disable-next-line no-unused-vars
@@ -512,7 +504,7 @@ describe('AdjacencyList', () => {
       assert.deepEqual(received.serialize().nodes, graph.serialize().nodes);
       assert.deepEqual(received.serialize().edges, graph.serialize().edges);
 
-      originalNodes.forEach((v, i) => {
+      originalNodes.forEach((v: any, i: any) => {
         if (i < NodeTypeMap.HEADER_SIZE) {
           assert.equal(v, received.serialize().nodes[i]);
           assert.equal(v, graph.serialize().nodes[i]);
@@ -522,7 +514,7 @@ describe('AdjacencyList', () => {
         }
       });
 
-      originalEdges.forEach((v, i) => {
+      originalEdges.forEach((v: any, i: any) => {
         if (i < EdgeTypeMap.HEADER_SIZE) {
           assert.equal(v, received.serialize().edges[i]);
           assert.equal(v, graph.serialize().edges[i]);

package/test/{BitSet.test.js → BitSet.test.ts}

@@ -1,18 +1,16 @@
-// @flow strict-local
-
 import assert from 'assert';
 import {BitSet} from '../src/BitSet';
 
 function assertValues(set: BitSet, values: Array<number>) {
-  let setValues = [];
-  set.forEach((bit) => {
+  let setValues: Array<any> = [];
+  set.forEach((bit: any) => {
     setValues.push(bit);
   });
 
   for (let value of values) {
     assert(set.has(value), 'Set.has returned false');
     assert(
-      setValues.some((v) => v === value),
+      setValues.some((v: any) => v === value),
       'Set values is missing value',
     );
   }

package/test/{ContentGraph.test.js → ContentGraph.test.ts}

@@ -1,5 +1,3 @@
-// @flow strict-local
-
 import assert from 'assert';
 import ContentGraph from '../src/ContentGraph';
 
@@ -7,7 +5,7 @@ describe('ContentGraph', () => {
   it('should addNodeByContentKey if no node exists with the content key', () => {
     let graph = new ContentGraph();
 
-    const node = {};
+    const node: Record<string, any> = {};
 
     const nodeId1 = graph.addNodeByContentKey('contentKey', node);
 
@@ -29,7 +27,7 @@ describe('ContentGraph', () => {
   it('should remove the content key from graph when node is removed', () => {
     let graph = new ContentGraph();
 
-    const node1 = {};
+    const node1: Record<string, any> = {};
     const nodeId1 = graph.addNodeByContentKey('contentKey', node1);
 
     assert.equal(graph.getNode(nodeId1), node1);