- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 105 for Lyding (0.17 sec)
-
android/guava/src/com/google/common/primitives/UnsignedInteger.java
* value */ public static UnsignedInteger valueOf(String string, int radix) { return fromIntBits(UnsignedInts.parseUnsignedInt(string, radix)); } /** * Returns the result of adding this and {@code val}. If the result would have more than 32 bits, * returns the low 32 bits of the result. * * @since 14.0 */ public UnsignedInteger plus(UnsignedInteger val) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 23 18:45:50 GMT 2023 - 8.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
putEdge(5, 1); putEdge(1, 2); putEdge(3, 1); } // Element Mutation @Test public void putEdge_existingNodes() { assume().that(graphIsMutable()).isTrue(); // Adding nodes initially for safety (insulating from possible future // modifications to proxy methods) addNode(N1); addNode(N2); assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/TestThread.java
super(threadName); this.lockLikeObject = checkNotNull(lockLikeObject); start(); } // Thread.stop() is okay because all threads started by a test are dying at the end of the test, // so there is no object state put at risk by stopping the threads abruptly. In some cases a test // may put a thread into an uninterruptible operation intentionally, so there is no other way to
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStats.java
* other using {@code second = new PairedStatsAccumulator().addAll(first).snapshot()}, if both * were obtained by calling {@code snapshot()} on the same {@link PairedStatsAccumulator} without * adding any values in between the two calls, or if one is obtained from the other after * round-tripping through java serialization. However, floating point rounding errors mean that it
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
this.queue = new Object[queueSize]; } @Override public int size() { return size; } /** * Adds the given element to this queue. If this queue has a maximum size, after adding {@code * element} the queue will automatically evict its greatest element (according to its comparator), * which may be {@code element} itself. * * @return {@code true} always */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assertThat(network.outDegree(N1)).isEqualTo(2); } // Element Mutation @Test public void addEdge_existingNodes() { assume().that(graphIsMutable()).isTrue(); // Adding nodes initially for safety (insulating from possible future // modifications to proxy methods) addNode(N1); addNode(N2); assertThat(networkAsMutableNetwork.addEdge(N1, N2, E12)).isTrue();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* }</pre> * * <p>{@link ValueGraphBuilder#build()} returns an instance of {@link MutableValueGraph}, which is a * subtype of {@code ValueGraph} that provides methods for adding and removing nodes and edges. If * you do not need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on * the graph), you should use the non-mutating {@link ValueGraph} interface, or an {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphsTest.java
private static final String E34 = "3-4"; private static final String E44 = "4-4"; private static final int NODE_COUNT = 20; private static final int EDGE_COUNT = 20; // TODO(user): Consider adding both error messages from here and {@link AbstractNetworkTest} // in one class (may be a utility class for error messages). private static final String ERROR_PARALLEL_EDGE = "connected by a different edge";
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
import java.util.Set; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactHashSet is an implementation of a Set. All optional operations (adding and removing) are * supported. The elements can be any objects. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
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/io/ByteSource.java
* source, the returned source will be empty. If {@code offset + length} is greater than the size * of this source, the returned source will contain the slice starting at {@code offset} and * ending at the end of this source. * * @throws IllegalArgumentException if {@code offset} or {@code length} is negative */ public ByteSource slice(long offset, long length) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed May 17 14:35:11 GMT 2023 - 26.2K bytes - Viewed (0)