dot-language-support 1.5.3 → 1.5.6

package/lib/binder.js

@@ -117,7 +117,7 @@ function createBinder() {
     function bindIdEqualsIdStatement(node) {
         bind(node.leftId);
         bind(node.rightId);
-        if (node.rightId && !checker_1.nodeContainsErrors(node.rightId)) {
+        if (node.rightId && !(0, checker_1.nodeContainsErrors)(node.rightId)) {
             if (isAttributeName("color", node.leftId)) {
                 ensureGlobalColor(node.rightId);
             }
@@ -168,7 +168,7 @@ function createBinder() {
         if (carrierIdentifier)
             ensureMemberSymbol(node.leftId, carrierIdentifier);
         bind(node.rightId);
-        if (node.rightId && !checker_1.nodeContainsErrors(node.rightId)) {
+        if (node.rightId && !(0, checker_1.nodeContainsErrors)(node.rightId)) {
             if (isAttributeName("color", node.leftId)) {
                 ensureGlobalColor(node.rightId);
             }
@@ -205,8 +205,8 @@ function createBinder() {
         return new Map();
     }
     function ensureMemberSymbol(node, carrier) {
-        if (node && carrier && parser_1.isIdentifierNode(node)) {
-            const name = checker_1.getIdentifierText(node);
+        if (node && carrier && (0, parser_1.isIdentifierNode)(node)) {
+            const name = (0, checker_1.getIdentifierText)(node);
             if (name === undefined)
                 return;
             const carrierSymbol = carrier.symbol;
@@ -222,9 +222,9 @@ function createBinder() {
         debugger;
     }
     function ensureGlobalSymbol(node) {
-        if (node && parser_1.isIdentifierNode(node)) {
+        if (node && (0, parser_1.isIdentifierNode)(node)) {
             const symbols = symbolTable;
-            const name = checker_1.getIdentifierText(node);
+            const name = (0, checker_1.getIdentifierText)(node);
             if (name === undefined)
                 return;
             if (symbols === undefined)
@@ -252,9 +252,9 @@ function createBinder() {
         node.symbol = sym;
     }
     function ensureGlobalColor(node) {
-        if (node && parser_1.isIdentifierNode(node)) {
+        if (node && (0, parser_1.isIdentifierNode)(node)) {
             const colors = colorTable;
-            const name = checker_1.getIdentifierText(node);
+            const name = (0, checker_1.getIdentifierText)(node);
             if (name === undefined)
                 return;
             if (colors === undefined)
@@ -283,7 +283,7 @@ function createBinder() {
         };
     }
     function isAttributeName(name, id) {
-        return id ? checker_1.getIdentifierText(id).trim().toLowerCase() === name : false;
+        return id ? (0, checker_1.getIdentifierText)(id).trim().toLowerCase() === name : false;
     }
     return {
         bind: file => {

package/lib/checker.js

@@ -33,7 +33,7 @@ function findNodeAtOffset(root, offset, inclusiveEnd = false) {
     if (root.pos === offset && root.pos === root.end)
         return root;
     if (rangeContainsOffset(root, offset, inclusiveEnd)) {
-        const narrowerChild = visitor_1.forEachChild(root, child => findNodeAtOffset(child, offset, inclusiveEnd));
+        const narrowerChild = (0, visitor_1.forEachChild)(root, child => findNodeAtOffset(child, offset, inclusiveEnd));
         return narrowerChild ? narrowerChild : root;
     }
     return undefined;
@@ -54,7 +54,7 @@ function checkGraphSemantics(file, root) {
 }
 function findAllEdges(node) {
     const allEdges = [];
-    visitor_1.forEachChild(node, child => {
+    (0, visitor_1.forEachChild)(node, child => {
         if (isEdgeStatement(child)) {
             if (child.rhs && child.rhs.length > 0) {
                 for (const edgeRhs of child.rhs)
@@ -83,7 +83,7 @@ function isStatement(node) {
 }
 function findAllStatements(node, kind) {
     const allStatements = [];
-    visitor_1.forEachChild(node, child => {
+    (0, visitor_1.forEachChild)(node, child => {
         if ((kind === undefined && isStatement(child)) || (child.kind === kind)) {
             allStatements.push(child);
         }
@@ -113,7 +113,7 @@ function createEdgeViolationDiagnostics(file, expectedEdgeOp, violators) {
     const category = types_1.DiagnosticCategory.Error;
     violators.forEach(edge => edge.operation.flags |= 2);
     return violators.map(edge => {
-        const start = util_1.getStart(file, edge.operation);
+        const start = (0, util_1.getStart)(file, edge.operation);
         const end = edge.operation.end;
         return {
             message,
@@ -168,7 +168,7 @@ function getIdentifierText(n) {
         case types_1.SyntaxKind.QuotedTextIdentifier:
             return n.concatenation;
         default:
-            return util_1.assertNever(n);
+            return (0, util_1.assertNever)(n);
     }
 }
 exports.getIdentifierText = getIdentifierText;

package/lib/index.js

@@ -1,7 +1,11 @@
 "use strict";
 var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
 }) : (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
     o[k2] = m[k];

package/lib/parser.js

@@ -557,13 +557,13 @@ class Parser {
             ? "identifier"
             : this.token() === types_1.SyntaxKind.EndOfFileToken
                 ? "end of file"
-                : `"${scanner_1.getTokenAsText(this.token())}"`;
+                : `"${(0, scanner_1.getTokenAsText)(this.token())}"`;
         const expected = expectedKinds.map(k => {
             if (isIdentifier(k))
                 return "identifier";
             else if (k === types_1.SyntaxKind.EndOfFileToken)
                 return "end of file";
-            return `"${scanner_1.getTokenAsText(k)}"`;
+            return `"${(0, scanner_1.getTokenAsText)(k)}"`;
         });
         const lastExpected = expected.pop();
         const expectedJoined = expected.join(", ");

package/lib/scanner.js

@@ -4,7 +4,7 @@ exports.isLineBreak = exports.skipTrivia = exports.isIdentifierStart = exports.D
 const core_1 = require("./core");
 const types_1 = require("./types");
 const util_1 = require("./service/util");
-const textToToken = core_1.createMapFromTemplate({
+const textToToken = (0, core_1.createMapFromTemplate)({
     "digraph": types_1.SyntaxKind.DigraphKeyword,
     "graph": types_1.SyntaxKind.GraphKeyword,
     "edge": types_1.SyntaxKind.EdgeKeyword,
@@ -481,7 +481,7 @@ function isIdentifierPartOf(ch, idType) {
             return ch === 45
                 || ch === 46
                 || 48 <= ch && ch <= 57;
-        default: return util_1.assertNever(idType);
+        default: return (0, util_1.assertNever)(idType);
     }
 }
 function getIdentifierStart(ch) {

package/lib/service/codeAction.js

@@ -44,39 +44,39 @@ function getGeneralRefactorings(doc, file, range) {
     const kw = g.keyword;
     const rangeStartOffset = doc.offsetAt(range.start);
     const rangeEndOffset = doc.offsetAt(range.end);
-    const keywordStart = util_1.getStart(file, kw);
+    const keywordStart = (0, util_1.getStart)(file, kw);
     const res = [];
     if (isInRange(rangeStartOffset, rangeEndOffset, keywordStart, kw.end)) {
         if (!subtreeContainsErrors(g)) {
-            const oppositeGraphType = common_1.getOppositeKind(kw.kind);
+            const oppositeGraphType = (0, common_1.getOppositeKind)(kw.kind);
             const convertGraph = convertGraphTypeCommand(file, g, oppositeGraphType);
             res.push(convertGraph);
         }
     }
     if (rangeStartOffset === rangeEndOffset) {
         const candidates = [];
-        let clickedNode = checker_1.findNodeAtOffset(g, rangeStartOffset);
+        let clickedNode = (0, checker_1.findNodeAtOffset)(g, rangeStartOffset);
         if (clickedNode && !!clickedNode.parent) {
             if (clickedNode.kind === __1.SyntaxKind.SemicolonToken) {
                 res.push(RemoveSemicolonsCommand.create());
             }
-            if (__1.isIdentifierNode(clickedNode)) {
+            if ((0, __1.isIdentifierNode)(clickedNode)) {
                 clickedNode = clickedNode.parent;
             }
             const clickedEdgeStatement = clickedNode.parent;
             if (clickedEdgeStatement && !subtreeContainsErrors(clickedEdgeStatement)) {
-                if (checker_1.isEdgeStatement(clickedEdgeStatement)
+                if ((0, checker_1.isEdgeStatement)(clickedEdgeStatement)
                     && clickedEdgeStatement.rhs.length === 1
-                    && checker_1.isNodeId(clickedEdgeStatement.source)
-                    && !checker_1.edgeStatementHasAttributes(clickedEdgeStatement)) {
+                    && (0, checker_1.isNodeId)(clickedEdgeStatement.source)
+                    && !(0, checker_1.edgeStatementHasAttributes)(clickedEdgeStatement)) {
                     candidates.push(clickedEdgeStatement);
                     const source = clickedEdgeStatement.source;
-                    const sourceText = checker_1.getIdentifierText(source.id);
+                    const sourceText = (0, checker_1.getIdentifierText)(source.id);
                     const graphParent = clickedEdgeStatement.parent;
                     if (graphParent) {
                         let hasVisitedStatement = false;
                         let hasVisitedNodeModifier = false;
-                        __1.forEachChild(graphParent, statement => {
+                        (0, __1.forEachChild)(graphParent, statement => {
                             if (statement === clickedEdgeStatement) {
                                 hasVisitedStatement = true;
                                 return undefined;
@@ -85,19 +85,19 @@ function getGeneralRefactorings(doc, file, range) {
                                 return;
                             }
                             else if (hasVisitedStatement) {
-                                if (checker_1.isAttrStatement(statement)
+                                if ((0, checker_1.isAttrStatement)(statement)
                                     || subtreeContainsErrors(statement)) {
                                     hasVisitedNodeModifier = true;
                                     return true;
                                 }
                             }
                             if (hasVisitedStatement) {
-                                if (checker_1.isEdgeStatement(statement)
+                                if ((0, checker_1.isEdgeStatement)(statement)
                                     && statement.rhs.length === 1
-                                    && !checker_1.edgeStatementHasAttributes(statement)) {
+                                    && !(0, checker_1.edgeStatementHasAttributes)(statement)) {
                                     const statementSource = statement.source;
-                                    if (checker_1.isNodeId(statementSource)) {
-                                        const lowerSourceText = checker_1.getIdentifierText(statementSource.id);
+                                    if ((0, checker_1.isNodeId)(statementSource)) {
+                                        const lowerSourceText = (0, checker_1.getIdentifierText)(statementSource.id);
                                         if (sourceText === lowerSourceText) {
                                             candidates.push(statement);
                                         }
@@ -123,7 +123,7 @@ function getCommandsForDiagnostic(doc, file, d) {
         case 1: return getScannerErrorCommand(doc, file, d, d.code);
         case 2: return getParserErrorCommand(doc, file, d, d.code);
         case 4: return getCheckerErrorCommand(doc, file, d, d.code);
-        default: return util_1.assertNever(d.code);
+        default: return (0, util_1.assertNever)(d.code);
     }
 }
 function getScannerErrorCommand(doc, file, d, code) {
@@ -144,12 +144,12 @@ function getCheckerErrorCommand(doc, file, d, code) {
             const graph = file.graph;
             if (!graph)
                 return undefined;
-            const allowedOp = checker_1.getAllowedEdgeOperation(graph);
-            const wrongOp = common_1.getOppositeEdgeOp(allowedOp);
+            const allowedOp = (0, checker_1.getAllowedEdgeOperation)(graph);
+            const wrongOp = (0, common_1.getOppositeEdgeOp)(allowedOp);
             const kwk = graph.keyword.kind;
             const fixSingleEdge = ChangeEdgeOpCommand.create(d.start, d.end, allowedOp, wrongOp);
             const fixAll = convertGraphTypeCommand(file, graph, kwk);
-            const convertToThisWrongType = convertGraphTypeCommand(file, graph, common_1.getOppositeKind(kwk));
+            const convertToThisWrongType = convertGraphTypeCommand(file, graph, (0, common_1.getOppositeKind)(kwk));
             return [
                 fixSingleEdge,
                 fixAll,
@@ -159,16 +159,16 @@ function getCheckerErrorCommand(doc, file, d, code) {
     }
 }
 function convertGraphTypeCommand(file, graph, changeToGraphType) {
-    const changeToEdgeOp = common_1.getAllowedOp(changeToGraphType);
-    const allEdges = checker_1.findAllEdges(graph);
+    const changeToEdgeOp = (0, common_1.getAllowedOp)(changeToGraphType);
+    const allEdges = (0, checker_1.findAllEdges)(graph);
     const edgeOffsets = allEdges
         .filter(e => e.operation.kind !== changeToEdgeOp)
         .map(e => ({
-        start: util_1.getStart(file, e.operation),
+        start: (0, util_1.getStart)(file, e.operation),
         end: e.operation.end
     }));
     const graphTypeOffset = {
-        start: util_1.getStart(file, graph.keyword),
+        start: (0, util_1.getStart)(file, graph.keyword),
         end: graph.keyword.end
     };
     return ChangeAllOtherEdgeOpsAndFixGraphCommand.create(edgeOffsets, changeToEdgeOp, graphTypeOffset, graph.keyword.kind, changeToGraphType);
@@ -198,11 +198,11 @@ function executeCommand(doc, sourceFile, cmd) {
 }
 exports.executeCommand = executeCommand;
 function subtreeContainsErrors(node) {
-    if (checker_1.nodeContainsErrors(node))
+    if ((0, checker_1.nodeContainsErrors)(node))
         return true;
     let hasError = false;
-    __1.forEachChild(node, child => {
-        if (checker_1.nodeContainsErrors(child)) {
+    (0, __1.forEachChild)(node, child => {
+        if ((0, checker_1.nodeContainsErrors)(child)) {
             hasError = true;
         }
         if (!hasError) {

package/lib/service/colorProvider.js

@@ -32,7 +32,7 @@ function colorTableToColorInformation(doc, sf, colors) {
         const color = getColorFromName(name);
         if (color) {
             res.push({
-                range: util_1.syntaxNodeToRange(doc, sf, value.node),
+                range: (0, util_1.syntaxNodeToRange)(doc, sf, value.node),
                 color,
             });
         }

package/lib/service/command/ChangeAllOtherEdgeOpsAndFixGraphCommand.js

@@ -3,11 +3,11 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.execute = exports.create = void 0;
 const common_1 = require("./common");
 function create(edgeOffsets, changeEdgesTo, graphOffset, changeFromGraph, changeGraphTo) {
-    const toGraph = common_1.getGraphKeywordStr(changeGraphTo);
+    const toGraph = (0, common_1.getGraphKeywordStr)(changeGraphTo);
     const title = changeGraphTo === changeFromGraph
         ? `Fix all edges to match ${toGraph}`
-        : `Convert ${common_1.getGraphKeywordStr(changeFromGraph)} to ${toGraph}`;
-    const edgeStr = common_1.getEdgeStr(changeEdgesTo);
+        : `Convert ${(0, common_1.getGraphKeywordStr)(changeFromGraph)} to ${toGraph}`;
+    const edgeStr = (0, common_1.getEdgeStr)(changeEdgesTo);
     return {
         title,
         command: "DOT.convertGraphType",
@@ -22,11 +22,11 @@ function execute(doc, sourceFile, cmd) {
     const edits = edgeOffsets.map(o => {
         const startPos = doc.positionAt(o.start);
         const endPos = doc.positionAt(o.end);
-        return common_1.createChangeToEdit(startPos, endPos, changeEdgeTo);
+        return (0, common_1.createChangeToEdit)(startPos, endPos, changeEdgeTo);
     });
     const graphStart = doc.positionAt(graphOffset.start);
     const graphEnd = doc.positionAt(graphOffset.end);
-    edits.push(common_1.createChangeToEdit(graphStart, graphEnd, changeGraphTo));
+    edits.push((0, common_1.createChangeToEdit)(graphStart, graphEnd, changeGraphTo));
     return {
         label: `Convert graph to "${changeGraphTo}"`,
         edit: {

package/lib/service/command/ChangeEdgeOpCommand.js

@@ -4,8 +4,8 @@ exports.execute = exports.create = void 0;
 const lst = require("vscode-languageserver-types");
 const common_1 = require("./common");
 function create(startOffset, endOffset, changeTo, changeFrom) {
-    const from = common_1.getEdgeStr(changeFrom);
-    const to = common_1.getEdgeStr(changeTo);
+    const from = (0, common_1.getEdgeStr)(changeFrom);
+    const to = (0, common_1.getEdgeStr)(changeTo);
     return {
         title: `Change "${from}" to "${to}".`,
         command: "DOT.changeEdgeOp",

package/lib/service/command/ConsolidateDescendantsCommand.js

@@ -16,7 +16,7 @@ const checker_1 = require("../../checker");
 const util_1 = require("../util");
 function create(statements, below) {
     const first = statements[0];
-    const from = checker_1.getIdentifierText(first.source.id);
+    const from = (0, checker_1.getIdentifierText)(first.source.id);
     const title = below
         ? `Convert edges below from "${from}" to subgraph`
         : `Convert edges from "${from}" to subgraph`;
@@ -41,12 +41,12 @@ function execute(doc, sourceFile, cmd) {
     if (!g)
         return undefined;
     const candidateIndexes = cmd.arguments;
-    const candidates = candidateIndexes.map(i => checker_1.findNodeAtOffset(g, i).parent.parent);
+    const candidates = candidateIndexes.map(i => (0, checker_1.findNodeAtOffset)(g, i).parent.parent);
     const first = candidates.shift();
-    const from = checker_1.getIdentifierText(first.source.id);
+    const from = (0, checker_1.getIdentifierText)(first.source.id);
     const edits = [];
     const firstRight = first.rhs[0];
-    const firstRightTargetStart = util_1.getStart(sourceFile, firstRight.target);
+    const firstRightTargetStart = (0, util_1.getStart)(sourceFile, firstRight.target);
     const firstRightTargetEnd = firstRight.target.end;
     const contents = [
         sourceFile.content.substring(firstRightTargetStart, firstRightTargetEnd)
@@ -75,7 +75,7 @@ function execute(doc, sourceFile, cmd) {
             edits.push({
                 newText: "",
                 range: {
-                    start: doc.positionAt(util_1.getStart(sourceFile, descendant.terminator)),
+                    start: doc.positionAt((0, util_1.getStart)(sourceFile, descendant.terminator)),
                     end: doc.positionAt(descendant.terminator.end),
                 }
             });

package/lib/service/command/RemoveSemicolons.js

@@ -17,11 +17,11 @@ function execute(doc, sourceFile, cmd) {
     const g = sourceFile.graph;
     if (!g)
         return undefined;
-    const semicolons = checker_1.findOptionalSemicolons(g);
+    const semicolons = (0, checker_1.findOptionalSemicolons)(g);
     const edits = semicolons.map(s => {
         const end = s.end;
         const start = end - 1;
-        return common_1.createChangeToEdit(doc.positionAt(start), doc.positionAt(end), "");
+        return (0, common_1.createChangeToEdit)(doc.positionAt(start), doc.positionAt(end), "");
     });
     return {
         label: `Remove optional semicolons`,

package/lib/service/completion.js

@@ -15,14 +15,14 @@ function getCompletions(doc, sourceFile, position) {
     if (!g)
         return [];
     const offset = doc.offsetAt(position);
-    const node = checker_1.findNodeAtOffset(g, offset, true);
+    const node = (0, checker_1.findNodeAtOffset)(g, offset, true);
     if (!node)
         return [];
-    const prevOffsetNode = checker_1.findNodeAtOffset(g, offset - 1, true);
+    const prevOffsetNode = (0, checker_1.findNodeAtOffset)(g, offset - 1, true);
     const parent = node.parent;
     const prevOffsetNodeParent = prevOffsetNode === null || prevOffsetNode === void 0 ? void 0 : prevOffsetNode.parent;
-    if (((parent === null || parent === void 0 ? void 0 : parent.parent) && checker_1.isEdgeStatement(parent.parent))
-        || ((prevOffsetNodeParent === null || prevOffsetNodeParent === void 0 ? void 0 : prevOffsetNodeParent.parent) && checker_1.isEdgeStatement(prevOffsetNodeParent.parent))) {
+    if (((parent === null || parent === void 0 ? void 0 : parent.parent) && (0, checker_1.isEdgeStatement)(parent.parent))
+        || ((prevOffsetNodeParent === null || prevOffsetNodeParent === void 0 ? void 0 : prevOffsetNodeParent.parent) && (0, checker_1.isEdgeStatement)(prevOffsetNodeParent.parent))) {
         return getNodeCompletions(symbols);
     }
     if (node.kind === types_1.SyntaxKind.AttributeContainer) {
@@ -44,10 +44,10 @@ function getCompletions(doc, sourceFile, position) {
         || (node.kind == types_1.SyntaxKind.CommaToken && (parent === null || parent === void 0 ? void 0 : parent.kind) === types_1.SyntaxKind.Assignment)) {
         return getAttributeCompletions(position);
     }
-    const prevNode = checker_1.findNodeAtOffset(g, node.pos - 1, true);
+    const prevNode = (0, checker_1.findNodeAtOffset)(g, node.pos - 1, true);
     if (!prevNode)
         return [];
-    if (__1.isIdentifierNode(prevNode)) {
+    if ((0, __1.isIdentifierNode)(prevNode)) {
         const p = prevNode.parent;
         if (p) {
             switch (p.kind) {
@@ -75,7 +75,7 @@ function getCompletions(doc, sourceFile, position) {
 }
 exports.getCompletions = getCompletions;
 function getAssignmentCompletion(assignment) {
-    const property = checker_1.getIdentifierText(assignment.leftId);
+    const property = (0, checker_1.getIdentifierText)(assignment.leftId);
     if (!property)
         return [];
     switch (property.toLowerCase()) {
@@ -88,7 +88,7 @@ function getShapeCompletions() {
     const kind = lst.CompletionItemKind.EnumMember;
     return languageFacts.shapes.map(s => ({
         kind,
-        label: util_1.escapeIdentifierText(s),
+        label: (0, util_1.escapeIdentifierText)(s),
     }));
 }
 function getColorCompletions() {
@@ -112,7 +112,7 @@ function getAttributeCompletions(posistion) {
         label,
         textEdit: {
             range,
-            newText: util_1.escapeIdentifierText(label) + "=",
+            newText: (0, util_1.escapeIdentifierText)(label) + "=",
         },
     }));
 }
@@ -132,7 +132,7 @@ function getNodeCompletions(symbols, exlucdedSymbols) {
             }
         }
         res.push({
-            label: util_1.escapeIdentifierText(key),
+            label: (0, util_1.escapeIdentifierText)(key),
             kind: kind,
         });
     }

package/lib/service/hover.js

@@ -11,7 +11,7 @@ function hover(doc, sourceFile, position) {
     const g = sourceFile.graph;
     if (!g)
         return undefined;
-    const node = checker_1.findNodeAtOffset(g, offset);
+    const node = (0, checker_1.findNodeAtOffset)(g, offset);
     if (node === undefined)
         return undefined;
     return getNodeHover(doc, sourceFile, node);
@@ -22,22 +22,22 @@ function getNodeHover(doc, sf, n) {
     if (contents) {
         return {
             contents,
-            range: util_1.syntaxNodeToRange(doc, sf, n),
+            range: (0, util_1.syntaxNodeToRange)(doc, sf, n),
         };
     }
     return undefined;
 }
 function getHoverContents(n) {
-    if (parser_1.isIdentifierNode(n)) {
+    if ((0, parser_1.isIdentifierNode)(n)) {
         const parent = n.parent;
         if (parent) {
             switch (parent.kind) {
                 case types_1.SyntaxKind.NodeId:
-                    return `(node) ${checker_1.getIdentifierText(n)}`;
+                    return `(node) ${(0, checker_1.getIdentifierText)(n)}`;
                 case types_1.SyntaxKind.Assignment: {
                     const assignment = parent;
-                    const left = checker_1.getIdentifierText(assignment.leftId);
-                    const right = checker_1.getIdentifierText(assignment.rightId);
+                    const left = (0, checker_1.getIdentifierText)(assignment.leftId);
+                    const right = (0, checker_1.getIdentifierText)(assignment.rightId);
                     return `(assignment) \`${left}\` = \`${right}\``;
                 }
                 case types_1.SyntaxKind.DirectedGraph:
@@ -48,19 +48,19 @@ function getHoverContents(n) {
                     const sgs = parent;
                     const sg = sgs.subgraph;
                     return !!sg.id
-                        ? `(sub graph) ${checker_1.getIdentifierText(sg.id)}`
+                        ? `(sub graph) ${(0, checker_1.getIdentifierText)(sg.id)}`
                         : `(sub graph)`;
                 }
                 case types_1.SyntaxKind.SubGraph: {
                     const sg = parent;
                     return !!sg.id
-                        ? `(sub graph) ${checker_1.getIdentifierText(sg.id)}`
+                        ? `(sub graph) ${(0, checker_1.getIdentifierText)(sg.id)}`
                         : `(sub graph)`;
                 }
                 case types_1.SyntaxKind.IdEqualsIdStatement: {
                     const idEqId = parent;
-                    const left = checker_1.getIdentifierText(idEqId.leftId);
-                    const right = checker_1.getIdentifierText(idEqId.rightId);
+                    const left = (0, checker_1.getIdentifierText)(idEqId.leftId);
+                    const right = (0, checker_1.getIdentifierText)(idEqId.rightId);
                     return `(graph property) \`${left}\` = \`${right}\``;
                 }
                 case types_1.SyntaxKind.EdgeRhs:
@@ -93,7 +93,7 @@ function getGraphHover(g) {
     const graphId = g.id;
     const strict = g.strict ? "strict " : "";
     return !!graphId
-        ? `(${strict}${direction} graph) ${(checker_1.getIdentifierText(graphId))}`
+        ? `(${strict}${direction} graph) ${((0, checker_1.getIdentifierText)(graphId))}`
         : `(${strict}${direction} graph)`;
 }
 function getEdgeHover(n) {
@@ -108,16 +108,16 @@ function getEdgeHover(n) {
     }
     if (source === undefined)
         source = p.source;
-    const edgeOpStr = common_1.getEdgeStr(n.operation.kind);
+    const edgeOpStr = (0, common_1.getEdgeStr)(n.operation.kind);
     return source === undefined
         ? undefined
         : `(edge) ${getEdgeSourceOrTargetText(source)} ${edgeOpStr} ${getEdgeSourceOrTargetText(n.target)}`;
 }
 function getEdgeSourceOrTargetText(n) {
     return n.kind === types_1.SyntaxKind.NodeId
-        ? checker_1.getIdentifierText(n.id)
+        ? (0, checker_1.getIdentifierText)(n.id)
         : n.id !== undefined
-            ? `${checker_1.getIdentifierText(n.id)}`
+            ? `${(0, checker_1.getIdentifierText)(n.id)}`
             : "sub graph";
 }
 //# sourceMappingURL=hover.js.map

package/lib/service/reference.js

@@ -11,10 +11,10 @@ function findReferences(doc, sourceFile, position, context) {
     if (!g)
         return [];
     const offset = doc.offsetAt(position);
-    const node = checker_1.findNodeAtOffset(g, offset);
+    const node = (0, checker_1.findNodeAtOffset)(g, offset);
     if (!node)
         return [];
-    if (__1.isIdentifierNode(node)) {
+    if ((0, __1.isIdentifierNode)(node)) {
         const nodeSymbol = node.symbol;
         if (!nodeSymbol)
             throw "node.symbol is not bound";
@@ -34,7 +34,7 @@ function findReferences(doc, sourceFile, position, context) {
                 ];
             }
         }
-        const ranges = util_1.syntaxNodesToRanges(doc, sourceFile, symbolRefs);
+        const ranges = (0, util_1.syntaxNodesToRanges)(doc, sourceFile, symbolRefs);
         const uri = doc.uri;
         return ranges.map(range => {
             return { uri, range };
@@ -51,10 +51,10 @@ function findDefinition(doc, sourceFile, position) {
     if (!g)
         return undefined;
     const offset = doc.offsetAt(position);
-    const node = checker_1.findNodeAtOffset(g, offset);
+    const node = (0, checker_1.findNodeAtOffset)(g, offset);
     if (!node)
         return undefined;
-    if (__1.isIdentifierNode(node)) {
+    if ((0, __1.isIdentifierNode)(node)) {
         const nodeSymbol = node.symbol;
         if (!nodeSymbol)
             throw "node.symbol is not bound";
@@ -63,7 +63,7 @@ function findDefinition(doc, sourceFile, position) {
         const firstMention = nodeSymbol.firstMention;
         if (!firstMention)
             return undefined;
-        const range = util_1.syntaxNodeToRange(doc, sourceFile, firstMention);
+        const range = (0, util_1.syntaxNodeToRange)(doc, sourceFile, firstMention);
         return { uri: doc.uri, range };
     }
     debugger;

package/lib/service/rename.js

@@ -15,17 +15,17 @@ function renameSymbol(doc, sourceFile, position, newName) {
     if (!g)
         return undefined;
     const offset = doc.offsetAt(position);
-    const node = checker_1.findNodeAtOffset(g, offset);
+    const node = (0, checker_1.findNodeAtOffset)(g, offset);
     if (!node)
         return undefined;
     const parent = node.parent;
-    if (__1.isIdentifierNode(node) && isRenamableIdentifier(node) && !!parent && isRenameableNode(parent)) {
+    if ((0, __1.isIdentifierNode)(node) && isRenamableIdentifier(node) && !!parent && isRenameableNode(parent)) {
         const nodeSymbol = node.symbol;
         if (!nodeSymbol)
             throw "node.symbol is not bound";
         const r = nodeSymbol.references;
         const refs = r ? [nodeSymbol.firstMention, ...r] : [nodeSymbol.firstMention];
-        const ranges = util_1.syntaxNodesToRanges(doc, sourceFile, refs);
+        const ranges = (0, util_1.syntaxNodesToRanges)(doc, sourceFile, refs);
         const uri = doc.uri;
         const res = {
             changes: {

package/lib/service/service.js

@@ -15,8 +15,8 @@ function parseDocument(doc) {
     const parser = new __1.Parser();
     const content = typeof doc === "string" ? doc : doc.getText();
     const sourceFile = parser.parse(content);
-    binder_1.bindSourceFile(sourceFile);
-    checker_1.checkSourceFile(sourceFile);
+    (0, binder_1.bindSourceFile)(sourceFile);
+    (0, checker_1.checkSourceFile)(sourceFile);
     return sourceFile;
 }
 function createService() {

package/lib/service/util.js

@@ -10,7 +10,7 @@ exports.getStart = getStart;
 function getTokenPosOfNode(sourceFile, node) {
     if (nodeIsMissing(node))
         return node.pos;
-    return scanner_1.skipTrivia(sourceFile.content, node.pos);
+    return (0, scanner_1.skipTrivia)(sourceFile.content, node.pos);
 }
 function nodeIsMissing(node) {
     return node === undefined
@@ -39,7 +39,7 @@ function escapeIdentifierText(text) {
         return quote(esc);
     }
     const ch = text.charCodeAt(0);
-    if (!scanner_1.isIdentifierStart(ch) || text.includes(" "))
+    if (!(0, scanner_1.isIdentifierStart)(ch) || text.includes(" "))
         return quote(text);
     return text;
 }

package/lib/service/validation.js

@@ -9,7 +9,7 @@ function convertDiagnostic(document, source) {
             end: document.positionAt(source.end),
         },
         severity: source.category,
-        code: error_1.formatError(source.code),
+        code: (0, error_1.formatError)(source.code),
         source: error_1.diagnosicSource,
         message: source.message,
     };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dot-language-support",
-  "version": "1.5.3",
+  "version": "1.5.6",
   "description": "Parser and language service for graphviz (dot) files",
   "author": "Niklas Mollenhauer",
   "license": "MIT",
@@ -28,12 +28,12 @@
     "vscode-languageserver-types": "^3.16.0"
   },
   "devDependencies": {
-    "@types/chai": "^4.2.21",
-    "@types/mocha": "^9.0.0",
-    "chai": "^4.3.4",
-    "mocha": "^9.0.3",
-    "ts-node": "^10.1.0",
-    "typescript": "^4.3.5",
+    "@types/chai": "^4.3.0",
+    "@types/mocha": "^9.1.0",
+    "chai": "^4.3.6",
+    "mocha": "^9.2.2",
+    "ts-node": "^10.7.0",
+    "typescript": "^4.6.3",
     "vscode-languageserver": "^7.0.0"
   },
   "engines": {