- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 301 for Othman (0.17 sec)
-
guava-testlib/src/com/google/common/collect/testing/TestSortedMapGenerator.java
SortedMap<K, V> create(Object... elements); /** * Returns an entry with a key less than the keys of the {@link #samples()} and less than the key * of {@link #belowSamplesGreater()}. */ Entry<K, V> belowSamplesLesser(); /** * Returns an entry with a key less than the keys of the {@link #samples()} but greater than the * key of {@link #belowSamplesLesser()}. */ Entry<K, V> belowSamplesGreater();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* In that explanation's notation, our `overlap` check would be `x1 < y2 && y1 < x2`. We've * flipped one part of the check so that we're using "less than" in both cases (rather than a * mix of "less than" and "greater than"). We've also switched to "strictly less than" rather * than "less than or equal to" because of *handwave* the difference between "endpoints of * inclusive ranges" and "Cuts." */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 27.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
* <ul> * <li>{@code x} is infinite or NaN * <li>{@code x}, after being rounded to a mathematical integer using the specified rounding * mode, is either less than {@code Integer.MIN_VALUE} or greater than {@code * Integer.MAX_VALUE} * <li>{@code x} is not a mathematical integer and {@code mode} is {@link * RoundingMode#UNNECESSARY} * </ul> */
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/primitives/Shorts.java
* * @param value any value in the range of the {@code short} type * @return the {@code short} value that equals {@code value} * @throws IllegalArgumentException if {@code value} is greater than {@link Short#MAX_VALUE} or * less than {@link Short#MIN_VALUE} */ public static short checkedCast(long value) { short result = (short) value; checkArgument(result == value, "Out of range: %s", value); return result; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
* * @param a the first unsigned {@code long} to compare * @param b the second unsigned {@code long} to compare * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is * greater than {@code b}; or zero if they are equal */ public static int compare(long a, long b) { return Longs.compare(flip(a), flip(b)); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* Long#compare} method instead. * * @param a the first {@code long} to compare * @param b the second {@code long} to compare * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is * greater than {@code b}; or zero if they are equal */ public static int compare(long a, long b) { return (a < b) ? -1 : ((a > b) ? 1 : 0); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 28.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
* It's very unlikely that any loaded Futures class will see getChecked called with more * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache. * This avoids out-of-control memory consumption, and it keeps the cache from growing so * large that doing the lookup is noticeably slower than redoing the work would be. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 10.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStatsAccumulator.java
*/ public double populationCovariance() { checkState(count() != 0); return sumOfProductsOfDeltas / count(); } /** * Returns the sample covariance of the values. The count must be greater than one. * * <p>This is not guaranteed to return zero when the dataset consists of the same pair of values * multiple times, due to numerical errors. * * <h3>Non-finite values</h3> *
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/collect/Iterators.java
* @param defaultValue the default value to return if the iterator is empty or if {@code position} * is greater than the number of elements remaining in {@code iterator} * @return the element at the specified position in {@code iterator} or {@code defaultValue} if * {@code iterator} produces fewer than {@code position + 1} elements. * @throws IndexOutOfBoundsException if {@code position} is negative * @since 4.0 */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Apr 20 03:33:06 GMT 2024 - 50.6K bytes - Viewed (0)