Spotless: format Java sources

Author: sebastian-nagel

src/main/java/org/commoncrawl/webgraph/HostToDomainGraph.java

@@ -88,8 +88,12 @@ public class HostToDomainGraph {
 		if ((numInputLinesNodes % 500000) != 0 || numInputLinesNodes == 0) {
 			return;
 		}
-		LOG.info("Processed {} node input lines, mapped to {} domains, domain queue usage: {} (max. {})",
-				numInputLinesNodes, (currentId + 1), domainQueue.size(), maxQueueUsed);
+		LOG.info(
+				"Processed {} node input lines, mapped to {} domains, domain queue usage: {} (max. {})",
+				numInputLinesNodes,
+				(currentId + 1),
+				domainQueue.size(),
+				maxQueueUsed);
 	};
 
 	private Consumer<? super String> reporterInputEdges = (String line) -> {
@@ -441,7 +445,10 @@ public void convert(Function<String, String> func, Stream<String> in, PrintStrea
 		in.map(func).filter(Objects::nonNull).forEach(out::println);
 	}
 
-	public void convert(Function<String, String> func, Stream<String> in, PrintStream out,
+	public void convert(
+			Function<String, String> func,
+			Stream<String> in,
+			PrintStream out,
 			Consumer<? super String> reporter) {
 		convert(func, in.peek(reporter), out);
 	}

src/main/java/org/commoncrawl/webgraph/explore/Graph.java

@@ -522,9 +522,11 @@ public void subgraphMetrics(long[] nodes) {
 		LOG.info("\toutlinks = {} (links from the subgraph to outer nodes)", clusterOutlinks);
 		LOG.info("\ttotal inlinks = {} (all inlinks)", totalInlinks);
 		LOG.info("\ttotal outlinks = {} (all outlinks)", totalOutlinks);
-		LOG.info("\tnodes linked = {} (outer nodes linked from subgraph)",
+		LOG.info(
+				"\tnodes linked = {} (outer nodes linked from subgraph)",
 				sharedSuccessors(nodes, 1, nodes.length).length);
-		LOG.info("\tnodes linking = {} (outer nodes linking to subgraph)",
+		LOG.info(
+				"\tnodes linking = {} (outer nodes linking to subgraph)",
 				sharedPredecessors(nodes, 1, nodes.length).length);
 	}
 }

src/main/java/org/commoncrawl/webgraph/explore/GraphExplorer.java

@@ -304,8 +304,11 @@ public void printVertices(int[] vertexIDs) {
 	 */
 	public static Stream<Entry<String, Long>> frequencies(Stream<String> strings) {
 		final Comparator<Entry<String, Long>> comp = Comparator.comparingLong((Entry<String, Long> e) -> e.getValue())
-				.reversed().thenComparing(Comparator.comparing((Entry<String, Long> e) -> e.getKey()));
-		return strings.collect(Collectors.groupingBy(Function.identity(), Collectors.counting())).entrySet().stream()
+				.reversed()
+				.thenComparing(Comparator.comparing((Entry<String, Long> e) -> e.getKey()));
+		return strings.collect(Collectors.groupingBy(Function.identity(), Collectors.counting()))
+				.entrySet()
+				.stream()
 				.sorted(comp);
 	}
 }

src/test/java/org/commoncrawl/webgraph/TestCountingMergedIntIterator.java

@@ -57,7 +57,9 @@ void testSimple() {
 			assertTrue(iter.getCount() > 0);
 			totalCount += iter.getCount();
 			assertFalse(iter.hasNext());
-			assertEquals(totalCountExpected, totalCount,
+			assertEquals(
+					totalCountExpected,
+					totalCount,
 					"expected total count for input " + Arrays.deepToString(tArrays) + " is " + totalCountExpected);
 		}
 

src/test/java/org/commoncrawl/webgraph/TestHostToDomainGraph.java

@@ -230,7 +230,8 @@ void testConvertNodesHyphenatedDomainsSubDomainOnly() {
 		testSorted(hostGraphHyphenatedDomainsSubDomainOnly);
 		testSorted(domainGraphHyphenatedDomains);
 		converter.doCount(true);
-		assertArrayEquals(domainGraphHyphenatedDomainsSubDomainOnly,
+		assertArrayEquals(
+				domainGraphHyphenatedDomainsSubDomainOnly,
 				convert(converter, hostGraphHyphenatedDomainsSubDomainOnly));
 	}
 
@@ -250,7 +251,8 @@ void testConvertNodesHyphenatedDomainsIncludingMultiPartSuffixes() {
 		testSorted(domainGraphHyphenatedDomainsInclMultiPartSuffixes);
 		converter.doCount(true);
 		converter.multiPartSuffixesAsDomains(true);
-		assertArrayEquals(domainGraphHyphenatedDomainsInclMultiPartSuffixes,
+		assertArrayEquals(
+				domainGraphHyphenatedDomainsInclMultiPartSuffixes,
 				convert(converter, hostGraphHyphenatedDomains));
 	}
 

src/test/java/org/commoncrawl/webgraph/TestJoinSortRanks.java

@@ -41,8 +41,11 @@ void testLoadingDoubleArray() {
 		try {
 			LOG.info("Storing double array of length {} in file {}", arrSize, file.getAbsolutePath());
 			BinIO.storeDoubles(arr, file);
-			LOG.info("Successfully stored double array of length {} in file {}, resulting file size: {} bytes", arrSize,
-					file.getAbsolutePath(), file.length());
+			LOG.info(
+					"Successfully stored double array of length {} in file {}, resulting file size: {} bytes",
+					arrSize,
+					file.getAbsolutePath(),
+					file.length());
 			assertEquals(intOverflow, file.length());
 			LOG.info("Trying to clean up Java heap space...");
 			arr = null;