1 files changed, 0 insertions, 103 deletions
diff --git a/android/guava/src/com/google/common/graph/PredecessorsFunction.java b/android/guava/src/com/google/common/graph/PredecessorsFunction.java
deleted file mode 100644
index b8f7ea5eb..000000000
--- a/android/guava/src/com/google/common/graph/PredecessorsFunction.java
+++ /dev/null
@@ -1,103 +0,0 @@
-/*
- * Copyright (C) 2014 The Guava Authors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package com.google.common.graph;
-
-import com.google.common.annotations.Beta;
-
-/**
- * A functional interface for <a
- * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
- *
- * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
- * topological sort) that only need a way of accessing the predecessors of a node in a graph.
- *
- * <h3>Usage</h3>
- *
- * Given an algorithm, for example:
- *
- * <pre>{@code
- * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction);
- * }</pre>
- *
- * you will invoke it depending on the graph representation you're using.
- *
- * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
- * {@link ValueGraph}, and {@link Network}):
- *
- * <pre>{@code
- * someGraphAlgorithm(startNode, graph);
- * }</pre>
- *
- * This works because those types each implement {@code PredecessorsFunction}. It will also work
- * with any other implementation of this interface.
- *
- * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
- * which has a method {@code getParents()} that retrieves its predecessors in a graph:
- *
- * <pre>{@code
- * someGraphAlgorithm(startNode, MyNode::getParents);
- * }</pre>
- *
- * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't
- * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
- * transformation:
- *
- * <pre>{@code
- * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father()));
- * }</pre>
- *
- * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
- * successors, iterating over the edges, etc.) should declare their input to be of a type that
- * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}.
- *
- * <h3>Additional documentation</h3>
- *
- * <p>See the Guava User Guide for the {@code common.graph} package (<a
- * href="https://github.com/google/guava/wiki/GraphsExplained">"Graphs Explained"</a>) for
- * additional documentation, including <a
- * href="https://github.com/google/guava/wiki/GraphsExplained#notes-for-implementors">notes for
- * implementors</a>
- *
- * @author Joshua O'Madadhain
- * @author Jens Nyman
- * @param <N> Node parameter type
- * @since 23.0
- */
-@Beta
-public interface PredecessorsFunction<N> {
-
-  /**
-   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
-   * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
-   *
-   * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results
-   * if the returned {@link Iterable} contains duplicate elements. Implementations of such
-   * algorithms should document their behavior in the presence of duplicates.
-   *
-   * <p>The elements of the returned {@code Iterable} must each be:
-   *
-   * <ul>
-   *   <li>Non-null
-   *   <li>Usable as {@code Map} keys (see the Guava User Guide's section on <a
-   *       href="https://github.com/google/guava/wiki/GraphsExplained#graph-elements-nodes-and-edges">
-   *       graph elements</a> for details)
-   * </ul>
-   *
-   * @throws IllegalArgumentException if {@code node} is not an element of this graph
-   */
-  Iterable<? extends N> predecessors(N node);
-}