- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 941 for Hare (1.13 sec)
-
src/cmd/compile/internal/ssa/debug.go
// If this is the first call, do updates on the "baseState"; if this // is a subsequent call, tweak the startState instead. Note that // these "set" values are values; there are no side effects to // other values as these are modified. newState := baseState if updating { newState = blockLocs[b.ID].startState } for it := newState.Iterator(); !it.Done(); { k, d := it.Next()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data, * whose edges are unique objects. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 22.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableBiMap.java
* not allowed, and will cause {@link #build} to fail. */ @CanIgnoreReturnValue @Override public Builder<K, V> put(K key, V value) { super.put(key, value); return this; } /** * Adds the given {@code entry} to the bimap. Duplicate keys or values are not allowed, and will * cause {@link #build} to fail.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
/** * Determines whether an edge has already been used during traversal. In the directed case a cycle * is always detected before reusing an edge, so no special logic is required. In the undirected * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going * from B to A). */ private static boolean canTraverseWithoutReusingEdge(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* safe to do so. The exact circumstances under which a copy will or will not be performed are * undocumented and subject to change. * * <p>This method is not type-safe, as it may be called on elements that are not mutually * comparable. * * @throws ClassCastException if the elements are not mutually comparable * @throws NullPointerException if any of {@code elements} is null */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 29.5K bytes - Viewed (0) -
doc/next/6-stdlib/2-unique.md
Any value of comparable type may be canonicalized with the new `Make[T]` function, which produces a reference to a canonical copy of the value in the form of a `Handle[T]`. Two `Handle[T]` are equal if and only if the values used to produce the handles are equal, allowing programs to deduplicate values and reduce their memory footprint. Comparing two `Handle[T]` values is efficient, reducing down to a simple
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 18:34:13 UTC 2024 - 566 bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/base/Objects.java
private Objects() {} /** * Determines whether two possibly-null objects are equal. Returns: * * <ul> * <li>{@code true} if {@code a} and {@code b} are both null. * <li>{@code true} if {@code a} and {@code b} are both non-null and they are equal according to * {@link Object#equals(Object)}. * <li>{@code false} in all other situations. * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 2.9K bytes - Viewed (0) -
maven-embedder/src/test/java/org/apache/maven/cli/transfer/ConsoleMavenTransferListenerTest.java
try { endLatch.await(); } catch (InterruptedException e) { e.printStackTrace(); } // despite all are back, we need to make sure all the events are processed (are async) // this one should block until all processed listener.transferSucceeded(new TransferEvent.Builder(session, resource) .setType(TransferEvent.EventType.SUCCEEDED)
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Feb 28 23:31:59 UTC 2024 - 5K bytes - Viewed (0)