- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 170 for linear_1 (0.34 sec)
-
src/reflect/type.go
j = h // preserves f(j) == true } } // i == j, f(i-1) == false, and f(j) (= f(i)) == true => answer is i. // Having found the first, linear scan forward to find the last. // We could do a second binary search, but the caller is going // to do a linear scan anyway. for j := i; j < len(offs); j++ { typ := rtypeOff(section, offs[j]) if stringFor(typ) != s { break }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 85.5K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/css/manual.css
.admonitionblock td.content { word-wrap: anywhere; background: var(--admonition-background); padding: 1rem 1rem 1rem 1rem; width: 100%; border-radius: 4px; } .admonitionblock td.icon { background: linear-gradient(90deg, rgba(0, 0, 0, .2) 0, rgba(0, 0, 0, .2)) no-repeat 0 /2.075em 100%; border-radius: .5em; font-size: calc(15/var(--rem-base)*1rem); left: 0; line-height: 1; padding: .25em .075em;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat May 25 05:15:02 UTC 2024 - 72.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Register allocation. // // We use a version of a linear scan register allocator. We treat the // whole function as a single long basic block and run through // it using a greedy register allocator. Then all merge edges // (those targeting a block with len(Preds)>1) are processed to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/strconv/eisel_lemire.go
// // - 1e43 ≈ (0xE596B7B0_C643C719 * (2 ** 79)) // - 1e43 = (0xE596B7B0_C643C719_6D9CCD05_D0000000 * (2 ** 15)) // // The mantissas are explicitly listed. The exponents are implied by a linear // expression with slope 217706.0/65536.0 ≈ log(10)/log(2). // // The table was generated by // https://github.com/google/wuffs/blob/ba3818cb6b473a2ed0b38ecfc07dbbd3a97e8ae7/script/print-mpb-powers-of-10.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 41.4K bytes - Viewed (0) -
cluster/log-dump/log-dump.sh
# does not run on Windows nodes. # # Note: This step is O(#nodes^2) as we check if each node is present in the list of succeeded nodes. # Making it linear would add code complexity without much benefit (as it just takes ~1s for 5k nodes). # Assumes: # NODE_NAMES # Sets: # NON_LOGEXPORTED_NODES function find_non_logexported_nodes() {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 21:15:57 UTC 2024 - 28.9K bytes - Viewed (0) -
src/main/webapp/css/admin/font-awesome.min.css
l-left,.fal.fa-pull-left,.far.fa-pull-left,.fas.fa-pull-left{margin-right:.3em}.fa.fa-pull-right,.fab.fa-pull-right,.fal.fa-pull-right,.far.fa-pull-right,.fas.fa-pull-right{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(1turn);tran...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/schema/schema_v3b.fbs
union QuantizationDetails { CustomQuantization, } // Parameters for converting a quantized tensor back to float. table QuantizationParameters { // These four parameters are the asymmetric linear quantization parameters. // Given a quantized value q, the corresponding float value f should be: // f = scale * (q - zero_point) // For other quantization types, the QuantizationDetails below is used.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 14:28:27 UTC 2024 - 30K bytes - Viewed (0) -
src/main/webapp/css/font-awesome.min.css
l-left,.fal.fa-pull-left,.far.fa-pull-left,.fas.fa-pull-left{margin-right:.3em}.fa.fa-pull-right,.fab.fa-pull-right,.fal.fa-pull-right,.far.fa-pull-right,.fas.fa-pull-right{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(1turn);tran...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (0) -
src/debug/dwarf/line.go
// returns [ErrUnknownPC]. In this case, *entry and the final seek // position are unspecified. // // Note that DWARF line tables only permit sequential, forward scans. // Hence, in the worst case, this takes time linear in the size of the // line table. If the caller wishes to do repeated fast PC lookups, it // should build an appropriate index of the line table. func (r *LineReader) SeekPC(pc uint64, entry *LineEntry) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 23.5K bytes - Viewed (0) -
src/runtime/iface.go
if cheaprand()&uint32(oldC.Mask) != 0 { // As cache gets larger, choose to update it less often // so we can amortize the cost of building a new cache // (that cost is linear in oldc.Mask). return case_, tab } // Make a new cache. newC := buildInterfaceSwitchCache(oldC, t, case_, tab) // Update cache. Use compare-and-swap so if multiple threads
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 22.5K bytes - Viewed (0)