- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 130 for multiplication (0.21 sec)
-
test/torture.go
} // A right-leaning tree of byte multiplications. func righttree(a, b, c, d uint8) uint8 { return a * (b * (c * (d * (a * (b * (c * (d * (a * (b * (c * (d * (a * (b * (c * (d * (a * (b * (c * (d * a * (b * (c * d))))))))))))))))))))) } // A left-leaning tree of byte multiplications. func lefttree(a, b, c, d uint8) uint8 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jul 01 07:20:51 UTC 2014 - 7.7K bytes - Viewed (0) -
src/crypto/internal/nistec/p224_sqrt.go
} else { p224GG[i].Square(&p224GG[i-1]) } } }) // r <- x^((q+1)/2) = x^(2^127) // v <- x^q = x^(2^128-1) // Compute x^(2^127-1) first. // // The sequence of 10 multiplications and 126 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 3.1K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.29.md
- Added container filesystem to the `ImageFsInfoResponse`. ([#120914](https://github.com/kubernetes/kubernetes/pull/120914), [@kannon92](https://github.com/kannon92)) - Added multiplication functionality to `Quantity`. ([#117411](https://github.com/kubernetes/kubernetes/pull/117411), [@tenzen-y](https://github.com/tenzen-y))
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 03:42:38 UTC 2024 - 324.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
things I used to know. Let me see: four times five is twelve, and four times six is thirteen, and four times seven is--oh dear! I shall never get to twenty at that rate! However, the Multiplication Table doesn't signify: let's try Geography. London is the capital of Paris, and Paris is the capital of Rome, and Rome--no, THAT'S all wrong, I'm certain! I must have been
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Apr 21 02:27:51 UTC 2017 - 145.2K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/generate.go
// // If x == 0, Invert returns e = 0. func (e *Element) Invert(x *Element) *Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of {{ .Ops.Adds }} multiplications and {{ .Ops.Doubles }} squarings is derived from the // following addition chain generated with {{ .Meta.Module }} {{ .Meta.ReleaseTag }}. // {{- range lines (format .Script) }} // {{ . }} {{- end }} //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 9.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
things I used to know. Let me see: four times five is twelve, and four times six is thirteen, and four times seven is--oh dear! I shall never get to twenty at that rate! However, the Multiplication Table doesn't signify: let's try Geography. London is the capital of Paris, and Paris is the capital of Rome, and Rome--no, THAT'S all wrong, I'm certain! I must have been
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 29 21:35:03 UTC 2012 - 145.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf.cc
// Let v = [ 4 6 ]^T be the output gradient (^T = transposed). Then the // average pool gradient is given by // Df^T * v = [ 4/3 4/3 13/3 3 ]^T // Instead of a matrix-vector-multiplication we can utilize the sparsity and // structure of Df by using the 3-step approach from above: // 1. Divide output gradient v by window counts: [ 4/3 6/2 ]^T // 2. Add appropriate padding: [ 0 0 4/3 0 3 0 ]^T
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 291.8K bytes - Viewed (1) -
src/crypto/internal/edwards25519/scalar.go
// can interpret x as the sum of three shorter values a, b, and c. // // x = a + b * 2^168 + c * 2^336 mod l // // We then precompute 2^168 and 2^336 modulo l, and perform the reduction // with two multiplications and two additions. s.setShortBytes(x[:21]) t := new(Scalar).setShortBytes(x[21:42]) s.Add(s, t.Multiply(t, scalarTwo168)) t.setShortBytes(x[42:]) s.Add(s, t.Multiply(t, scalarTwo336))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 10.8K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
// // If z == 0, Invert returns v = 0. func (v *Element) Invert(z *Element) *Element { // Inversion is implemented as exponentiation with exponent p − 2. It uses the // same sequence of 255 squarings and 11 multiplications as [Curve25519]. var z2, z9, z11, z2_5_0, z2_10_0, z2_20_0, z2_50_0, z2_100_0, t Element z2.Square(z) // 2 t.Square(&z2) // 4 t.Square(&t) // 8
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
doc/go1.17_spec.html
outside the operator hierarchy. As a consequence, statement <code>*p++</code> is the same as <code>(*p)++</code>. </p> <p> There are five precedence levels for binary operators. Multiplication operators bind strongest, followed by addition operators, comparison operators, <code>&&</code> (logical AND), and finally <code>||</code> (logical OR): </p> <pre class="grammar">
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 11 20:22:45 UTC 2024 - 211.6K bytes - Viewed (0)