- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 138 for Carter (0.15 sec)
-
maven-core/src/main/java/org/apache/maven/internal/impl/PathModularization.java
/** * Information about the modules contained in a path element. * The path element may be a JAR file or a directory. Directories may use either package hierarchy * or module hierarchy, but not module source hierarchy. The latter is excluded because this class * is for path elements of compiled codes. */ class PathModularization { /** * A unique constant for all non-modular dependencies. */
Java - Registered: Sun Mar 24 03:35:10 GMT 2024 - Last Modified: Fri Mar 01 17:18:13 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* under the assumption that for long-running instances, observed * contention levels will recur, so the cells will eventually be * needed again; and for short-lived ones, it does not matter. */ /** * Padded variant of AtomicLong supporting only raw accesses plus CAS. The value field is placed * between pads, hoping that the JVM doesn't reorder them. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* query than the original; your mileage may vary. Precomputation takes time and is likely to be * worthwhile only if the precomputed matcher is queried many thousands of times. * * <p>This method has no effect (returns {@code this}) when called in GWT: it's unclear whether a * precomputed matcher is faster, but it certainly consumes more memory, which doesn't seem like a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
for (int i = 0; i < array.length; i++) { array[i] = counter.getAndIncrement(); } builder.addAll(ImmutableLongArray.copyOf(array)); } }, ADD_LARGER_ARRAY { @Override void doIt(ImmutableLongArray.Builder builder, AtomicLong counter) { long[] array = new long[RANDOM.nextInt(200) + 200]; for (int i = 0; i < array.length; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 19K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
for (int i = 0; i < array.length; i++) { array[i] = counter.getAndIncrement(); } builder.addAll(ImmutableDoubleArray.copyOf(array)); } }, ADD_LARGER_ARRAY { @Override void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) { double[] array = new double[RANDOM.nextInt(200) + 200]; for (int i = 0; i < array.length; i++) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 21.3K bytes - Viewed (0) -
src/test/java/jcifs/tests/EnumTest.java
return getConfigs("smb1", "noUnicode", "forceUnicode", "noNTStatus", "noNTSmbs", "smb2", "smb30", "smb31"); } @Ignore ( "This causes a connection to whatever local master browser is available, config may be incompatible with it" ) @Test public void testBrowse () throws MalformedURLException, CIFSException { CIFSContext ctx = withAnonymousCredentials();
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Thu Jan 05 13:09:03 GMT 2023 - 25.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
// but work beyond that must take at least one second assertTrue(afterBurst >= 1000); } } /** * This neat test shows that no matter what weights we use in our requests, if we push X amount of * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
} int getSuccessor(int entryIndex) { return (entryIndex + 1 < size) ? entryIndex + 1 : -1; } /** * Updates the index an iterator is pointing to after a call to remove: returns the index of the * entry that should be looked at after a removal on indexRemoved, with indexBeforeRemove as the * index that *was* the next entry that would be looked at. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* the current count of the element in the multiset, depending on the implementation. Note that * in the former case, this method can never return zero, while in the latter, it will return * zero if all occurrences of the element were since removed from the multiset. * * @return the count of the element; never negative */ int getCount(); /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* * <p>Many of the filtered set's methods, such as {@code size()}, iterate across every element in * the underlying set and determine which elements satisfy the filter. When a live view is * <i>not</i> needed, it may be faster to copy {@code Iterables.filter(unfiltered, predicate)} and * use the copy. * * <p><b>Warning:</b> {@code predicate} must be <i>consistent with equals</i>, as documented at
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0)