- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for utod (0.07 sec)
-
src/time/format.go
u = uint(-x) } // 2-digit and 4-digit fields are the most common in time formats. utod := func(u uint) byte { return '0' + byte(u) } switch { case width == 2 && u < 1e2: return append(b, utod(u/1e1), utod(u%1e1)) case width == 4 && u < 1e4: return append(b, utod(u/1e3), utod(u/1e2%1e1), utod(u/1e1%1e1), utod(u%1e1)) } // Compute the number of decimal digits. var n int if u == 0 { n = 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 17:09:28 UTC 2024 - 49.3K bytes - Viewed (0) -
src/crypto/internal/boring/build-goboring.sh
} u128 __udivti3(u128 x, u128 y) { return div(x, y, 0); } EOF extra="" case $GOARCH in amd64) cp umod-amd64.s umod.s clang -c -o umod.o umod.s extra=umod.o ;; arm64) cp umod-arm64.c umod.c clang -c -o umod.o umod.c extra=umod.o ;; esac # Prepare copy of libcrypto.a with only the checked functions renamed and exported.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 26 22:52:27 UTC 2024 - 5.6K bytes - Viewed (0) -
src/math/big/nat_test.go
var q, r nat q, r = q.div(r, x, b) if q.cmp(a) != 0 { t.Fatalf("wrong quotient: got %s; want %s for %s/%s", q.utoa(10), a.utoa(10), x.utoa(10), b.utoa(10)) } if r.cmp(c) != 0 { t.Fatalf("wrong remainder: got %s; want %s for %s/%s", r.utoa(10), c.utoa(10), x.utoa(10), b.utoa(10)) } } } } // TestIssue37499 triggers the edge case of divBasic where
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 09 15:29:36 UTC 2024 - 26.2K bytes - Viewed (0) -
src/cmd/compile/internal/test/testdata/gen/arithBoundaryGen.go
panic(err) } } } // generate the test data for _, s := range szs { if len(s.u) > 0 { fmt.Fprintf(w, "var %s_data []utd%s = []utd%s{", s.name, s.sn, s.sn) for _, i := range s.u { for _, j := range s.u { fmt.Fprintf(w, "utd%s{a: %d, b: %d, add: %d, sub: %d, mul: %d", s.sn, i, j, ucast(i+j, s), ucast(i-j, s), ucast(i*j, s)) if j != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 20 02:13:02 UTC 2022 - 5.5K bytes - Viewed (0) -
src/math/big/ftoa.go
m := x.mant switch w := uint32(len(x.mant)) * _W; { case w < x.prec: m = nat(nil).shl(m, uint(x.prec-w)) case w > x.prec: m = nat(nil).shr(m, uint(w-x.prec)) } buf = append(buf, m.utoa(10)...) buf = append(buf, 'p') e := int64(x.exp) - int64(x.prec) if e >= 0 { buf = append(buf, '+') } return strconv.AppendInt(buf, e, 10) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
src/math/big/natconv.go
if dp >= 0 { // 0 <= dp <= count count = dp - count } return } // utoa converts x to an ASCII representation in the given base; // base must be between 2 and MaxBase, inclusive. func (x nat) utoa(base int) []byte { return x.itoa(false, base) } // itoa is like utoa but it prepends a '-' if neg && x != 0. func (x nat) itoa(neg bool, base int) []byte { if base < 2 || base > MaxBase {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 14.6K bytes - Viewed (0) -
src/math/big/intconv.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 6.7K bytes - Viewed (0) -
src/math/big/ratconv.go
q = nat(nil).add(q, natOne) r = nat(nil).sub(r, p) } } if x.a.neg { buf = append(buf, '-') } buf = append(buf, q.utoa(10)...) // itoa ignores sign if q == 0 if prec > 0 { buf = append(buf, '.') rs := r.utoa(10) for i := prec - len(rs); i > 0; i-- { buf = append(buf, '0') } buf = append(buf, rs...) } return string(buf) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 12.3K bytes - Viewed (0) -
src/math/big/arith_test.go
testShiftFunc(t, shrVU, arg) } } func TestIssue31084(t *testing.T) { // compute 10^n via 5^n << n. const n = 165 p := nat(nil).expNN(nat{5}, nat{n}, nil, false) p = p.shl(p, n) got := string(p.utoa(10)) want := "1" + strings.Repeat("0", n) if got != want { t.Errorf("shl(%v, %v)\n\tgot %s\n\twant %s", p, n, got, want) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 19.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/ARM64.rules
// In fact, UMOD will be translated into UREM instruction, and UREM is originally translated into // UDIV and MSUB instructions. But if there is already an identical UDIV instruction just before or // after UREM (case like quo, rem := z/y, z%y), then the second UDIV instruction becomes redundant. // The purpose of this rule is to have this extra UDIV instruction removed in CSE pass.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 113.1K bytes - Viewed (0)