- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,055 for ctmp (0.11 sec)
-
test/codegen/issue58166.go
for i := 0; i < m; i++ { ctmp := c[i*ldc : i*ldc+n] for l, v := range a[i*lda : i*lda+k] { tmp := alpha * v if tmp != 0 { x := b[l*ldb : l*ldb+n] // amd64:"INCQ" for i, v := range x { ctmp[i] += tmp * v } } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 01 18:41:07 UTC 2023 - 554 bytes - Viewed (0) -
src/path/filepath/path_windows_test.go
} } testPath := `{{tmp}}\test\foo\bar` testsDir := []struct { wd string arg string want string }{ // test absolute paths {".", `{{tmp}}\test\foo\bar`, `{{tmp}}\test\foo\bar`}, {".", `{{tmp}}\.\test/foo\bar`, `{{tmp}}\test\foo\bar`}, {".", `{{tmp}}\test\..\test\foo\bar`, `{{tmp}}\test\foo\bar`}, {".", `{{tmp}}\TEST\FOO\BAR`, `{{tmp}}\test\foo\bar`},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 20:38:54 UTC 2024 - 19.6K bytes - Viewed (0) -
src/cmp/cmp.go
// Copyright 2023 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. // Package cmp provides types and functions related to comparing // ordered values. package cmp // Ordered is a constraint that permits any ordered type: any type // that supports the operators < <= >= >. // If future releases of Go add new ordered types,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 19 16:31:02 UTC 2024 - 2K bytes - Viewed (0) -
src/cmp.bash
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 20 18:03:31 UTC 2023 - 1.5K bytes - Viewed (0) -
test/cmp.go
Aaron Jacobs <******@****.***> 1435103412 +1000
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 26 03:38:21 UTC 2015 - 7.6K bytes - Viewed (0) -
src/image/jpeg/scan.go
// The h0, mxx, by and bx variables have the same meaning as in the // processSOS method. h0 := d.comp[0].h mxx := (d.width + 8*h0 - 1) / (8 * h0) for i := 0; i < d.nComp; i++ { if d.progCoeffs[i] == nil { continue } v := 8 * d.comp[0].v / d.comp[i].v h := 8 * d.comp[0].h / d.comp[i].h stride := mxx * d.comp[i].h for by := 0; by*v < d.height; by++ { for bx := 0; bx*h < d.width; bx++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0) -
src/image/jpeg/reader.go
d.comp[i].c = d.tmp[6+3*i] // Section B.2.2 states that "the value of C_i shall be different from // the values of C_1 through C_(i-1)". for j := 0; j < i; j++ { if d.comp[i].c == d.comp[j].c { return FormatError("repeated component identifier") } } d.comp[i].tq = d.tmp[8+3*i] if d.comp[i].tq > maxTq { return FormatError("bad Tq value") } hv := d.tmp[7+3*i]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 22.5K bytes - Viewed (0) -
src/runtime/memmove_ppc64x.s
lt8: // Move word if possible CMP BYTES, $4 BLT lt4 MOVWZ 0(SRC), TMP ADD $-4, BYTES MOVW TMP, 0(TGT) ADD $4, SRC ADD $4, TGT lt4: // Move halfword if possible CMP BYTES, $2 BLT lt2 MOVHZ 0(SRC), TMP ADD $-2, BYTES MOVH TMP, 0(TGT) ADD $2, SRC ADD $2, TGT lt2: // Move last byte if 1 left CMP BYTES, $1 BC 12, 0, LR // ble lr MOVBZ 0(SRC), TMP MOVBZ TMP, 0(TGT) RET
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 21 16:47:45 UTC 2023 - 4.9K bytes - Viewed (0) -
src/runtime/memmove_arm.s
AND.S $3, FROM, TMP BNE _bunaligned ADD $31, TS, TMP /* do 32-byte chunks if possible */ MOVW TS, savedts-4(SP) _b32loop: CMP TMP, TE BLS _b4tail MOVM.DB.W (FROM), [R0-R7] MOVM.DB.W [R0-R7], (TE) B _b32loop _b4tail: /* do remaining words if possible */ MOVW savedts-4(SP), TS ADD $3, TS, TMP _b4loop: CMP TMP, TE BLS _b1tail MOVW.W -4(FROM), TMP1 /* pre-indexed */
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 04 07:25:06 UTC 2020 - 5.9K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/files/sampleJavaProject/kotlin/src/dist/index.html.tmp
Laura Kassovic <******@****.***> 1701107622 -0800
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - Viewed (0)