- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 229 for doTest (0.25 sec)
-
android/guava-tests/test/com/google/common/collect/OrderingTest.java
} public void testGreatestOfIterable_simple() { /* * If greatestOf() promised to be implemented as reverse().leastOf(), this * test would be enough. It doesn't... but we'll cheat and act like it does * anyway. There's a comment there to remind us to fix this if we change it. */ List<Integer> list = Arrays.asList(3, 1, 3, 2, 4, 2, 4, 3);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/InterruptibleTask.java
* If someone called cancel(true), it is possible that the interrupted bit hasn't been set yet. * Wait for the interrupting thread to set DONE. (See interruptTask().) We want to wait so that * the interrupting thread doesn't interrupt the _next_ thing to run on this thread. * * Note: We don't reset the interrupted bit, just wait for it to be set. If this is a thread
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Sep 29 21:34:48 GMT 2023 - 9.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectArrays.java
* array is "safe" in that no references to it are maintained by the collection. The caller is * thus free to modify the returned array. * * <p>This method assumes that the collection size doesn't change while the method is running. * * <p>TODO(kevinb): support concurrently modified collections? * * @param c the collection for which to return an array of elements */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 12 15:59:22 GMT 2023 - 9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
assertThat(graph.outDegree(N1)).isEqualTo(1); putEdge(N1, N2); assertThat(graph.outDegree(N1)).isEqualTo(2); } // Stable order tests // Note: Stable order means that the ordering doesn't change between iterations and versions. // Ideally, the ordering in test should never be updated. @Test public void stableIncidentEdgeOrder_edges_returnsInStableOrder() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/CharSourceTest.java
/** * Tests for the default implementations of {@code CharSource} methods. * * @author Colin Decker */ public class CharSourceTest extends IoTestCase { @AndroidIncompatible // Android doesn't understand suites whose tests lack default constructors. public static TestSuite suite() { TestSuite suite = new TestSuite(); for (boolean asByteSource : new boolean[] {false, true}) { suite.addTest(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/QueuesTest.java
assertThat(drained).isAtMost(1); assertThat(timer.elapsed(MILLISECONDS)).isAtLeast(10L); // If even the first one wasn't there, clean up so that the next test doesn't see an element. producerThread.cancel(true); producer.doneProducing.await(); if (drained == 0) { q.poll(); // not necessarily there if producer was interrupted } } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12K bytes - Viewed (0) -
android/guava/src/com/google/common/io/TempFileCreator.java
} // Don't merge these catch() blocks, let alone use ReflectiveOperationException directly: // b/65343391 } catch (NoSuchFieldException e) { // The JELLY_BEAN field doesn't exist because we're running on a version before Jelly Bean :) return new ThrowingCreator(); } catch (ClassNotFoundException e) { // Should be impossible, but we want to return *something* so that class init succeeds.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 06 17:11:11 GMT 2023 - 12.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
b += minDeltaOrZero; // sets b to min(old a, b) a >>= Integer.numberOfTrailingZeros(a); // divide out all 2s, since 2 doesn't divide b } return a << min(aTwos, bTwos); } /** * Returns the sum of {@code a} and {@code b}, provided it does not overflow. * * @throws ArithmeticException if {@code a + b} overflows in signed {@code int} arithmetic */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
} /** * Returns the start position of the first occurrence of the specified {@code target} within * {@code array}, or {@code -1} if there is no such occurrence. * * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array, * i, i + target.length)} contains exactly the same elements as {@code target}. * * @param array the array to search for the sequence {@code target}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* contention levels will recur, so the cells will eventually be * needed again; and for short-lived ones, it does not matter. */ /** * Padded variant of AtomicLong supporting only raw accesses plus CAS. The value field is placed * between pads, hoping that the JVM doesn't reorder them. * * <p>JVM intrinsics note: It would be possible to use a release-only form of CAS here, if it were * provided.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)