- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 103 for nodejs (0.16 sec)
-
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* with user-defined properties. * * <p>A {@code ValueGraph} built by this class has the following default properties: * * <ul> * <li>does not allow self-loops * <li>orders {@link ValueGraph#nodes()} in the order in which the elements were added (insertion * order) * </ul> * * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
public interface PredecessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results * if the returned {@link Iterable} contains duplicate elements. Implementations of such
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(unordered.isOrdered()).isFalse(); assertThat(unordered).containsExactly("node", "node"); assertThat(unordered.nodeU()).isEqualTo("node"); assertThat(unordered.nodeV()).isEqualTo("node"); assertThat(unordered.adjacentNode("node")).isEqualTo("node"); assertThat(unordered.toString()).isEqualTo("[node, node]"); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(unordered.isOrdered()).isFalse(); assertThat(unordered).containsExactly("node", "node"); assertThat(unordered.nodeU()).isEqualTo("node"); assertThat(unordered.nodeV()).isEqualTo("node"); assertThat(unordered.adjacentNode("node")).isEqualTo("node"); assertThat(unordered.toString()).isEqualTo("[node, node]"); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
Set<E> inEdges(); Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without * parallel edges, this set cannot be of size greater than one. */ Set<E> edgesConnecting(N node); /** * Returns the node that is adjacent to the origin node along {@code edge}. * * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
/* * This class maintains a lazily-initialized table of atomically * updated variables, plus an extra "base" field. The table size * is a power of two. Indexing uses masked per-thread hash codes. * Nearly all declarations in this class are package-private, * accessed directly by subclasses. * * Table entries are of class Cell; a variant of AtomicLong padded
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-testlib/src/com/google/common/collect/testing/TestCollidingSetGenerator.java
import com.google.common.annotations.GwtCompatible; import com.google.common.collect.testing.SampleElements.Colliders; import java.util.List; /** * A generator using sample elements whose hash codes all collide badly. * * @author Kevin Bourrillion */ @GwtCompatible @ElementTypesAreNonnullByDefault public abstract class TestCollidingSetGenerator implements TestSetGenerator<Object> { @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.3K bytes - Viewed (0) -
guava/src/com/google/common/base/Objects.java
* Arrays#hashCode(Object[])}. Note that array arguments to this method, with the exception of a * single Object array, do not get any special handling; their hash codes are based on identity * and not contents. * * <p>This is useful for implementing {@link Object#hashCode()}. For example, in an object that * has three properties, {@code x}, {@code y}, and {@code z}, one could write:
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 2.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
lock02 = factory3.newReentrantLock(OtherOrder.SECOND); lock03 = factory3.newReentrantLock(OtherOrder.THIRD); } // In the unittest, create each ordered factory with its own set of lock // graph nodes (as opposed to using the static per-Enum map) to avoid // conflicts across different test runs. private <E extends Enum<E>> CycleDetectingLockFactory.WithExplicitOrdering<E> newInstanceWithExplicitOrdering(
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (0)