- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 463 for iterations (0.17 sec)
-
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: Wed May 08 03:01:02 UTC 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
return (Multiset<T>) iterable; } /** * Returns a copy of {@code multiset} as an {@link ImmutableMultiset} whose iteration order puts * the highest count first, with ties broken by the iteration order of the original multiset. * * @since 11.0 */ public static <E> ImmutableMultiset<E> copyHighestCountFirst(Multiset<E> multiset) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 41.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterables.java
checkNotNull(iterable); Iterators.checkNonnegative(position); if (iterable instanceof List) { List<? extends T> list = Lists.cast(iterable); return (position < list.size()) ? list.get(position) : defaultValue; } else { Iterator<? extends T> iterator = iterable.iterator(); Iterators.advance(iterator, position); return Iterators.getNext(iterator, defaultValue); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 24 19:38:27 UTC 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
checkNotNull(iterable); Iterators.checkNonnegative(position); if (iterable instanceof List) { List<? extends T> list = Lists.cast(iterable); return (position < list.size()) ? list.get(position) : defaultValue; } else { Iterator<? extends T> iterator = iterable.iterator(); Iterators.advance(iterator, position); return Iterators.getNext(iterator, defaultValue); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 24 19:38:27 UTC 2024 - 42.8K bytes - Viewed (0) -
android/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 - 24K bytes - Viewed (0) -
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) -
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) -
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)