- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 68 for choose (0.39 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
int[] allRequired, int requiredFrom, int requiredTo, int from, int to) { if (requiredFrom == requiredTo) { return requiredFrom; // only one thing to choose, so choose it } // Find the center and round down. The true center is either centerFloor or halfway between // centerFloor and centerFloor + 1. int centerFloor = (from + to) >>> 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
if (nextThrewException) { throw new IllegalStateException(); } iterator.remove(); } } public void testCanCatchSunJavaBug6529795InTargetIterator() { try { /* Choose 4 steps to get sequence [next, next, next, remove] */ new IteratorTester<Integer>( 4, MODIFIABLE, newArrayList(1, 2), IteratorTester.KnownOrder.KNOWN_ORDER) { @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 17 12:41:04 GMT 2023 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java
private void workOnQueue() { boolean interruptedDuringTask = false; boolean hasSetRunning = false; try { while (true) { synchronized (queue) { // Choose whether this thread will run or not after acquiring the lock on the first // iteration if (!hasSetRunning) { if (workerRunningState == RUNNING) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
* without contention. Because assignment of entries to these partitions is not necessarily * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to * accommodate as many threads as will ever concurrently modify the table. Using a significantly * higher value than you need can waste space and time, and a significantly lower value can lead
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 13 14:30:51 GMT 2023 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* is iterated are the individual lists created, and these are not retained after iteration. * * @param lists the lists to choose elements from, in the order that the elements chosen from * those lists should appear in the resulting lists * @param <B> any common base class shared by all axes (often just {@link Object})
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* using a specified {@link SuccessorsFunction}. * * <p>There are two entry points for creating a {@code Traverser}: {@link * #forTree(SuccessorsFunction)} and {@link #forGraph(SuccessorsFunction)}. You should choose one * based on your answers to the following questions: * * <ol> * <li>Is there only one path to any node that's reachable from any start node? (If so, the graph
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <ul> * <li>For an empty list, it is 1 (base case). * <li>When r numbers are added to a list of n-r elements, the number of permutations is * increased by a factor of (n choose r). * </ul> */ private static <E> int calculateSize( List<E> sortedInputList, Comparator<? super E> comparator) { int permutations = 1; int n = 1; int r = 1;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
/** * Keeps track of metadata like the number of hash table bits and modifications of this data * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such * errors, for better performance. */ private transient int metadata; /** The number of elements contained in the set. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* Returns {@code x}, rounded to a {@code double} with the specified rounding mode. If {@code x} * is precisely representable as a {@code double}, its {@code double} value will be returned; * otherwise, the rounding will choose between the two nearest representable values with {@code * mode}. * * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN},
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
* }</pre> * * <p>Note that the behavior of {@link Range#isEmpty()} and {@link Range#isConnected(Range)} may not * be as expected on discrete ranges. See the Javadoc of those methods for details. * * <p>For a {@link Set} whose contents are specified by a {@link Range}, see {@link ContiguousSet}. * * <p>See the Guava User Guide article on <a href=
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 9.8K bytes - Viewed (0)