- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 2,143 for iterated (0.19 sec)
-
src/runtime/symtabinl.go
parentPc int32 // position of an instruction whose source position is the call site (offset from entry) startLine int32 // line number of start of function (func keyword/TEXT directive) } // An inlineUnwinder iterates over the stack of inlined calls at a PC by // decoding the inline table. The last step of iteration is always the frame of // the physical function, so there's always at least one frame. // // This is typically used as: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 4.5K bytes - Viewed (0) -
src/runtime/mpagealloc_32bit.go
} // There isn't much. Just map it and mark it as used immediately. sysMap(reservation, totalSize, p.sysStat) sysUsed(reservation, totalSize, totalSize) p.summaryMappedReady += totalSize // Iterate over the reservation and cut it up into slices. // // Maintain i as the byte offset from reservation where // the new slice should start. for l, shift := range levelShift { entries := 1 << (heapAddrBits - shift)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 20 20:08:25 UTC 2023 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/base/Optional.java
return new Iterable<T>() { @Override public Iterator<T> iterator() { return new AbstractIterator<T>() { private final Iterator<? extends Optional<? extends T>> iterator = checkNotNull(optionals.iterator()); @Override @CheckForNull protected T computeNext() { while (iterator.hasNext()) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 14.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMap.java
* convenient. * * <p>By default, a {@code Builder} will generate maps that iterate over entries in the order they * were inserted into the builder, equivalently to {@code LinkedHashMap}. For example, in the * above example, {@code WORD_TO_INT.entrySet()} is guaranteed to iterate over the entries in the * order {@code "one"=1, "two"=2, "three"=3}, and {@code keySet()} and {@code values()} respect
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 30 14:39:16 UTC 2024 - 44.6K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/repositories/transport/RepositoryTransportFactory.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Mar 25 14:54:57 UTC 2024 - 11.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/RangeMap.java
/** * Returns a view of this range map as an unmodifiable {@code Map<Range<K>, V>}. Modifications to * this range map are guaranteed to read through to the returned {@code Map}. * * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the * {@code Range} entries. * * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}. */ Map<Range<K>, V> asMapOfRanges();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
Comparator<? super E> comparator, Iterator<? extends E> elements) { return new Builder<E>(comparator).addAll(elements).build(); } /** * Returns an immutable sorted set containing the given elements sorted by the given {@code * Comparator}. When multiple elements are equivalent according to {@code compare()}, only the * first one specified is included. This method iterates over {@code elements} at most once. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 36.8K bytes - Viewed (0) -
pkg/registry/core/service/ipallocator/ipallocator.go
default: offset = uint64(a.rand.Int63n(int64(rangeSize))) } iterator := ipIterator(a.offsetAddress, a.lastAddress, offset) ip, err := a.allocateFromRange(iterator, svc) if err == nil { return ip, nil } // check the lower range if a.rangeOffset != 0 { offset = uint64(a.rand.Intn(a.rangeOffset)) iterator = ipIterator(a.firstAddress, a.offsetAddress.Prev(), offset)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache.cc
finish += block_size_; } size_t total_bytes_transferred = 0; // Now iterate through the blocks, reading them one at a time. for (size_t pos = start; pos < finish; pos += block_size_) { Key key = std::make_pair(filename, pos); // Look up the block, fetching and inserting it if necessary, and update the // LRU iterator for the key and block. std::shared_ptr<Block> block = Lookup(key); if (!block) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jul 16 01:39:09 UTC 2020 - 11.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} } } /** * Returns an iterator over the elements contained in this collection, <i>in no particular * order</i>. * * <p>The iterator is <i>fail-fast</i>: If the MinMaxPriorityQueue is modified at any time after * the iterator is created, in any way except through the iterator's own remove method, the * iterator will generally throw a {@link ConcurrentModificationException}. Thus, in the face of
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (1)