- Sort Score
- Num 10 results
- Language All
Results 91 - 100 of 633 for least (0.01 seconds)
-
android/guava/src/com/google/common/primitives/Shorts.java
* * @param array an array of {@code short} values, possibly empty * @param target a primitive {@code short} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(short[] array, short target) { return indexOf(array, target, 0, array.length);Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 25.7K bytes - Click Count (0) -
guava/src/com/google/common/primitives/Shorts.java
* * @param array an array of {@code short} values, possibly empty * @param target a primitive {@code short} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(short[] array, short target) { return indexOf(array, target, 0, array.length);Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 25.7K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
} } return current; } /** * Returns the unique least value of type {@code C} that is greater than {@code value}, or {@code * null} if none exists. Inverse operation to {@link #previous}. * * @param value any value of type {@code C} * @return the least value greater than {@code value}, or {@code null} if {@code value} is {@code * maxValue()} */Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Feb 13 17:34:21 GMT 2025 - 10.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/reflect/ImmutableTypeToInstanceMapTest.java
} private <T> TypeToken<Iterable<T>> anyIterableType() { return new TypeToken<Iterable<T>>() {}; } @SuppressWarnings("rawtypes") // TODO(cpovirk): Can we at least use Class<?> in some places? abstract static class TestTypeToInstanceMapGenerator implements TestMapGenerator<TypeToken, Object> { @Override public TypeToken<?>[] createKeyArray(int length) {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 6.9K bytes - Click Count (0) -
internal/crypto/sse-c.go
_ Type = SSEC ) // String returns the SSE domain as string. For SSE-C the // domain is "SSE-C". func (ssec) String() string { return "SSE-C" } // IsRequested returns true if the HTTP headers contains // at least one SSE-C header. SSE-C copy headers are ignored. func (ssec) IsRequested(h http.Header) bool { if _, ok := h[xhttp.AmzServerSideEncryptionCustomerAlgorithm]; ok { return true }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 5.2K bytes - Click Count (0) -
docs/debugging/pprofgoparser/main.go
t = time.Duration(a) * time.Minute save(line) record = true } else { skip = true } } } } return ret, nil } const helpUsage = ` At least one argument is required to run this tool. EXAMPLE: ./pprofgoparser --time 50m --margin 1m /path/to/*-goroutines-before,debug=2.txt ` func main() { flag.Parse() if len(flag.Args()) == 0 {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Wed Mar 06 11:43:16 GMT 2024 - 3.4K bytes - Click Count (0) -
internal/bucket/lifecycle/lifecycle.go
xhttp "github.com/minio/minio/internal/http" ) var ( errLifecycleTooManyRules = Errorf("Lifecycle configuration allows a maximum of 1000 rules") errLifecycleNoRule = Errorf("Lifecycle configuration should have at least one rule") errLifecycleDuplicateID = Errorf("Rule ID must be unique. Found same ID for more than one rule") errXMLNotWellFormed = Errorf("The XML you provided was not well-formed or did not validate against our published schema")
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Apr 03 06:45:06 GMT 2025 - 18.2K bytes - Click Count (0) -
.github/DISCUSSION_TEMPLATE/questions.yml
* Read open questions until I find 2 where I can help someone and add a comment to help there. * I already hit the "watch" button in this repository to receive notifications and I commit to help at least 2 people that ask questions in the future. * Review one Pull Request by downloading the code and following [all the review process](https://fastapi.tiangolo.com/help-fastapi/#review-pull-requests). options:Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Thu Aug 03 15:59:41 GMT 2023 - 5.8K bytes - Click Count (0) -
.teamcity/src/main/kotlin/model/BucketExtensions.kt
} } /** * Determine the number of buckets for the first element in the list * when it needs to be split into several smaller pieces. * * The basic idea is: * 1. Make sure the rest elements has at least one bucket. * 2. Make sure the "roughSizeOfEachBucket" for the rest elements is smaller than the current "roughSizeOfEachBucket". */ private fun <T> determineBucketNumberForLargeElment( largestElementSize: Int,
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Wed Feb 12 09:12:03 GMT 2025 - 5.7K bytes - Click Count (0) -
guava/src/com/google/common/math/Stats.java
* * <p><b>Note:</b> No guarantees are made regarding stability of the representation between * versions. * * @param buffer A {@link ByteBuffer} with at least BYTES {@link ByteBuffer#remaining}, ordered as * {@link ByteOrder#LITTLE_ENDIAN}, to which a BYTES-long byte representation of this instanceCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 24.8K bytes - Click Count (0)