commit 2553c84a436b091fa58d3e599078fbe9ea8f26b2
author Janak Ramakrishnan <janakr@google.com> Fri Jul 08 18:43:37 2016 +0000
committer Kristina Chodorow <kchodorow@google.com> Mon Jul 11 09:39:26 2016 +0000
tree f7dbe0c075471a2fec3c833a4ef0205a3150903f
parent 9551686e94e7344ce08fbee5b9c7b4a47d01e872

Replace QueryableGraph#getBatch with #getBatchWithFieldHints. This allows alternate graph implementations to optimize how they construct node entries.

--
MOS_MIGRATED_REVID=126932020

src/main/java/com/google/devtools/build/skyframe/EvaluableGraph.java

diff --git a/src/main/java/com/google/devtools/build/skyframe/EvaluableGraph.java b/src/main/java/com/google/devtools/build/skyframe/EvaluableGraph.java
index b3d8bd0..a9c067d 100644
--- a/src/main/java/com/google/devtools/build/skyframe/EvaluableGraph.java
+++ b/src/main/java/com/google/devtools/build/skyframe/EvaluableGraph.java
@@ -24,8 +24,9 @@
 @ThreadSafe
 interface EvaluableGraph extends QueryableGraph, DeletableGraph {
   /**
-   * Like {@link QueryableGraph#getBatch}, except it creates a new node for each key not already
-   * present in the graph. Thus, the returned map will have an entry for each key in {@code keys}.
+   * Like {@link QueryableGraph#getBatchWithFieldHints}, except it creates a new node for each key
+   * not already present in the graph. Thus, the returned map will have an entry for each key in
+   * {@code keys}.
    */
   Map<SkyKey, NodeEntry> createIfAbsentBatch(Iterable<SkyKey> keys);
 }