- Sort Score
- Num 10 results
- Language All
Results 201 - 210 of 234 for safely (0.04 seconds)
-
guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public int size() { return AbstractNetwork.this.edges().size(); } // Mostly safe: We check contains(u) before calling successors(u), so we perform unsafe // operations only in weird cases like checking for an EndpointPair<ArrayList> in a // Network<LinkedList>.Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Feb 19 21:24:11 GMT 2025 - 10.3K bytes - Click Count (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
return Ints.saturatedCast(edgeCount()); } @Override public boolean remove(@Nullable Object o) { throw new UnsupportedOperationException(); } // Mostly safe: We check contains(u) before calling successors(u), so we perform unsafe // operations only in weird cases like checking for an EndpointPair<ArrayList> in a // Graph<LinkedList>. @SuppressWarnings("unchecked")
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 07 15:57:03 GMT 2025 - 11.5K bytes - Click Count (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/package-info.java
* * <p>The {@link org.apache.maven.api.Session} interface is the main entry point for Maven operations. * It maintains the state of a Maven execution and provides access to all core services and components. * Sessions are thread-safe and can be obtained in session-scoped components using the * {@link org.apache.maven.api.di.SessionScoped} annotation.</p> * * <p>Key capabilities provided through the Session include:</p> * <ul>Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Mon Dec 15 11:13:42 GMT 2025 - 7.7K bytes - Click Count (0) -
android/guava/src/com/google/common/math/Quantiles.java
// it. We swap the pivot into partitionPoint and we know the array is partitioned around that. swap(array, from, partitionPoint); return partitionPoint; } /** * Selects the pivot to use, namely the median of the values at {@code from}, {@code to}, and * halfway between the two (rounded down), from {@code array}, and ensure (by swapping elements ifCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 30.1K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/ObjectArrays.java
} /** * Returns an array containing all of the elements in the specified collection. This method * returns the elements in the order they are returned by the collection's iterator. The returned * array is "safe" in that no references to it are maintained by the collection. The caller is * thus free to modify the returned array. * * <p>This method assumes that the collection size doesn't change while the method is running.
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Dec 09 15:48:28 GMT 2025 - 8.9K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Ordering.java
/* * Note that technically the returned ordering should be capable of * handling not just {@code Iterable<S>} instances, but also any {@code * Iterable<? extends S>}. However, the need for this comes up so rarely * that it doesn't justify making everyone else deal with the very ugly * wildcard. */ return new LexicographicalOrdering<S>(this); } // Regular instance methods @OverrideCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 39.5K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* they appear. Input data is never modified. {@link HashFunction} instances should always be * stateless, and therefore thread-safe. * <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes * produce the same hash code for distinct inputs (a "collision"), every hash function strivesCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
guava/src/com/google/common/hash/HashFunction.java
* they appear. Input data is never modified. {@link HashFunction} instances should always be * stateless, and therefore thread-safe. * <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes * produce the same hash code for distinct inputs (a "collision"), every hash function strivesCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
internal/config/identity/plugin/config.go
// constant across restarts. h := sha1.New() h.Write([]byte(pluginURL)) bs := h.Sum(nil) resourceID += base64.RawURLEncoding.EncodeToString(bs) } else { // Check that the roleID is restricted to URL safe characters // (base64 URL encoding chars). if !validRoleIDRegex.MatchString(roleID) { return args, config.Errorf("Role ID must match the regexp `^[a-zA-Z0-9_-]+$`") } // Use the user provided ID here.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 13.3K bytes - Click Count (0) -
doc/asm.html
Also, constants are always evaluated as 64-bit unsigned integers. Thus <code>-2</code> is not the integer value minus two, but the unsigned 64-bit integer with the same bit pattern. The distinction rarely matters but to avoid ambiguity, division or right shift where the right operand's high bit is set is rejected. </p> <h3 id="symbols">Symbols</h3> <p>
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Nov 14 19:09:46 GMT 2025 - 36.5K bytes - Click Count (0)