- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 532 for Indexes (0.15 sec)
-
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 10.2K bytes - Viewed (0) -
samples/bookinfo/src/productpage/static/tailwind/tailwind.css
.end=this.source.end||{},Object.assign(this.source.end,this.last.source.end))},t.each=function(n){this.lastEach||(this.lastEach=0),this.indexes||(this.indexes={}),this.lastEach++;var a=this.lastEach;if(this.indexes[a]=0,!!this.length){for(var s,o;this.indexes[a]<this.length&&(s=this.indexes[a],o=n(this.at(s),s),o!==!1);)this.indexes[a]+=1;if(delete this.indexes[a],o===!1)return!1}},t.walk=function(n){return this.each(function(a,s){var o=n(a,s);if(o!==!1&&a.length&&(o=a.walk(n)),o===!1)return!1})...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 28 14:48:01 UTC 2024 - 357.1K bytes - Viewed (1) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// full 16 byte block. CMPBNE R3, $16, 2(PC) VLEIB $12, $1, M_4 // Finally, set up the coefficients for the final multiplication. // We have previously saved r and 5r in the 32-bit even indexes // of the R_[0-4] and R5_[1-4] coefficient registers. // // We want lane 0 to be multiplied by r² so that can be kept the // same. We want lane 1 to be multiplied by r so we need to move
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
// See the comment at the top of regalloc.go and in deadcode for details. if f.RegAlloc != nil { for i := range live { live[i] = true } return } // Record all the inline indexes we need var liveInlIdx map[int]bool pt := f.Config.ctxt.PosTable for _, b := range f.Blocks { for _, v := range b.Values { i := pt.Pos(v.Pos).Base().InliningIndex() if i < 0 { continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K bytes - Viewed (0) -
src/runtime/error.go
type boundsError struct { x int64 y int // Values in an index or slice expression can be signed or unsigned. // That means we'd need 65 bits to encode all possible indexes, from -2^63 to 2^64-1. // Instead, we keep track of whether x should be interpreted as signed or unsigned. // y is known to be nonnegative and to fit in an int. signed bool code boundsErrorCode }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 19:10:41 UTC 2024 - 9.9K bytes - Viewed (0) -
android/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 - 23.1K bytes - Viewed (0) -
JavadocStyleGuide.md
This fragment is very important: it is the only part of the text that appears in certain contexts such as class and method indexes: ```java /** * Returns an Image object that can then be painted on the screen. */ ``` ## 1.3 Code blocks and snippets `<pre>` is the default HTML tag for preformatted text.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jun 06 15:43:07 UTC 2024 - 11.5K bytes - Viewed (0) -
src/sync/poolqueue.go
// but not typically a property considered in the literature. type poolDequeue struct { // headTail packs together a 32-bit head index and a 32-bit // tail index. Both are indexes into vals modulo len(vals)-1. // // tail = index of oldest data in queue // head = index of next slot to fill // // Slots in the range [tail, head) are owned by consumers.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 18:12:29 UTC 2024 - 8.3K bytes - Viewed (0) -
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)