Loading src/main/java/org/torproject/descriptor/impl/NetworkStatusEntryImpl.java +2 −3 Original line number Diff line number Diff line Loading @@ -22,7 +22,7 @@ import java.util.Scanner; import java.util.Set; import java.util.SortedMap; import java.util.SortedSet; import java.util.TreeSet; \import java.util.TreeSet; public class NetworkStatusEntryImpl implements NetworkStatusEntry { Loading Loading @@ -324,7 +324,6 @@ public class NetworkStatusEntryImpl implements NetworkStatusEntry { // Create a sorted set from the Integer array SortedSet<Integer> methodSet = new TreeSet<>(Arrays.asList(intMethods)); System.out.println("Methods after numeric sorting: " + methodSet); // Add the hash and corresponding methods to the map if (isValid) { Loading Loading
src/main/java/org/torproject/descriptor/impl/NetworkStatusEntryImpl.java +2 −3 Original line number Diff line number Diff line Loading @@ -22,7 +22,7 @@ import java.util.Scanner; import java.util.Set; import java.util.SortedMap; import java.util.SortedSet; import java.util.TreeSet; \import java.util.TreeSet; public class NetworkStatusEntryImpl implements NetworkStatusEntry { Loading Loading @@ -324,7 +324,6 @@ public class NetworkStatusEntryImpl implements NetworkStatusEntry { // Create a sorted set from the Integer array SortedSet<Integer> methodSet = new TreeSet<>(Arrays.asList(intMethods)); System.out.println("Methods after numeric sorting: " + methodSet); // Add the hash and corresponding methods to the map if (isValid) { Loading