From 3ab82f767981c5bb32e041a3d08b8dc9f41625e2 Mon Sep 17 00:00:00 2001
From: Ulf Adams <ulfjack@google.com>
Date: Fri, 4 Sep 2015 12:10:53 +0000
Subject: Fix some warnings.

--
MOS_MIGRATED_REVID=102332437
---
 src/main/java/com/google/devtools/build/lib/graph/Digraph.java | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'src/main/java/com/google/devtools/build/lib/graph/Digraph.java')

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(
-- 
cgit v1.2.3