- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for Hit (0.19 sec)
-
guava-tests/test/com/google/common/net/InetAddressesTest.java
assertFalse(InetAddresses.isInetAddress("016.016.016.016")); } public void testForStringIPv4Input() throws UnknownHostException { String ipStr = "192.168.0.1"; // Shouldn't hit DNS, because it's an IP string literal. InetAddress ipv4Addr = InetAddress.getByName(ipStr); assertEquals(ipv4Addr, InetAddresses.forString(ipStr)); assertTrue(InetAddresses.isInetAddress(ipStr)); }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 31.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/InetAddressesTest.java
assertFalse(InetAddresses.isInetAddress("016.016.016.016")); } public void testForStringIPv4Input() throws UnknownHostException { String ipStr = "192.168.0.1"; // Shouldn't hit DNS, because it's an IP string literal. InetAddress ipv4Addr = InetAddress.getByName(ipStr); assertEquals(ipv4Addr, InetAddresses.forString(ipStr)); assertTrue(InetAddresses.isInetAddress(ipStr)); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 31.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableSetTest.java
assertEquals(8, ImmutableSet.chooseTableSize(4)); assertEquals(1 << 29, ImmutableSet.chooseTableSize(1 << 28)); assertEquals(1 << 29, ImmutableSet.chooseTableSize((1 << 29) * 3 / 5)); // Now we hit the cap assertEquals(1 << 30, ImmutableSet.chooseTableSize(1 << 29)); assertEquals(1 << 30, ImmutableSet.chooseTableSize((1 << 30) - 1)); // Now we've gone too far
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* * <h3>Performance</h3> * * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a * 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
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) -
guava-tests/test/com/google/common/io/CharStreamsTest.java
* size to reach 0, causing an infinite loop. */ public void testCopyWithReaderThatDoesNotFillBuffer() throws IOException { // need a long enough string for the buffer to hit 0 remaining before the copy completes String string = Strings.repeat("0123456789", 100); StringBuilder b = new StringBuilder();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/CharStreamsTest.java
* size to reach 0, causing an infinite loop. */ public void testCopyWithReaderThatDoesNotFillBuffer() throws IOException { // need a long enough string for the buffer to hit 0 remaining before the copy completes String string = Strings.repeat("0123456789", 100); StringBuilder b = new StringBuilder();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableSetTest.java
assertEquals(8, ImmutableSet.chooseTableSize(4)); assertEquals(1 << 29, ImmutableSet.chooseTableSize(1 << 28)); assertEquals(1 << 29, ImmutableSet.chooseTableSize((1 << 29) * 3 / 5)); // Now we hit the cap assertEquals(1 << 30, ImmutableSet.chooseTableSize(1 << 29)); assertEquals(1 << 30, ImmutableSet.chooseTableSize((1 << 30) - 1)); // Now we've gone too far
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
int nKeys = keys.size(); long blah = 0; for (int i = 0; i < reps; i++) { Integer key = keys.get(random.nextInt(nKeys)); // This range is [-5, 4] - slight negative bias so we often hit zero, which brings the // auto-removal of zeroes into play. int delta = random.nextInt(10) - 5; blah += delta; if (delta >= 0) { multiset.add(key, delta); } else {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 06 12:56:11 GMT 2023 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* Each bit is set to 1 for all remainders that indicate divisibility by 2, 3, or 5, so * 1, 7, 11, 13, 17, 19, 23, 29 are set to 0. 30 and up don't matter because they won't be hit. */ private static final int SIEVE_30 = ~((1 << 1) | (1 << 7) | (1 << 11) | (1 << 13) | (1 << 17) | (1 << 19) | (1 << 23) | (1 << 29)); /** * Returns {@code true} if {@code n} is a <a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
* inputs. All valid inputs must pass this regex, but it's semantically fine if not all inputs * that pass this regex are valid -- only a performance hit is incurred, not a semantics bug. */ @GwtIncompatible // regular expressions static final java.util.regex.Pattern FLOATING_POINT_PATTERN = fpPattern(); @GwtIncompatible // regular expressions
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 27.1K bytes - Viewed (0)