- Sort Score
- Result 10 results
- Languages All
Results 11 - 18 of 18 for JDKs (0.07 sec)
-
pom.xml
<jsr305.version>3.0.2</jsr305.version> <checker.version>3.43.0</checker.version> <errorprone.version>2.28.0</errorprone.version> <j2objc.version>3.0.0</j2objc.version> <!-- Empty for all JDKs but 9-12 --> <maven-javadoc-plugin.additionalJOptions></maven-javadoc-plugin.additionalJOptions> <project.build.outputTimestamp>2024-01-02T00:00:00Z</project.build.outputTimestamp>
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:51:04 UTC 2024 - 20.6K bytes - Viewed (0) -
guava/src/com/google/common/io/TempFileCreator.java
Class<?> optionalClass = Class.forName("java.util.Optional"); /* * We don't *need* to use reflection to access Optional: It's available on all JDKs we * support, and Android code won't get this far, anyway, because ProcessHandle is * unavailable. But given how much other reflection we're using, we might as well use it
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 06 17:11:11 UTC 2023 - 12.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* <ul> * <li>UNSET, meaning "null pointer" * <li>one plus an index into the entries and elements array * </ul> * <li>another java.util.Set delegate implementation. In most modern JDKs, normal java.util hash * collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 24K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* <ul> * <li>UNSET, meaning "null pointer" * <li>one plus an index into the entries and elements array * </ul> * <li>another java.util.Set delegate implementation. In most modern JDKs, normal java.util hash * collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 24.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
// We can continue if it's 1.8, and we can continue if it's an integer in [9, 20). if (javaVersion != null && javaVersion >= 20) { // TODO(b/261217224, b/361604053): Make this test work under newer JDKs. return; } TimedWaiterThread thread = new TimedWaiterThread(new AbstractFuture<Object>() {}, 2, SECONDS); thread.start(); thread.awaitWaiting();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 22:10:29 UTC 2024 - 47.1K bytes - Viewed (0) -
api/maven-api-model/src/main/mdo/maven.mdo
<type>String</type> <description> Specifies that this profile will be activated when a matching JDK is detected. For example, {@code 1.4} only activates on JDKs versioned 1.4, while {@code !1.4} matches any JDK that is not version 1.4. Ranges are supported too: {@code [1.5,)} activates when the JDK is 1.5 minimum. </description> </field>
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Wed Oct 09 11:07:31 UTC 2024 - 115.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
if (expectedSize < 3) { checkNonnegative(expectedSize, "expectedSize"); return expectedSize + 1; } if (expectedSize < Ints.MAX_POWER_OF_TWO) { // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap // ends up being used to compute a "threshold" size, beyond which the internal table // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 161.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Maps.java
if (expectedSize < 3) { checkNonnegative(expectedSize, "expectedSize"); return expectedSize + 1; } if (expectedSize < Ints.MAX_POWER_OF_TWO) { // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap // ends up being used to compute a "threshold" size, beyond which the internal table // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 167.4K bytes - Viewed (0)