- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 603 for Indexes (0.35 sec)
-
tensorflow/compiler/mlir/lite/stablehlo/transforms/hlo_matchers.cc
// StridedArrayView across a higher dimensional shape. // // The index `i` must be in [0, shape[axis])` where `shape` is the shape // of the tensor and `axis` is the axis along the tensor that the // StridedArrayView indexes along. int64_t OffsetForIndex(int64_t i) const { return offset_ + i * stride_; } private: // Calculates how many values to skip across a 1-D contiguous array that holds
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 11.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/cel/common/equality_test.go
// for instance due to map-list reordering. ExpectEqual bool // Schema to provide to the correlated object Schema common.Schema // Array of field names and indexes to traverse to get to the value KeyPath []interface{} // Root object to traverse from RootObject interface{} RootOldObject interface{} } func (c TestCase) Run() error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 13 21:36:46 UTC 2023 - 21.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/lower_static_tensor_list.cc
// function. llvm::SmallSet<int, 4> GetResizedTensorListIndexes( func::FuncOp func, const llvm::SmallSet<int, 4> &tensor_list_args) { // `indexes` stores the argument index of tensorlists which size may get // updated in the function. llvm::SmallSet<int, 4> indexes; for (BlockArgument &arg : func.getArguments()) { if (tensor_list_args.contains(arg.getArgNumber())) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 70.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/transform/transform.go
// The input string s is transformed in multiple chunks (starting with a // chunk size of initialBufSize). nDst and nSrc are per-chunk (or // per-Transform-call) indexes, pDst and pSrc are overall indexes. nDst, nSrc := 0, 0 pDst, pSrc := 0, 0 // pPrefix is the length of a common prefix: the first pPrefix bytes of the // result will equal the first pPrefix bytes of s. It is not guaranteed to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 21.7K bytes - Viewed (0) -
cmd/erasure-healing-common.go
// Erasure distribution seems to have lesser // number of items than number of online disks. inconsistent++ continue } if meta.Erasure.Distribution[i] != meta.Erasure.Index { // Mismatch indexes with distribution order inconsistent++ } } } erasureDistributionReliable := true if inconsistent > len(partsMetadata)/2 {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 12.5K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilter.java
*/ @Beta @ElementTypesAreNonnullByDefault public final class BloomFilter<T extends @Nullable Object> implements Predicate<T>, Serializable { /** * A strategy to translate T instances, to {@code numHashFunctions} bit indexes. * * <p>Implementations should be collections of pure functions (i.e. stateless). */ interface Strategy extends java.io.Serializable { /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.3K bytes - Viewed (0) -
src/go/doc/comment/text.go
// minimizing the sum of the squares of the leftover lengths // at the end of each line (except the last, of course), // with a preference for ending lines at punctuation (.,:;). // // The returned slice gives the indexes of the first words // on each line in the wrapped text with a final entry of len(words). // Thus the lines are words[seq[0]:seq[1]], words[seq[1]:seq[2]], // ..., words[seq[len(seq)-2]:seq[len(seq)-1]]. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 8.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/language/match.go
tt := tag.tag() pair, max := makeHaveTag(tt, i) if max != tt.LangID { m.header(max).addIfNew(pair, true) } } // update is used to add indexes in the map for equivalent languages. // update will only add entries to original indexes, thus not computing any // transitive relations. update := func(want, have uint16, conf Confidence) { if hh := m.index[language.Language(have)]; hh != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 25.1K bytes - Viewed (0) -
src/sort/sort.go
// is not a transitive ordering when not-a-number (NaN) values are involved. // See Float64Slice.Less for a correct implementation for floating-point values. Less(i, j int) bool // Swap swaps the elements with indexes i and j. Swap(i, j int) } // Sort sorts data in ascending order as determined by the Less method. // It makes one call to data.Len to determine n and O(n*log(n)) calls to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
transient @Nullable Object[] keys; /** The values of the entries in the map. */ transient int[] values; transient int size; transient int modCount; /** * The hashtable. Its values are indexes to the keys, values, and entries arrays. * * <p>Currently, the UNSET value means "null pointer", and any non negative value x is the actual * index. * * <p>Its size must be a power of two. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 01 22:07:10 UTC 2021 - 15K bytes - Viewed (0)