diff options
| author |  Ulf Adams <ulfjack@google.com> | 2015-09-04 12:10:53 +0000 |
|---|---|---|
| committer |  Dmitry Lomov <dslomov@google.com> | 2015-09-04 12:53:08 +0000 |
| commit | 3ab82f767981c5bb32e041a3d08b8dc9f41625e2 (patch) | |
| tree | 6c31f94248a8bd7dffca0564e08670f11a2e177a /src/main/java/com/google/devtools/build/lib/graph | |
| parent | b7a69e551e4da9f8a4f7a4649c7843044d122732 (diff) | |
Fix some warnings.
--
MOS_MIGRATED_REVID=102332437
Diffstat (limited to 'src/main/java/com/google/devtools/build/lib/graph')
| -rw-r--r-- | src/main/java/com/google/devtools/build/lib/graph/Digraph.java | 8 | ||||
| -rw-r--r-- | src/main/java/com/google/devtools/build/lib/graph/DotSyntaxException.java | 2 |
2 files changed, 4 insertions, 6 deletions
diff --git a/src/main/java/com/google/devtools/build/lib/graph/Digraph.java b/src/main/java/com/google/devtools/build/lib/graph/Digraph.java index 1dc178be42..23f898b2e0 100644 --- a/src/main/java/com/google/devtools/build/lib/graph/Digraph.java +++ b/src/main/java/com/google/devtools/build/lib/graph/Digraph.java @@ -1050,9 +1050,9 @@ public final class Digraph<T> implements Cloneable { } /** - * Given {@param unordered}, a collection of nodes and a (possibly null) {@param comparator} for - * their labels, returns a sorted collection if {@param comparator} is non-null, otherwise returns - * {@param unordered}. + * Given {@code unordered}, a collection of nodes and a (possibly null) {@code comparator} for + * their labels, returns a sorted collection if {@code comparator} is non-null, otherwise returns + * {@code unordered}. */ private static <T> Collection<Node<T>> maybeOrderCollection( Collection<Node<T>> unordered, @Nullable final Comparator<? super T> comparator) { @@ -1081,7 +1081,7 @@ public final class Digraph<T> implements Cloneable { /** * A visitation over the graph that visits all nodes and edges in topological order * such that each node is visited before any edge coming out of that node; ties among nodes are - * broken using the provided {@param comparator} if not null; edges are visited in order specified + * broken using the provided {@code comparator} if not null; edges are visited in order specified * by the comparator, <b>not</b> topological order of the target nodes. */ public void visitNodesBeforeEdges( diff --git a/src/main/java/com/google/devtools/build/lib/graph/DotSyntaxException.java b/src/main/java/com/google/devtools/build/lib/graph/DotSyntaxException.java index adf70aab6b..d3861ce4f3 100644 --- a/src/main/java/com/google/devtools/build/lib/graph/DotSyntaxException.java +++ b/src/main/java/com/google/devtools/build/lib/graph/DotSyntaxException.java @@ -15,8 +15,6 @@ package com.google.devtools.build.lib.graph; -import java.io.File; - /** * <p> A DotSyntaxException represents a syntax error encountered while * parsing a dot-format fule. Thrown by createFromDotFile if syntax errors |