- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 90 for predecessor (0.28 sec)
-
platforms/documentation/docs/src/docs/userguide/jvm/java_testing.adoc
==== [[using_junit5]] == Using JUnit 5 http://junit.org/junit5[JUnit 5] is the latest version of the well-known JUnit test framework. Unlike its predecessor, JUnit 5 is modularized and composed of several modules: JUnit 5 = JUnit Platform + JUnit Jupiter + JUnit Vintage
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 29 16:24:12 UTC 2024 - 53.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
if !m.Type.IsMemory() { break } memPreds[m] = true if len(m.Args) == 0 { break } m = m.MemoryArg() } } // We can merge if v is a predecessor of mem. // // For example, we can merge load into target in the // following scenario: // x = read ... v // mem = write ... v // load = read ... mem // target = add x load
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
CREDITS
transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 15:34:20 UTC 2024 - 1.7M bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/side-effect-analysis-test.mlir
// expected-remark@above {{Predecessors: {6}}} // expected-remark@above {{Successors: {8}}} tf_executor.yield %read3 : tensor<32xf32> // expected-remark@above {{ID: 8}} // expected-remark@above {{Predecessors: {4,5,7}}} } tf_executor.fetch %island#0 : tensor<32xf32> // expected-remark@above {{ID: 10}} // expected-remark@above {{Predecessors: {9}}} }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Dec 20 04:39:18 UTC 2023 - 129.7K bytes - Viewed (0) -
src/runtime/mheap.go
} unlock(&span.speciallock) releasem(mp) return result } // Find a splice point in the sorted list and check for an already existing // record. Returns a pointer to the next-reference in the list predecessor. // Returns true, if the referenced item is an exact match. func (span *mspan) specialFindSplicePoint(offset uintptr, kind byte) (**special, bool) { // Find splice point, check for existing record.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assume().that(graphIsMutable()).isTrue(); addNode(N2); Set<Integer> predecessors = graph.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); putEdge(N1, N2); assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); } @Override @Test public void successors_checkReturnedSetMutability() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void predecessors_checkReturnedSetMutability() { addNode(N2); Set<Integer> predecessors = network.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); addEdge(N1, N2, E12); assertThat(network.predecessors(N2)).containsExactlyElementsIn(predecessors); } @Override @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
ElementOrder<N> nodeOrder(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
ElementOrder<N> nodeOrder(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
maven-model-builder/src/main/java/org/apache/maven/model/inheritance/DefaultInheritanceAssembler.java
Object key = getPluginKey().apply(plugin); master.put(key, plugin); } } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : tgt) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Feb 28 07:40:37 UTC 2024 - 13.8K bytes - Viewed (0)