- Sort Score
- Result 10 results
- Languages All
Results 251 - 260 of 2,900 for Dave (0.02 sec)
-
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
* file. For discussion, see AbstractFutureState. */ // Lazily initialized the first time we see an exception; not released until all the input futures // have completed and we have processed them all. volatile @Nullable Set<Throwable> seenExceptionsField = null; volatile int remainingField; private static final AtomicHelper ATOMIC_HELPER;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 8.5K bytes - Viewed (0) -
impl/maven-core/lifecycle-executor.txt
We have a lifecycle mapping for the packaging of *jar* below. You see that for this packaging we have a *default* lifecycle and a list of phases where each phase is a comma separated list of goals to run and they are in the form groupId:artifactId:version. <configuration> <lifecycles> <lifecycle> <id>default</id> <phases> <process-resources>org.apache.maven.plugins:maven-resources-plugin:resources</process-resources>
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractListMultimap.java
return wrapList(key, (List<V>) collection, null); } // Following Javadoc copied from ListMultimap. /** * {@inheritDoc} * * <p>Because the values for a given key may have duplicates and follow the insertion ordering, * this method returns a {@link List}, instead of the {@link Collection} specified in the {@link * Multimap} interface. */ @Override
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Apr 12 15:07:59 UTC 2025 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* 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: * * {@snippet : * someGraphAlgorithm(startNode, MyNode::getParents); * } * * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn'tRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* 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 getChildren()} that retrieves its successors in a graph: * * {@snippet : * someGraphAlgorithm(startNode, MyNode::getChildren); * } * * <p>If you have some other mechanism for returning the successors of a node, or one that doesn'tRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
docs/en/docs/advanced/additional-responses.md
/// note Notice that you have to return the image using a `FileResponse` directly. /// /// info Unless you specify a different media type explicitly in your `responses` parameter, FastAPI will assume the response has the same media type as the main response class (default `application/json`).
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 8.9K bytes - Viewed (0) -
guava/src/com/google/common/math/PairedStatsAccumulator.java
public void add(double x, double y) { // We extend the recursive expression for the one-variable case at Art of Computer Programming // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i. // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i. // We also define the sum of the products of the differences from the means
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 08 18:35:13 UTC 2025 - 10.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
* * <p>Thus, two value graphs A and B are equal if <b>all</b> of the following are true: * * <ul> * <li>A and B have equal {@link #isDirected() directedness}. * <li>A and B have equal {@link #nodes() node sets}. * <li>A and B have equal {@link #edges() edge sets}. * <li>The {@link #edgeValue(N, N) value} of a given edge is the same in both A and B. * </ul> *
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 16K bytes - Viewed (0) -
cmd/erasure-metadata-utils_test.go
ignoredErrs []error err error }{ // Validate if have reduced properly. {[]error{ errDiskNotFound, errDiskNotFound, errDiskFull, }, []error{}, errErasureReadQuorum}, // Validate if have no consensus. {[]error{ errDiskFull, errDiskNotFound, nil, nil, }, []error{}, errErasureReadQuorum}, // Validate if have consensus and errors ignored. {[]error{ errVolumeNotFound,
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 7.3K bytes - Viewed (0) -
tests/associations_test.go
child := Child{ParentID: &parent.ID, Parent: &parent} DB.Create(&child) parent.FavChildID = child.ID parent.FavChild = &child DB.Save(&parent) var parent1 Parent DB.First(&parent1, parent.ID) AssertObjEqual(t, parent, parent1, "ID", "FavChildID") // Save and Updates is the same DB.Updates(&parent) DB.First(&parent1, parent.ID) AssertObjEqual(t, parent, parent1, "ID", "FavChildID") }Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Fri Sep 12 04:33:27 UTC 2025 - 13.3K bytes - Viewed (0)