- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 212 for origin (0.61 sec)
-
guava/src/com/google/common/collect/DiscreteDomain.java
this.supportsFastOffset = supportsFastOffset; } /** * Returns, conceptually, "origin + distance", or equivalently, the result of calling {@link * #next} on {@code origin} {@code distance} times. */ C offset(C origin, long distance) { C current = origin; checkNonnegative(distance, "distance"); for (long i = 0; i < distance; i++) { current = next(current);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
public static final String SAME_ORIGIN = "same-origin"; public static final String ORIGIN = "origin"; public static final String STRICT_ORIGIN = "strict-origin"; public static final String ORIGIN_WHEN_CROSS_ORIGIN = "origin-when-cross-origin"; public static final String STRICT_ORIGIN_WHEN_CROSS_ORIGIN = "strict-origin-when-cross-origin"; public static final String UNSAFE_URL = "unsafe-url"; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:08:08 GMT 2024 - 34.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
this.supportsFastOffset = supportsFastOffset; } /** * Returns, conceptually, "origin + distance", or equivalently, the result of calling {@link * #next} on {@code origin} {@code distance} times. */ C offset(C origin, long distance) { C current = origin; checkNonnegative(distance, "distance"); for (long i = 0; i < distance; i++) { current = next(current);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K 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/graph/GraphConnections.java
V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it * also becomes a successor. Associates {@code value} with the edge connecting the two nodes. */ void addPredecessor(N node, V value); /** * Add {@code node} as a successor to the origin node. In the case of an undirected graph, it also
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
import com.google.common.collect.UnmodifiableIterator; import java.util.AbstractSet; import java.util.Map; import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/InternetDomainNameTest.java
fail("www..google.com should have been invalid"); } catch (IllegalArgumentException expected) { } } public void testParentChild() { InternetDomainName origin = InternetDomainName.from("foo.com"); InternetDomainName parent = origin.parent(); assertEquals("com", parent.toString()); // These would throw an exception if leniency were not preserved during parent() and child() // calls.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Mar 05 13:16:00 GMT 2024 - 17.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
* returns an arbitrary (but consistent) endpoint of the origin edge. */ public final N nodeU() { return nodeU; } /** * Returns the node {@link #adjacentNode(Object) adjacent} to {@link #nodeU()} along the origin * edge. If this {@link EndpointPair} {@link #isOrdered()}, this is equal to {@link #target()}. */ public final N nodeV() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
import java.util.AbstractSet; import java.util.Iterator; import java.util.Map; import java.util.Map.Entry; import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 2.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/net/InternetDomainNameTest.java
fail("www..google.com should have been invalid"); } catch (IllegalArgumentException expected) { } } public void testParentChild() { InternetDomainName origin = InternetDomainName.from("foo.com"); InternetDomainName parent = origin.parent(); assertEquals("com", parent.toString()); // These would throw an exception if leniency were not preserved during parent() and child() // calls.
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Mar 05 13:16:00 GMT 2024 - 17.3K bytes - Viewed (0)