default DiffTreeSource from parsed linegraph for easier debugging

Author: pmbittner

src/main/java/org/variantsync/diffdetective/diff/difftree/serialize/LineGraphImport.java

@@ -1,6 +1,7 @@
 package org.variantsync.diffdetective.diff.difftree.serialize;
 
 import org.variantsync.diffdetective.diff.difftree.*;
+import org.variantsync.diffdetective.diff.difftree.source.LineGraphFileSource;
 import org.variantsync.diffdetective.util.Assert;
 import org.variantsync.diffdetective.util.FileUtils;
 import org.variantsync.functjonal.Pair;
@@ -23,15 +24,15 @@ public class LineGraphImport {
     public static List<DiffTree> fromFile(final Path path, final DiffTreeLineGraphImportOptions options) {
         Assert.assertTrue(Files.isRegularFile(path));
         Assert.assertTrue(FileUtils.isLineGraph(path));
-        return fromLineGraph(FileUtils.readUTF8(path), options);
+        return fromLineGraph(FileUtils.readUTF8(path), path, options);
     }
 
 	/**
 	 * Transforms a line graph into a list of {@link DiffTree DiffTrees}.
 	 * 
 	 * @return All {@link DiffTree DiffTrees} contained in the line graph
 	 */
-	public static List<DiffTree> fromLineGraph(final String lineGraph, final DiffTreeLineGraphImportOptions options) {
+	public static List<DiffTree> fromLineGraph(final String lineGraph, final Path originalFile, final DiffTreeLineGraphImportOptions options) {
 		java.util.Scanner input = new java.util.Scanner(lineGraph);
 
 		// All DiffTrees read from the line graph
@@ -57,7 +58,7 @@ public static List<DiffTree> fromLineGraph(final String lineGraph, final DiffTre
 				// the line represents a DiffTree
 
 				if (!diffNodeList.isEmpty()) {
-					curDiffTree = parseDiffTree(previousDiffTreeLine, diffNodeList, options); // parse to DiffTree
+					curDiffTree = parseDiffTree(previousDiffTreeLine, originalFile, diffNodeList, options); // parse to DiffTree
 					diffTreeList.add(curDiffTree); // add newly computed DiffTree to the list of all DiffTrees
 
 					// Remove all DiffNodes from list
@@ -100,7 +101,7 @@ public static List<DiffTree> fromLineGraph(final String lineGraph, final DiffTre
 		input.close();
 
 		if (!diffNodeList.isEmpty()) {
-			curDiffTree = parseDiffTree(previousDiffTreeLine, diffNodeList, options); // parse to DiffTree
+			curDiffTree = parseDiffTree(previousDiffTreeLine, originalFile, diffNodeList, options); // parse to DiffTree
 			diffTreeList.add(curDiffTree); // add newly computed DiffTree to the list of all DiffTrees
 		}
 
@@ -116,8 +117,16 @@ public static List<DiffTree> fromLineGraph(final String lineGraph, final DiffTre
 	 * @param options {@link DiffTreeLineGraphImportOptions}
 	 * @return {@link DiffTree}
 	 */
-	private static DiffTree parseDiffTree(final String lineGraph, final List<DiffNode> diffNodeList, final DiffTreeLineGraphImportOptions options) {
-		final DiffTreeSource diffTreeSource = options.treeFormat().fromLineGraphLine(lineGraph);
+	private static DiffTree parseDiffTree(final String lineGraph, final Path inFile, final List<DiffNode> diffNodeList, final DiffTreeLineGraphImportOptions options) {
+		DiffTreeSource diffTreeSource = options.treeFormat().fromLineGraphLine(lineGraph);
+
+		if (diffTreeSource == null || DiffTreeSource.Unknown.equals(diffTreeSource)) {
+			diffTreeSource = new LineGraphFileSource(
+					lineGraph,
+					inFile
+			);
+		}
+
 		// Handle trees and graphs differently
 		if (options.graphFormat() == GraphFormat.DIFFGRAPH) {
 			// If you should interpret the input data as DiffTrees, always expect a root to be present. Parse all nodes (v) to a list of nodes. Search for the root. Assert that there is exactly one root.

src/main/java/org/variantsync/diffdetective/diff/difftree/source/LineGraphFileSource.java

@@ -0,0 +1,11 @@
+package org.variantsync.diffdetective.diff.difftree.source;
+
+import org.variantsync.diffdetective.diff.difftree.DiffTreeSource;
+
+import java.nio.file.Path;
+
+public record LineGraphFileSource(
+        String graphHeader,
+        Path file
+) implements DiffTreeSource {
+}