- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 2,143 for iterated (0.14 sec)
-
subprojects/core/src/main/java/org/gradle/api/internal/file/archive/ZipFileTree.java
// The iteration order of zip.getEntries() is based on the hash of the zip entry. This isn't much use // to us. So, collect the entries in a map and iterate over them in alphabetical order. Iterator<ZipArchiveEntry> sortedEntries = entriesSortedByName(zip); while (!stopFlag.get() && sortedEntries.hasNext()) { ZipArchiveEntry entry = sortedEntries.next();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Mar 26 15:15:04 UTC 2024 - 6.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConsumingQueueIterator.java
import java.util.Queue; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * An Iterator implementation which draws elements from a queue, removing them from the queue as it * iterates. This class is not thread safe. */ @GwtCompatible @ElementTypesAreNonnullByDefault final class ConsumingQueueIterator<T extends @Nullable Object> extends AbstractIterator<T> {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Jan 21 14:48:03 UTC 2023 - 1.5K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/conflicts/VersionConflictResolutionDetails.java
} @Override public String getDisplayName() { StringBuilder sb = new StringBuilder(16 + 16 * candidates.size()); sb.append("between versions "); Iterator<? extends ComponentResolutionState> it = candidates.iterator(); boolean more = false; while (it.hasNext()) { ComponentResolutionState next = it.next(); if (more) { if (it.hasNext()) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 6K bytes - Viewed (0) -
platforms/core-runtime/build-operations/src/main/java/org/gradle/internal/operations/DefaultBuildOperationListenerManager.java
public class DefaultBuildOperationListenerManager implements BuildOperationListenerManager { // This cannot be CopyOnWriteArrayList because we need to iterate it in reverse, // which requires atomically getting an iterator and the size. // Moreover, we iterate this list far more often that we mutate, // making a (albeit home grown) copy-on-write strategy more appealing.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 24 14:19:43 UTC 2023 - 5.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
} @Override public boolean isEmpty() { return !Iterables.any(unfiltered, predicate); } @Override public Iterator<E> iterator() { return Iterators.filter(unfiltered.iterator(), predicate); } @Override public Spliterator<E> spliterator() { return CollectSpliterators.filter(unfiltered.spliterator(), predicate); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
* added. The collections generated by {@link #entries()}, {@link #keys()}, and {@link #values} * iterate across the key-value mappings in the order they were added to the multimap. * * <p>The {@link #values()} and {@link #entries()} methods both return a {@code List}, instead of * the {@code Collection} specified by the {@link ListMultimap} interface. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/executor_tpuv1_island_coarsening.cc
// This is useful after fusing / reorganizing Operations in a block and later // needing to readjust the ordering to ensure dominance. LogicalResult SortTopologically(Block::iterator begin, Block::iterator end) { Block* block = begin->getBlock(); // Either sort from `begin` to end of block or both `begin` and // `end` should belong to the same block. assert(end == block->end() ||
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 17 17:58:54 UTC 2024 - 27.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
*/ @CanIgnoreReturnValue @Override public Builder<E> addAll(Iterator<? extends E> elements) { super.addAll(elements); return this; } /** * If the specified collection is backed by an ObjectCountHashMap, it will be much more * efficient to iterate over it by index rather than an entry iterator, which will need to * allocate an object for each entry, so we check for that.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedListMultimap.java
* added. The collections generated by {@link #entries()}, {@link #keys()}, and {@link #values} * iterate across the key-value mappings in the order they were added to the multimap. * * <p>The {@link #values()} and {@link #entries()} methods both return a {@code List}, instead of * the {@code Collection} specified by the {@link ListMultimap} interface. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.5K bytes - Viewed (0) -
test/typeparam/orderedmap.go
} return (*pn).val, true } // keyValue is a pair of key and value used while iterating. type keyValue[K, V any] struct { key K val V } // iterate returns an iterator that traverses the map. func (m *_Map[K, V]) Iterate() *_Iterator[K, V] { sender, receiver := _Ranger[keyValue[K, V]]() var f func(*node[K, V]) bool f = func(n *node[K, V]) bool { if n == nil { return true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 7.1K bytes - Viewed (0)