- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 33 for define (0.21 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
return requireLinks()[i]; } private void setLink(int i, long value) { requireLinks()[i] = value; } /* * We don't define getPredecessor+getSuccessor and setPredecessor+setSuccessor here because * they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Packaging.java
import org.apache.maven.api.annotations.Nonnull; import org.apache.maven.api.model.PluginContainer; /** * Interface representing a Maven project packaging. * <p> * TODO: define how to plug in new packaging definitions using the SPI. * the packaging are currently defined by Maven 3 {@code Provider<LifecycleMapping>} * * @since 4.0.0 */ @Experimental @Immutable public interface Packaging extends ExtensibleEnum { /**
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// catch absolutely everything and fall through to our 'SafeAtomicHelper' // The access control checks that ARFU does means the caller class has to be AbstractFuture // instead of SafeAtomicHelper, so we annoyingly define these here try { helper = new SafeAtomicHelper( newUpdater(Waiter.class, Thread.class, "thread"), newUpdater(Waiter.class, Waiter.class, "next"),
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicLongMap.java
* first decrementing to zero, and then removing. putIfAbsent or replace could observe the * intermediate zero-state. Ways we could deal with this are: * * - Don't define any of the ConcurrentMap operations. This is the current state of affairs. * * - Define putIfAbsent and replace as treating zero and absent identically (as currently * implemented below). This is a bit surprising with putIfAbsent, which really becomes
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
return requireLinks()[i]; } private void setLink(int i, long value) { requireLinks()[i] = value; } /* * We don't define getPredecessor+getSuccessor and setPredecessor+setSuccessor here because * they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/lifecycle/DefaultLifecycles.java
public Map<String, Lifecycle> getPhaseToLifecycleMap() { // If people are going to make their own lifecycles then we need to tell people how to namespace them correctly // so that they don't interfere with internally defined lifecycles. Map<String, Lifecycle> phaseToLifecycleMap = new HashMap<>(); for (Lifecycle lifecycle : getLifeCycles()) { logger.debug("Lifecycle {}", lifecycle);
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 6K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/profile/Os.java
static { // Those two public constants are initialized here, as they need all the private constants // above to be initialized first, but the code style imposes the public constants to be // defined above the private ones... OS_FAMILY = getOsFamily(); IS_WINDOWS = isFamily(FAMILY_WINDOWS); } private Os() {} /**
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 7.3K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
} @SuppressWarnings("rawtypes") // TreeBasedTable.create() is defined as such @Generates static <R extends Comparable, C extends Comparable, V> RowSortedTable<R, C, V> generateRowSortedTable(R row, C column, V value) { return generateTreeBasedTable(row, column, value); } @SuppressWarnings("rawtypes") // TreeBasedTable.create() is defined as such @Generates
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 28.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
/** * Returns an {@link Executor} that runs each task executed sequentially, such that no two tasks * are running concurrently. * * <p>{@linkplain Executor#execute executed} tasks have a happens-before order as defined in the * Java Language Specification. Tasks execute with the same happens-before order that the function * calls to {@link Executor#execute `execute()`} that submitted those tasks had. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* set of the empty set is not the empty set, but a one-element set containing the empty set. * * <p>The returned set and its constituent sets use {@code equals} to decide whether two elements * are identical, even if the input set uses a different concept of equivalence. * * <p><i>Performance notes:</i> while the power set of a set with size {@code n} is of size {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 77.2K bytes - Viewed (0)