Avoid backticks in Javadoc.

RELNOTES=n/a
PiperOrigin-RevId: 684455708

android/guava/src/com/google/common/base/MoreObjects.java

@@ -174,8 +174,8 @@ public ToStringHelper omitNullValues() {
      * empty values. The order of calling this method, relative to the {@code add()}/{@code
      * addValue()} methods, is not significant.
      *
-     * <p><b>Note:</b> in general, code should assume that the string form returned by
-     * `ToStringHelper` for a given object may change. In particular, the list of types which are
+     * <p><b>Note:</b> in general, code should assume that the string form returned by {@code
+     * ToStringHelper} for a given object may change. In particular, the list of types which are
      * checked for emptiness is subject to change. We currently check {@code CharSequence}s, {@code
      * Collection}s, {@code Map}s, optionals (including Guava's), and arrays.
      *

android/guava/src/com/google/common/graph/Graph.java

@@ -166,8 +166,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -189,8 +189,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -215,8 +215,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -237,8 +237,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined

android/guava/src/com/google/common/graph/Network.java

@@ -170,8 +170,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined
@@ -187,9 +187,9 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    *
    * <p>In an undirected network, this is equivalent to {@link #adjacentNodes(Object)}.
    *
-   * <p>If {@code node} is removed from the network after this method is called, the `Set` returned
-   * by this method will be invalidated, and will throw `IllegalStateException` if it is accessed in
-   * any way.
+   * <p>If {@code node} is removed from the network after this method is called, the {@code Set}
+   * returned by this method will be invalidated, and will throw {@code IllegalStateException} if it
+   * is accessed in any way.
    *
    * @throws IllegalArgumentException if {@code node} is not an element of this network
    */
@@ -210,8 +210,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined
@@ -233,8 +233,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined
@@ -258,8 +258,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined
@@ -282,8 +282,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined
@@ -344,8 +344,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code edge} is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined
@@ -372,8 +372,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code nodeU} or {@code nodeV} are re-added to the network after having been removed,
    *       {@code view}'s behavior is undefined
@@ -401,8 +401,8 @@ public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFuncti
    * exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if either endpoint is re-added to the network after having been removed, {@code view}'s
    *       behavior is undefined

android/guava/src/com/google/common/graph/Traverser.java

@@ -114,8 +114,8 @@ Traversal<N> newTraversal() {
    * structure being traversed is, in addition to being a tree/forest, also defined <a
    * href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>.
    * This is because the {@code forTree()}-based implementations don't keep track of visited nodes,
-   * and therefore don't need to call `equals()` or `hashCode()` on the node objects; this saves
-   * both time and space versus traversing the same graph using {@code forGraph()}.
+   * and therefore don't need to call {@code equals()} or {@code hashCode()} on the node objects;
+   * this saves both time and space versus traversing the same graph using {@code forGraph()}.
    *
    * <p>Providing a graph to be traversed for which there is more than one path from the start
    * node(s) to any node may lead to:

android/guava/src/com/google/common/graph/ValueGraph.java

@@ -175,8 +175,8 @@ public interface ValueGraph<N, V> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -193,9 +193,9 @@ public interface ValueGraph<N, V> extends BaseGraph<N> {
    *
    * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}.
    *
-   * <p>If {@code node} is removed from the graph after this method is called, the `Set` returned by
-   * this method will be invalidated, and will throw `IllegalStateException` if it is accessed in
-   * any way.
+   * <p>If {@code node} is removed from the graph after this method is called, the {@code Set}
+   * returned by this method will be invalidated, and will throw {@code IllegalStateException} if it
+   * is accessed in any way.
    *
    * @throws IllegalArgumentException if {@code node} is not an element of this graph
    */
@@ -216,8 +216,8 @@ public interface ValueGraph<N, V> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -238,8 +238,8 @@ public interface ValueGraph<N, V> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined

android/guava/src/com/google/common/util/concurrent/MoreExecutors.java

@@ -339,7 +339,7 @@ public static Executor directExecutor() {
    *
    * <p>{@linkplain Executor#execute executed} tasks have a happens-before order as defined in the
    * Java Language Specification. Tasks execute with the same happens-before order that the function
-   * calls to {@link Executor#execute `execute()`} that submitted those tasks had.
+   * calls to {@link Executor#execute execute()} that submitted those tasks had.
    *
    * <p>The executor uses {@code delegate} in order to {@link Executor#execute execute} each task in
    * turn, and does not create any threads of its own.

guava/src/com/google/common/base/MoreObjects.java

@@ -177,8 +177,8 @@ public ToStringHelper omitNullValues() {
      * empty values. The order of calling this method, relative to the {@code add()}/{@code
      * addValue()} methods, is not significant.
      *
-     * <p><b>Note:</b> in general, code should assume that the string form returned by
-     * `ToStringHelper` for a given object may change. In particular, the list of types which are
+     * <p><b>Note:</b> in general, code should assume that the string form returned by {@code
+     * ToStringHelper} for a given object may change. In particular, the list of types which are
      * checked for emptiness is subject to change. We currently check {@code CharSequence}s, {@code
      * Collection}s, {@code Map}s, optionals (including Guava's), and arrays.
      *

guava/src/com/google/common/graph/Graph.java

@@ -166,8 +166,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -189,8 +189,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -215,8 +215,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined
@@ -237,8 +237,8 @@ public interface Graph<N> extends BaseGraph<N> {
    * IllegalStateException} if it is accessed in any way, with the following exceptions:
    *
    * <ul>
-   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other `equals()` expression
-   *       involving {@code view} will throw)
+   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
+   *       expression involving {@code view} will throw)
    *   <li>{@code hashCode()} does not throw
    *   <li>if {@code node} is re-added to the graph after having been removed, {@code view}'s
    *       behavior is undefined