- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for 21 (0.15 sec)
-
guava-tests/test/com/google/common/collect/CountTest.java
} public void testGetAndAdd() { Count holder = new Count(20); assertEquals(20, holder.get()); holder.add(1); assertEquals(21, holder.get()); } public void testAddAndGet() { Count holder = new Count(20); assertEquals(21, holder.addAndGet(1)); } public void testGetAndSet() { Count holder = new Count(10); assertEquals(10, holder.getAndSet(20));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 1.5K bytes - Viewed (0) -
.github/workflows/ci.yml
Others - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:33:50 GMT 2024 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/SipHashFunction.java
v1 ^= v0; v3 ^= v2; v0 = Long.rotateLeft(v0, 32); v2 += v1; v0 += v3; v1 = Long.rotateLeft(v1, 17); v3 = Long.rotateLeft(v3, 21); v1 ^= v2; v3 ^= v0; v2 = Long.rotateLeft(v2, 32); } } } private static final long serialVersionUID = 0L;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 5.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedIntegerTest.java
assertThat(value.toString(radix)).isEqualTo(value.bigIntegerValue().toString(radix)); } } } public void testToStringRadixQuick() { int[] radices = {2, 3, 5, 7, 10, 12, 16, 21, 31, 36}; for (int radix : radices) { for (int l : TEST_INTS) { UnsignedInteger value = UnsignedInteger.fromIntBits(l);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 9.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedLongTest.java
assertThat(value.toString(radix)).isEqualTo(value.bigIntegerValue().toString(radix)); } } } public void testToStringRadixQuick() { int[] radices = {2, 3, 5, 7, 10, 12, 16, 21, 31, 36}; for (int radix : radices) { for (long l : TEST_LONGS) { UnsignedLong value = UnsignedLong.fromLongBits(l);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 10.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
.containsExactly(0.0, 1.0, 3.0, 6.0, 10.0, 15.0) .inOrder(); } public void testOf7() { assertThat(ImmutableDoubleArray.of(0, 1, 3, 6, 10, 15, 21).asList()) .containsExactly(0.0, 1.0, 3.0, 6.0, 10.0, 15.0, 21.0) .inOrder(); } public void testCopyOf_array_empty() { /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 06 15:23:21 GMT 2023 - 20K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
.containsExactly(0L, 1L, 3L, 6L, 10L, 15L) .inOrder(); } public void testOf7() { assertThat(ImmutableLongArray.of(0, 1, 3, 6, 10, 15, 21).asList()) .containsExactly(0L, 1L, 3L, 6L, 10L, 15L, 21L) .inOrder(); } public void testCopyOf_array_empty() { /*
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 20.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
isDone = true; h1 ^= mixK1((int) buffer); return fmix(h1, length); } } private static long codePointToFourUtf8Bytes(int codePoint) { // codePoint has at most 21 bits return ((0xFL << 4) | (codePoint >>> 18)) | ((0x80L | (0x3F & (codePoint >>> 12))) << 8) | ((0x80L | (0x3F & (codePoint >>> 6))) << 16) | ((0x80L | (0x3F & codePoint)) << 24); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 11.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/Collections2Test.java
.size()); // 21 elements overflow a long assertEquals( Integer.MAX_VALUE, Collections2.orderedPermutations( newArrayList( 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)) .size()); // Almost force an overflow in the binomial coefficient calculation
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 19.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/Collections2Test.java
.size()); // 21 elements overflow a long assertEquals( Integer.MAX_VALUE, Collections2.orderedPermutations( newArrayList( 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)) .size()); // Almost force an overflow in the binomial coefficient calculation
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 19.7K bytes - Viewed (0)