- 442155f Automated rollback of commit a0a0d09debd090fbe74bba59b5d6d3107aaf97e9. by Googler · 2 years, 10 months ago
- a0a0d09 Create a dedicated graph lookup reason for rewinding and add a wildcard to `createIfAbsentBatch` to match `getBatch`. by Googler · 2 years, 10 months ago
- 1c95255 Tighten some node types to reduce use of wildcards, casting, and handling of impossible exceptions. by jhorvitz · 3 years, 3 months ago
- cd512cf Do visitation of graph for deletion in parallel, using ConcurrentHashMap#forEachEntry. Shaves ~1 second off benchmark build. by janakr · 3 years, 8 months ago
- 7c972a1 Provide a default implementation for InMemoryGraph#getDoneValues() since it is the only implementation. by janakr · 4 years ago
- be83f13 Now that SkyKey is an interface, accept Iterable<? extends SkyKey> by ulfjack · 8 years ago
- 31654bd Drop loading-phase values if --discard_analysis_cache is true and we're not keeping incremental state. by janakr · 8 years ago
- 3c0adb2 Allow Skyframe graph lookups and value retrievals to throw InterruptedException. by Janak Ramakrishnan · 9 years ago
- 33faf91 Get rid of InvalidatableGraph. This explicit concept is no longer needed. by Nathan Harmata · 9 years ago
- c55fe15 Delete NodeEntryField since it's now superfluous in the presence of the new QueryableGraph.Reason which conveys more information. Add a few more Reason enum values to make this refactor benign. by Nathan Harmata · 9 years ago
- 3b47b1f Augment the QueryableGraph#get[BatchWithFieldHints] method to take in parameters conveying the requesting node (if any), the requested node(s), as well as a reason for the skyframe graph lookup. Alternate graph implementations may be interested in this information. by Nathan Harmata · 9 years ago
- 2553c84 Replace QueryableGraph#getBatch with #getBatchWithFieldHints. This allows alternate graph implementations to optimize how they construct node entries. by Janak Ramakrishnan · 9 years ago
- cc7712f Refactor QueryableGraph and ThinNodeQueryableGraph to be independent interfaces, in preparation for further changes. by Janak Ramakrishnan · 9 years ago
- 8be7fd0 Allow Skyframe tests to use the NotifyingGraph and DeterministicGraph helpers to enforce concurrency synchronization points and determinism even if they are not using an InMemoryGraph-backed evaluator. by Janak Ramakrishnan · 9 years ago
- cfa74ac1 Compare GroupedLists without regard to the order within a given group. Also make sure that we don't store duplicate elements within a given group (although that is currently taken care of by the callers). by Janak Ramakrishnan · 9 years ago
- f88f4d8 Rationalize copyright headers by Damien Martin-Guillerez · 10 years ago
- 5877b8b Don't remove reverse deps until node is known to be changed. This helps avoid mutating the deps of nodes that are still going to be deps after evaluation is finished. by Janak Ramakrishnan · 10 years ago
- 7b4bd6e Call into the super's method in DeterministicValueEntry rather than trying to roll our own for no reason. by Janak Ramakrishnan · 10 years ago
- 96f9ea0 Change return type of InMemoryNodeEntry#getReverseDeps to Collection<SkyKey>. by Janak Ramakrishnan · 10 years ago
- 0e24c69 Change getBatch signature from Set to Iterable since Iterable is all that's needed. Also clean up some lint warnings/unresolved references. by Janak Ramakrishnan · 10 years ago
- 6fc9fa0 Introduce QueryableGraph#getBatch, a batched variant of QueryableGraph#get and use it in the underlying implementation of SkyFunction.Environment#getValues. It's reasonable for an alternative graph implementation to have a more efficient implementation of getBatch than the naive serial implementation. by Nathan Harmata · 10 years ago
- bd0174f Fixed up test that assumed a certain order in which deps, within the same dependency group, were checked for dirtiness. by Nathan Harmata · 10 years ago
- b408f9e Refactor NodeEntry to be an interface. by Nathan Harmata · 10 years ago
- d08b27f Update from Google. by Han-Wen Nienhuys · 10 years ago
