- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 781 for iterations (0.17 sec)
-
guava/src/com/google/common/collect/CompactHashSet.java
* amortized since some operations can trigger a hash table resize. * * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultimap.java
* need for a distinct {@code ImmutableBiMultimap} type. * * <p><a id="iteration"></a> * * <p><b>Key-grouped iteration.</b> All view collections follow the same iteration order. In all * current implementations, the iteration order always keeps multiple entries with the same key * together. Any creation method that would customarily respect insertion order (such as {@link
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 24.7K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
dLimbs := d.limbs[:size] mLimbs := m.nat.limbs[:size] // Each iteration of this loop computes x = 2x + b mod m, where b is a bit // from y. Effectively, it left-shifts x and adds y one bit at a time, // reducing it every time. // // To do the reduction, each iteration computes both 2x + b and 2x + b - m. // The next iteration (and finally the return line) will use either result // based on whether 2x + b overflows m.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
guava/src/com/google/common/collect/Lists.java
* cartesian product is constructed, the input lists are merely copied. Only as the resulting list * is iterated are the individual lists created, and these are not retained after iteration. * * @param lists the lists to choose elements from, in the order that the elements chosen from * those lists should appear in the resulting lists
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 16:48:36 UTC 2024 - 41.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/stmt.go
switch { case k == nil: count = "no iteration variables" case v == nil: count = "one iteration variable" default: count = "two iteration variables" } check.softErrorf(&x, InvalidIterVar, "range over %s must have %s", &x, count) } key, val = k, v } // Open the for-statement block scope now, after the range clause.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.7K bytes - Viewed (0) -
src/internal/concurrent/hashtriemap.go
// We specifically break this out so that we can use defer here safely. // One option is to break this out into a new function instead, but // there's so much local iteration state used below that this turns out // to be cleaner. defer i.mu.Unlock() var oldEntry *entry[K, V] if n != nil { oldEntry = n.entry() if v, ok := oldEntry.lookup(key, ht.keyEqual); ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 16:01:55 UTC 2024 - 11.8K bytes - Viewed (0) -
src/go/types/stmt.go
switch { case k == nil: count = "no iteration variables" case v == nil: count = "one iteration variable" default: count = "two iteration variables" } check.softErrorf(&x, InvalidIterVar, "range over %s must have %s", &x, count) } key, val = k, v } // Open the for-statement block scope now, after the range clause.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeMap.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 21.9K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheBuilder.java
* entries may be counted in {@link Cache#size}, but will never be visible to read or write * operations. * * <p>Certain cache configurations will result in the accrual of periodic maintenance tasks which * will be performed during write operations, or during occasional read operations in the absence of * writes. The {@link Cache#cleanUp} method of the returned cache will also perform maintenance, but
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 44.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
* described in the class documentation. * * @throws NullPointerException if any of {@code elements} is null * @since 6.0 */ public static <E> ImmutableMultiset<E> copyOf(E[] elements) { return copyFromElements(elements); } /** * Returns an immutable multiset containing the given elements, in the "grouped iteration order"
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.5K bytes - Viewed (0)