- Sort Score
- Result 10 results
- Languages All
Results 11 - 18 of 18 for zsqr (0.08 sec)
-
src/math/big/ratconv.go
var t, r nat // temporaries for { if _, r = t.div(r, q, f); len(r) != 0 { break // f doesn't divide q evenly } tab = append(tab, f) f = nat(nil).sqr(f) // nat(nil) to ensure a new f for each table entry } // Factor q using the table entries, if any. // We start with the largest factor f = tab[len(tab)-1] // that evenly divides q. It does so at most once because
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/natconv.go
for i := 0; i < k; i++ { if table[i].ndigits == 0 { if i == 0 { table[0].bbb = nat(nil).expWW(bb, Word(leafSize)) table[0].ndigits = ndigits * leafSize } else { table[i].bbb = nat(nil).sqr(table[i-1].bbb) table[i].ndigits = 2 * table[i-1].ndigits } // optimization: exploit aggregated extra bits in macro blocks larger = nat(nil).set(table[i].bbb)
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/int.go
// Mul sets z to the product x*y and returns z. func (z *Int) Mul(x, y *Int) *Int { // x * y == x * y // x * (-y) == -(x * y) // (-x) * y == -(x * y) // (-x) * (-y) == x * y if x == y { z.abs = z.abs.sqr(x.abs) z.neg = false return z } z.abs = z.abs.mul(x.abs, y.abs) z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign return z } // MulRange sets z to the product of all integers
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_asm_ppc64le.s
MOVD $32, R17 MOVD $p256mul<>+0x00(SB), CPOOL LXVD2X (R0)(x_ptr), X0 LXVD2X (R16)(x_ptr), X1 XXPERMDI X0, X0, $2, X0 XXPERMDI X1, X1, $2, X1 sqrLoop: // Sqr uses same value for both VOR X0, X0, Y0 VOR X1, X1, Y1 LXVD2X (R16)(CPOOL), P1 LXVD2X (R0)(CPOOL), P0 CALL p256MulInternal<>(SB) MOVD n+16(FP), N ADD $-1, N
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 56.5K bytes - Viewed (0) -
src/math/big/float.go
// and y which is often the case (e.g., if all floats // have the same precision). // TODO(gri) Optimize this for the common case. e := int64(x.exp) + int64(y.exp) if x == y { z.mant = z.mant.sqr(x.mant) } else { z.mant = z.mant.mul(x.mant, y.mant) } z.setExpAndRound(e-fnorm(z.mant), 0) } // z = x / y, ignoring signs of x and y for the division
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
doc/go1.17_spec.html
expression: </p> <pre> var a, b, c = f() + v(), g(), sqr(u()) + v() func f() int { return c } func g() int { return a } func sqr(x int) int { return x*x } // functions u and v are independent of all other variables and functions </pre> <p> The function calls happen in the order <code>u()</code>, <code>sqr()</code>, <code>v()</code>,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 11 20:22:45 UTC 2024 - 211.6K bytes - Viewed (0) -
doc/go_spec.html
expression: </p> <pre> var a, b, c = f() + v(), g(), sqr(u()) + v() func f() int { return c } func g() int { return a } func sqr(x int) int { return x*x } // functions u and v are independent of all other variables and functions </pre> <p> The function calls happen in the order <code>u()</code>, <code>sqr()</code>, <code>v()</code>,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 21:07:21 UTC 2024 - 281.5K bytes - Viewed (1) -
src/regexp/testdata/re2-exhaustive.txt.bz2
H � H�XW�o^�O^��g���f�̹[45M������JD��,�������d!FG�CnZR��$�����(��*�K%�$KC ��+e[Q��wVq}|�? �������{\U��0��� 7��#k 5��-������Y���k 5�� �k�p%��3�K3�{3z�]� 4 �pI 4�A� 4�pA� 4 �pI 4�A� \�g�������{3-v�s3�gb^"���2��;� �%sQr;������>Ky���E�I��Ld����v0�L���$oL%��$������&�? ~� [j� I6 gu�Wm� &�_��T�m4�v��+�c�oY��{�����pA� 4�pI$ �pI 4 �pA� 4�pI$ ��� �IJ�F�m�۔��I���I�@I ��,��F�-��F�-��F�-��F�-��F�Y��H8�������o�����1�����X�rccR�e�h /$�s^...
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 13 14:52:20 UTC 2021 - 418.2K bytes - Viewed (0)