- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 156 for define (0.19 sec)
-
android/guava/src/com/google/common/math/PairedStatsAccumulator.java
// 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 // C_n = \sum_{i=1}^n x_i y_i - n X_n Y_n // for all n >= 1. Then for all n > 1:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicLongMap.java
* first decrementing to zero, and then removing. putIfAbsent or replace could observe the * intermediate zero-state. Ways we could deal with this are: * * - Don't define any of the ConcurrentMap operations. This is the current state of affairs. * * - Define putIfAbsent and replace as treating zero and absent identically (as currently * implemented below). This is a bit surprising with putIfAbsent, which really becomes
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
return requireLinks()[i]; } private void setLink(int i, long value) { requireLinks()[i] = value; } /* * We don't define getPredecessor+getSuccessor and setPredecessor+setSuccessor here because * they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/WrappingExecutorServiceTest.java
assertTaskWrapped(tasks); lastMethodCalled = "invokeAllTimeout"; lastTimeoutInMillis = unit.toMillis(timeout); return inline.invokeAll(tasks, timeout, unit); } // Define the invokeAny methods to invoke the first task @Override public <T> T invokeAny(Collection<? extends Callable<T>> tasks) throws ExecutionException, InterruptedException { assertTaskWrapped(tasks);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 05 19:41:03 GMT 2023 - 9.8K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
SUBMULTISET, DESCENDING; @Override public Set<Feature<? super Void>> getImpliedFeatures() { return Collections.emptySet(); } } /** Two bounds (from and to) define how to build a subMultiset. */ enum Bound { INCLUSIVE, EXCLUSIVE, NO_BOUND; } List<TestSuite> createDerivedSuites(SortedMultisetTestSuiteBuilder<E> parentBuilder) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
SUBMULTISET, DESCENDING; @Override public Set<Feature<? super Void>> getImpliedFeatures() { return Collections.emptySet(); } } /** Two bounds (from and to) define how to build a subMultiset. */ enum Bound { INCLUSIVE, EXCLUSIVE, NO_BOUND; } List<TestSuite> createDerivedSuites(SortedMultisetTestSuiteBuilder<E> parentBuilder) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Reflection.java
/** * Returns the package name of {@code clazz} according to the Java Language Specification (section * 6.7). Unlike {@link Class#getPackage}, this method only parses the class name, without * attempting to define the {@link Package} and hence load files. */ public static String getPackageName(Class<?> clazz) { return getPackageName(clazz.getName()); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* a given entry might not include null. The right fix for the header problems is probably to * define a separate MultimapLink interface with a separate "header" implementation, which * hopefully could avoid implementing Entry or ValueSetLink at all. (But note that that approach * requires us to define extra classes -- unfortunate under Android.) *Then* we could consider
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* all elements in priority order and place them in another collection. * * <p>Operations on this class make no guarantees about the ordering of elements with equal * priority. If you need to enforce an ordering, you can define custom classes or comparators that * use a secondary key to break ties in primary priority values. For example, here is a class that * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
return requireLinks()[i]; } private void setLink(int i, long value) { requireLinks()[i] = value; } /* * We don't define getPredecessor+getSuccessor and setPredecessor+setSuccessor here because * they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0)