- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 346 for Buch (0.14 sec)
-
maven-core/src/main/java/org/apache/maven/lifecycle/internal/ProjectSegment.java
* </p> * <p> * Wise voices have suggested that maybe aggregators shouldn't be bound to the ordinary * lifecycle at all, in which case we wouldn't be needing this class at all ( and * ProjectBuildList.getByTaskSegments). Or maybe they should be introduced in the calculation * of the execution plan instead, which seems much nicer. * </p> * <p>
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/TempFileCreator.java
static final TempFileCreator INSTANCE = pickSecureCreator(); /** * @throws IllegalStateException if the directory could not be created (to implement the contract * of {@link Files#createTempDir()}, such as if the system does not support creating temporary * directories securely */ abstract File createTempDir(); abstract File createTempFile(String prefix) throws IOException;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 06 17:11:11 GMT 2023 - 12.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimap.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheLoader.java
* } * }; * LoadingCache<Key, Graph> cache = CacheBuilder.newBuilder().build(loader); * }</pre> * * <p>Since this example doesn't support reloading or bulk loading, it can also be specified much * more simply: * * <pre>{@code * CacheLoader<Key, Graph> loader = CacheLoader.from(key -> createExpensiveGraph(key)); * }</pre> * * @author Charles Fry * @since 10.0 */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Dec 19 20:20:14 GMT 2022 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
Preconditions.checkElementIndex(index, length()); return array[start + index]; } /** * Returns the smallest index for which {@link #get} returns {@code target}, or {@code -1} if no * such index exists. Equivalent to {@code asList().indexOf(target)}. */ public int indexOf(int target) { for (int i = start; i < end; i++) { if (array[i] == target) { return i - start; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* to reduce cache contention on most processors. Padding is * overkill for most Atomics because they are usually irregularly * scattered in memory and thus don't interfere much with each * other. But Atomic objects residing in arrays will tend to be * placed adjacent to each other, and so will most often share * cache lines (with a huge negative performance impact) without * this precaution.
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/primitives/ImmutableDoubleArray.java
Preconditions.checkElementIndex(index, length()); return array[start + index]; } /** * Returns the smallest index for which {@link #get} returns {@code target}, or {@code -1} if no * such index exists. Values are compared as if by {@link Double#equals}. Equivalent to {@code * asList().indexOf(target)}. */ public int indexOf(double target) { for (int i = start; i < end; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* such as {@code removeAll()} and {@code clear()} are called on the filtered set, only elements * that satisfy the filter will be removed from the underlying set. * * <p>The returned set isn't threadsafe or serializable, even if {@code unfiltered} is. * * <p>Many of the filtered set's methods, such as {@code size()}, iterate across every element in
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) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
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
* equivalent (except in the case of overflow) to the call {@code * addAll(Collections.nCopies(element, occurrences))}, which would presumably perform much more * poorly. * * @param element the element to add occurrences of; may be null only if explicitly allowed by the * implementation
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)