- Sort Score
- Result 10 results
- Languages All
Results 571 - 580 of 795 for master (0.08 sec)
-
build-logic-commons/gradle-plugin/src/main/kotlin/gradlebuild.ci-reporting.gradle.kts
* artifact publishing by reducing the artifacts and packaging reports that consist of multiple files. * * Reducing the number of reports also makes it easier to find the important ones when analysing a failed build in * Team City. */ val testFilesCleanup = extensions.create<TestFileCleanUpExtension>("testFilesCleanup").apply { reportOnly.convention(false) }
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Tue Jul 11 06:57:51 UTC 2023 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(float[] array, int distance) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Doubles.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(double[] array, int distance) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 27.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Floats.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(float[] array, int distance) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/LittleEndianByteArray.java
* very efficient. May be useful for calling code to fall back on an alternative implementation * that is slower than Unsafe.get/store but faster than the pure-Java mask-and-shift. */ static boolean usingUnsafe() { return (byteArray instanceof UnsafeByteArray); } /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 9.8K bytes - Viewed (0) -
internal/store/queuestore.go
defer store.RUnlock() return l } // lockless call func (store *QueueStore[_]) del(key Key) error { err := os.Remove(filepath.Join(store.directory, key.String())) // Delete as entry no matter the result delete(store.entries, key.String()) return err } // List - lists all files registered in the store. func (store *QueueStore[_]) List() (keys []Key) { store.RLock()
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 23:06:30 UTC 2024 - 8.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(char[] array, int distance) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 23.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(short[] array, int distance) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 25.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(short[] array, int distance) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 25.5K bytes - Viewed (0) -
guava/src/com/google/common/io/CharSource.java
* * <p>Since Strings are immutable and built into the jdk we can optimize some operations * * <ul> * <li>use {@link StringReader} instead of {@link CharSequenceReader}. It is faster since it can * use {@link String#getChars(int, int, char[], int)} instead of copying characters one by * one with {@link CharSequence#charAt(int)}.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:20:11 UTC 2024 - 25.5K bytes - Viewed (0)