- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 161 for Potato (0.1 sec)
-
android/guava/src/com/google/common/primitives/Shorts.java
* + 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) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 25.1K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
* + 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) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* + 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) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 25.2K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Floats.java
* + 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) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 25.2K bytes - Viewed (0) -
src/net/dnsconfig_unix.go
conf.timeout = time.Duration(n) * time.Second case stringslite.HasPrefix(s, "attempts:"): n, _, _ := dtoi(s[9:]) if n < 1 { n = 1 } conf.attempts = n case s == "rotate": conf.rotate = true case s == "single-request" || s == "single-request-reopen": // Linux option: // http://man7.org/linux/man-pages/man5/resolv.conf.5.html
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 02 22:14:43 UTC 2024 - 4.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/BytesTest.java
input = Arrays.copyOf(input, input.length); Bytes.rotate(input, distance); assertThat(input).isEqualTo(expectedOutput); } private static void testRotate( byte[] input, int distance, int fromIndex, int toIndex, byte[] expectedOutput) { input = Arrays.copyOf(input, input.length); Bytes.rotate(input, distance, fromIndex, toIndex); assertThat(input).isEqualTo(expectedOutput);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 06 16:10:08 UTC 2024 - 16.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
* + 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) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Doubles.java
* + 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) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 27.3K bytes - Viewed (0) -
src/internal/chacha8rand/chacha8_arm64.s
// license that can be found in the LICENSE file. #include "textflag.h" // QR is the ChaCha quarter-round on A, B, C, and D. // V30 is used as a temporary, and V31 is assumed to // hold the index table for rotate left 8. #define QR(A, B, C, D) \ VADD A.S4, B.S4, A.S4; VEOR D.B16, A.B16, D.B16; VREV32 D.H8, D.H8; \ VADD C.S4, D.S4, C.S4; VEOR B.B16, C.B16, V30.B16; VSHL $12, V30.S4, B.S4; VSRI $20, V30.S4, B.S4 \
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* + i) mod array.length}. This is equivalent to {@code Collections.rotate(Ints.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(int[] array, int distance) { rotate(array, distance, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 29.7K bytes - Viewed (0)