- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 54 for deterministic (1.19 sec)
-
guava/src/com/google/common/collect/ImmutableCollection.java
* Collections#unmodifiableCollection}, whose contents change whenever the wrapped collection * is modified. * <li><b>Null-hostility.</b> This collection will never contain a null element. * <li><b>Deterministic iteration.</b> The iteration order is always well-defined, depending on * how the collection was created. Typically this is insertion order unless an explicit
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 18.7K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/Sets.java
* E} is an {@link Enum} type, use {@link EnumSet#noneOf} instead. Otherwise, strongly consider * using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get * deterministic iteration behavior. * * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead, * use the {@code HashSet} constructor directly, taking advantage of <a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/IntMathTest.java
// Check the first 100,000 integers for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
// Check the first 100,000 integers for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableCollection.java
* Collections#unmodifiableCollection}, whose contents change whenever the wrapped collection * is modified. * <li><b>Null-hostility.</b> This collection will never contain a null element. * <li><b>Deterministic iteration.</b> The iteration order is always well-defined, depending on * how the collection was created. Typically this is insertion order unless an explicit
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.5K bytes - Viewed (0) -
src/archive/tar/writer.go
} */ _ = realSize // Write PAX records to the output. isGlobal := hdr.Typeflag == TypeXGlobalHeader if len(paxHdrs) > 0 || isGlobal { // Sort keys for deterministic ordering. var keys []string for k := range paxHdrs { keys = append(keys, k) } sort.Strings(keys) // Write each record to a buffer. var buf strings.Builder for _, k := range keys {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 18:36:46 GMT 2023 - 19.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Tables.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 04 22:45:41 GMT 2024 - 26.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* iterator will generally throw a {@link ConcurrentModificationException}. Thus, in the face of * concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, * non-deterministic behavior at an undetermined time in the future. * * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally
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/src/com/google/common/collect/LinkedListMultimap.java
import java.util.NoSuchElementException; import java.util.Set; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * An implementation of {@code ListMultimap} that supports deterministic iteration order for both * keys and values. The iteration order is preserved across non-distinct key values. For example, * for the following multimap definition: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
cmd/notification.go
info.Disks = getOfflineDisks(info.Endpoint, globalEndpoints) } reply[idx] = info }(client, i) } wg.Wait() return reply } // restClientFromHash will return a deterministic peerRESTClient based on s. // Will return nil if client is local. func (sys *NotificationSys) restClientFromHash(s string) (client *peerRESTClient) { if len(sys.peerClients) == 0 { return nil }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 12 18:13:36 GMT 2024 - 44.5K bytes - Viewed (0)