- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 138 for Carter (0.19 sec)
-
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* Returns an immutable array containing the same values as {@code this} array. This is logically * a no-op, and in some circumstances {@code this} itself is returned. However, if this instance * is a {@link #subArray} view of a larger array, this method will copy only the appropriate range * of values, resulting in an equivalent array with a smaller memory footprint. */ public ImmutableIntArray trimmed() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
* equivalently, if this inverse view contains a key that is equal to {@code value}). * * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
* Returns an immutable array containing the same values as {@code this} array. This is logically * a no-op, and in some circumstances {@code this} itself is returned. However, if this instance * is a {@link #subArray} view of a larger array, this method will copy only the appropriate range * of values, resulting in an equivalent array with a smaller memory footprint. */ public ImmutableDoubleArray trimmed() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0) -
maven-artifact/src/main/java/org/apache/maven/artifact/versioning/ComparableVersion.java
return String.valueOf(QUALIFIERS.indexOf("")); } int i = QUALIFIERS.indexOf(qualifier); // Just returning an Integer with the index here is faster, but requires a lot of if/then/else to check for // -1 // or QUALIFIERS.size and then resort to lexical ordering. Most comparisons are decided by the first // character,
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 26K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
* equal, ignoring the case of any ASCII alphabetic characters between {@code 'a'} and {@code 'z'} * or {@code 'A'} and {@code 'Z'} inclusive. * * <p>This method is significantly faster than {@link String#equalsIgnoreCase} and should be used * in preference if at least one of the parameters is known to contain only ASCII characters. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
return CollectSpliterators.indexed(size(), SPLITERATOR_CHARACTERISTICS, this::get); } @Override int copyIntoArray(@Nullable Object[] dst, int offset) { // this loop is faster for RandomAccess instances, which ImmutableLists are int size = size(); for (int i = 0; i < size; i++) { dst[offset + i] = get(i); } return offset + size; } /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
* amounts of computation (creating a thread, calling a few methods, etc) needed to reach a * timeout point. Similarly, a SMALL is always discriminable as larger than SHORT and smaller * than MEDIUM. And so on. These constants are set to conservative values, but even so, if * there is ever any doubt, they can all be increased in one spot to rerun tests on slower
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
* equivalently, if this inverse view contains a key that is equal to {@code value}). * * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on * randomly ordered data (the probability decreases faster than exponentially in N), but if you are * passing in unsanitized user data then a malicious user could force it. A light shuffle of the * data using an unpredictable seed should normally be enough to thwart this attack. *
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/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* of the function in [7.0, 10.0] is equivalent to the sum of the integrals of [7.0, 8.0], [8.0, * 9.0], [9.0, 10.0] (and so on), no matter what the function is. This guarantees that we handle * correctly requests of varying weight (permits), /no matter/ what the actual function is - so we * can tweak the latter freely. (The only requirement, obviously, is that we can compute its * integrals). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0)