- Sort Score
- Result 10 results
- Languages All
Results 281 - 290 of 314 for Slow (0.04 sec)
-
doc/go_mem.html
That execution must be consistent with the <i>sequenced before</i> relation, defined as the partial order requirements set out by the <a href="/ref/spec">Go language specification</a> for Go's control flow constructs as well as the <a href="/ref/spec#Order_of_evaluation">order of evaluation for expressions</a>. </p> <p> A Go <i>program execution</i> is modeled as a set of goroutine executions,
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Aug 05 15:41:37 UTC 2025 - 26.6K bytes - Viewed (0) -
src/main/webapp/js/admin/popper.min.js.map
`-start` and `-end` when\n * the popper element overlaps its reference boundaries.\n *\n * The original placement should have a set variation.\n */\n flipVariationsByContent: false,\n },\n\n /**\n * Modifier used to make the popper flow toward the inner of the reference element.\n * By default, when this modifier is disabled, the popper will be placed outside\n * the reference element.\n * @memberof modifiers\n * @inner\n */\n inner: {\n /** @prop {number} order=700...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 120.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
/** * Contains the logical entries, in the range of [0, size()). The high bits of each int are the * part of the smeared hash of the key not covered by the hashtable mask, whereas the low bits are * the "next" pointer (pointing to the next entry in the bucket chain), which will always be less * than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 35.7K bytes - Viewed (0) -
src/bufio/bufio.go
b.fill() // buffer is not full } // Handle last byte, if any. if i := len(line) - 1; i >= 0 { b.lastByte = int(line[i]) b.lastRuneSize = -1 } return } // ReadLine is a low-level line-reading primitive. Most callers should use // [Reader.ReadBytes]('\n') or [Reader.ReadString]('\n') instead or use a [Scanner]. // // ReadLine tries to return a single line, not including the end-of-line bytes.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 22K bytes - Viewed (0) -
src/main/webapp/css/font-awesome.min.css
ore{content:"\f023"}.fa-lock-open:before{content:"\f3c1"}.fa-long-arrow-alt-down:before{content:"\f309"}.fa-long-arrow-alt-left:before{content:"\f30a"}.fa-long-arrow-alt-right:before{content:"\f30b"}.fa-long-arrow-alt-up:before{content:"\f30c"}.fa-low-vision:before{content:"\f2a8"}.fa-luggage-cart:before{content:"\f59d"}.fa-lyft:before{content:"\f3c3"}.fa-magento:before{content:"\f3c4"}.fa-magic:before{content:"\f0d0"}.fa-magnet:before{content:"\f076"}.fa-mail-bulk:before{content:"\f674"}.fa-mai...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (2) -
lib/fips140/v1.0.0.zip
:= 0; i < 2; i++ { word := y.high if i == 1 { word = y.low } // Multiplication works by multiplying z by 16 and adding in // one of the precomputed multiples of H. for j := 0; j < 64; j += 4 { msw := z.high & 0xf z.high >>= 4 z.high |= z.low << 60 z.low >>= 4 z.low ^= uint64(ghashReductionTable[msw]) << 48 // the values in |table| are ordered for little-endian bit // positions. See the comment in New. t := productTable[word&0xf] z.low ^= t.low z.high ^= t.high word >>= 4 } } *y = z } // updateBlocks...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
loName := p.next().String() lo, ok := p.arch.Register[loName] if !ok { if loName == "EOF" { p.errorf("register list: expected ']', found EOF") } else { p.errorf("register list: bad low register in `[%s`", loName) } return } if tok := p.next().ScanToken; tok != '-' { p.errorf("register list: expected '-' after `[%s`, found %s", loName, tok) return }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 37.3K bytes - Viewed (0) -
tensorflow/c/c_api.h
// the corresponding function's output will equal to this input, // instead of the original node's output. // // Callers must also satisfy the following constraints: // - `inputs` cannot refer to TF_Outputs within a control flow context. For // example, one cannot use the output of "switch" node as input. // - `inputs` and `outputs` cannot have reference types. Reference types are
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Thu Oct 26 21:08:15 UTC 2023 - 82.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/amd64enc_extra.s
VPGATHERQQ Y0, (R13)(Y1*1), Y2 // c4c2fd91540d00 VPGATHERQQ Y0, 16(R13)(Y1*1), Y2 // c4c2fd91540d10 VPGATHERQQ Y0, 512(R13)(Y1*1), Y2 // c4c2fd91940d00020000 // Test low-8 register for /is4 "hr" operand. VPBLENDVB X0, (BX), X1, X2 // c4e3714c1300 // <XMM0>/Yxr0 tests. SHA256RNDS2 X0, (BX), X2 // 0f38cb13 SHA256RNDS2 X0, (R11), X2 // 410f38cb13
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Thu Feb 20 11:20:03 UTC 2025 - 57.7K bytes - Viewed (0) -
cmd/bucket-handlers.go
xMinIOErrDescHeader = "x-minio-error-desc" postPolicyBucketTagging = "tagging" ) // Check if there are buckets on server without corresponding entry in etcd backend and // make entries. Here is the general flow // - Range over all the available buckets // - Check if a bucket has an entry in etcd backend // -- If no, make an entry // -- If yes, check if the entry matches local IP check if we //
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 63.9K bytes - Viewed (0)