- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,402 for Fill (0.14 sec)
-
android/guava/src/com/google/common/collect/EnumMultiset.java
distinctElements++; } else if (oldCount > 0 && count == 0) { distinctElements--; } return oldCount; } @Override public void clear() { Arrays.fill(counts, 0); size = 0; distinctElements = 0; } abstract class Itr<T> implements Iterator<T> { int index = 0; int toRemove = -1; abstract T output(int index);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Huffman.kt
children[childIndex] = child } node = child } val shift = 8 - accumulatorBitCount val start = (code shl shift) and 0xff val end = 1 shl shift node.children!!.fill(terminal, start, start + end) } private class Node { /** Null if terminal. */ val children: Array<Node?>? /** Terminal nodes have a symbol. */ val symbol: Int
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one * permutation, instead of two. This is why the elements have to implement {@link Comparable}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
tensorflow/c/eager/gradient_checker.cc
// If the output is a scalar, then return the scalar output if (num_dims_out == 0) { outputs[0] = model_out.release(); return absl::OkStatus(); } // Else, reduce sum the output to get a scalar // Will sum all dimensions, so get a Tensor containing [0,...,num_dims_out-1]. AbstractTensorHandlePtr sum_dims; { vector<int32_t> vals(num_dims_out); int64_t vals_shape[] = {num_dims_out};
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 7.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
} @Override public void clear() { if (needsAllocArrays()) { return; } this.firstEntry = ENDPOINT; this.lastEntry = ENDPOINT; if (links != null) { Arrays.fill(links, 0, size(), 0); } super.clear(); } /* * For discussion of the safety of the following methods, see the comments near the end of * CompactHashMap. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
delegate.clear(); // invalidate any iterators left over! table = null; size = 0; } else { Arrays.fill(requireElements(), 0, size, null); CompactHashing.tableClear(requireTable()); Arrays.fill(requireEntries(), 0, size, 0); this.size = 0; } } @J2ktIncompatible private void writeObject(ObjectOutputStream stream) throws IOException {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
guava/src/com/google/common/collect/EnumMultiset.java
distinctElements++; } else if (oldCount > 0 && count == 0) { distinctElements--; } return oldCount; } @Override public void clear() { Arrays.fill(counts, 0); size = 0; distinctElements = 0; } abstract class Itr<T> implements Iterator<T> { int index = 0; int toRemove = -1; abstract T output(int index);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9.3K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Http2.kt
FLAGS[prefixFlag or frameFlag or FLAG_PADDED] = FLAGS[prefixFlag] + '|'.toString() + FLAGS[frameFlag] + "|PADDED" } } for (i in FLAGS.indices) { // Fill in holes with binary representation. if (FLAGS[i] == null) FLAGS[i] = BINARY[i] } } /** * Returns a human-readable representation of HTTP/2 frame headers. * * The format is: *
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} @Override public void clear() { if (needsAllocArrays()) { return; } this.firstEntry = ENDPOINT; this.lastEntry = ENDPOINT; if (links != null) { Arrays.fill(links, 0, size(), 0); } super.clear(); } /* * For discussion of the safety of the following methods, see the comments near the end of * CompactHashMap. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
cmd/erasure-decode.go
readerToBuf: r2b, stashBuffer: b, } } // Done will release any resources used by the parallelReader. func (p *parallelReader) Done() { if p.stashBuffer != nil { globalBytePoolCap.Load().Put(p.stashBuffer) p.stashBuffer = nil } } // preferReaders can mark readers as preferred. // These will be chosen before others. func (p *parallelReader) preferReaders(prefer []bool) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 16:44:59 GMT 2024 - 9.4K bytes - Viewed (0)