- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 105 for Lyding (0.16 sec)
-
guava-tests/test/com/google/common/collect/ListsImplTest.java
ImmutableList.of("A"), ImmutableList.of("A"), ImmutableList.of("A", "A", "B", "C"), ImmutableList.of("A", "A", "D", "E", "B", "C")); String format = "Adding %s at %s"; for (int i = 0; i < toAdd.size(); i++) { int index = indexes.get(i); Iterable<String> iterableToAdd = toAdd.get(i); boolean expectedChanged = iterableToAdd.iterator().hasNext();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/TestThread.java
super(threadName); this.lockLikeObject = checkNotNull(lockLikeObject); start(); } // Thread.stop() is okay because all threads started by a test are dying at the end of the test, // so there is no object state put at risk by stopping the threads abruptly. In some cases a test // may put a thread into an uninterruptible operation intentionally, so there is no other way to
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 10.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
* http://creativecommons.org/publicdomain/zero/1.0/ */ /* * Source: * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/test/tck-jsr166e/AtomicDoubleArrayTest.java?revision=1.13 * (Modified to adapt to guava coding conventions) */ package com.google.common.util.concurrent; import static java.lang.Math.max; import static org.junit.Assert.assertThrows; import com.google.common.annotations.GwtIncompatible;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 14.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* This is a big deal - we're talking factors of 2-8 in microbenchmarks, not just 10-20%. (This is * a hotspot optimizer bug, which should be fixed, but that's a separate, big project). * * The coding pattern above is heavily used in java.util, e.g. in ArrayList. There is a * RangeCheckMicroBenchmark in the JDK that was used to test this. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/StatsAccumulatorTest.java
assertThat(manyValuesAccumulatorByAddAllStats.min()).isEqualTo(MANY_VALUES_MIN); assertThat(manyValuesAccumulatorByAddAllStatsAccumulator.min()).isEqualTo(MANY_VALUES_MIN); // For datasets of many double values created by adding elements individually, we test many // combinations of finite and non-finite values: for (ManyValues values : ALL_MANY_VALUES) { StatsAccumulator accumulator = new StatsAccumulator();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 36.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
if (result[0] == 0) { distinctElements++; } this.totalCount += count; return (right.height == initHeight) ? this : rebalance(); } // adding count to me! No rebalance possible. result[0] = elemCount; long resultCount = (long) elemCount + count; checkArgument(resultCount <= Integer.MAX_VALUE); this.elemCount += count;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
if (!seen.add(this)) { return null; // Already traversed this node. } ExampleStackTrace found = allowedPriorLocks.get(node); if (found != null) { return found; // Found a path ending at the node! } // Recurse the edges. for (Entry<LockGraphNode, ExampleStackTrace> entry : allowedPriorLocks.entrySet()) { LockGraphNode preAcquiredLock = entry.getKey();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
/* * lowasser, 2015-Feb-12: Benchmarks suggest that changing this to UnsignedLongs.remainder * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum * constant hurts performance further -- I suspect because bimorphic implementation is a * sweet spot for the JVM. */ return (a * b) % m; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
*/ private static <K, V> ImmutableSortedMap<K, V> fromEntries( Comparator<? super K> comparator, boolean sameComparator, Iterable<? extends Entry<? extends K, ? extends V>> entries) { // "adding" type params to an array of a raw type should be safe as // long as no one can ever cast that same array instance back to a // raw type. @SuppressWarnings("unchecked")
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ListenableFuture.java
* (or {@link FluentFuture#transform(com.google.common.base.Function, Executor) * FluentFuture.transform}), but you will often find it easier to use a framework. Frameworks * automate the process, often adding features like monitoring, debugging, and cancellation. * Examples of frameworks include: * * <ul> * <li><a href="https://dagger.dev/producers.html">Dagger Producers</a> * </ul> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:13:41 GMT 2023 - 8K bytes - Viewed (0)