- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 130 for multiplication (0.18 sec)
-
src/math/big/nat_test.go
x := rndNat(50000) y := rndNat(40) allocSize := allocBytes(func() { nat(nil).mul(x, y) }) inputSize := uint64(len(x)+len(y)) * _S if ratio := allocSize / uint64(inputSize); ratio > 10 { t.Errorf("multiplication uses too much memory (%d > %d times the size of inputs)", allocSize, ratio) } } // rndNat returns a random nat value >= 0 of (usually) n words in length.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 09 15:29:36 UTC 2024 - 26.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/legalize_hlo_patterns.td
// Converts a dag of HLOs representing floor_div with a splat constant to // tf.FloorDiv. The pattern matched executes the following computation: // This particular pattern matches multiplication with the reciprocal of the // constant instead of dividing by the constant. // rem = remainder(arg0, cst) // for i in 0 to len(arg0): // rem[i] = (arg0[i] - rem[i]) * 1 / cst
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Feb 03 08:58:22 UTC 2024 - 34K bytes - Viewed (0) -
src/crypto/internal/nistec/p224.go
if len(scalar) != p224ElementLength { return nil, errors.New("invalid scalar length") } tables := p.generatorTable() // This is also a scalar multiplication with a four-bit window like in // ScalarMult, but in this case the doublings are precomputed. The value // [windowValue]G added at iteration k would normally get doubled
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 15.9K bytes - Viewed (0) -
src/crypto/internal/nistec/generate.go
if len(scalar) != {{.p}}ElementLength { return nil, errors.New("invalid scalar length") } tables := p.generatorTable() // This is also a scalar multiplication with a four-bit window like in // ScalarMult, but in this case the doublings are precomputed. The value // [windowValue]G added at iteration k would normally get doubled
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 19.7K bytes - Viewed (0) -
src/cmd/compile/internal/walk/convert.go
// n is a bool/byte. Use staticuint64s[n * 8] on little-endian // and staticuint64s[n * 8 + 7] on big-endian. n = cheapExpr(n, init) n = soleComponent(init, n) // byteindex widens n so that the multiplication doesn't overflow. index := ir.NewBinaryExpr(base.Pos, ir.OLSH, byteindex(n), ir.NewInt(base.Pos, 3)) if ssagen.Arch.LinkArch.ByteOrder == binary.BigEndian {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 09 17:28:22 UTC 2023 - 18.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/generic.rules
// Note, x%c == 0 is rewritten as x == c*(x/c) during the opt pass // where (x/c) is performed using multiplication with magic constants. // To rewrite x%c == 0 requires pattern matching the rewritten expression // and checking that the division by the same constant wasn't already calculated. // This check is made by counting uses of the magic constant multiplication. // Note that if there were an intermediate opt pass, this rule could be applied
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 22:21:05 UTC 2024 - 135.3K bytes - Viewed (0) -
src/math/big/float.go
z.form = zero z.neg = false return } // len(z.mant) > 0 z.setExpAndRound(ex+int64(len(z.mant))*_W-fnorm(z.mant), 0) } // z = x * y, ignoring signs of x and y for the multiplication // but using the sign of z for rounding the result. // x and y must have a non-empty mantissa and valid exponent. func (z *Float) umul(x, y *Float) { if debugFloat { validateBinaryOperands(x, y) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
src/crypto/aes/gcm_amd64.s
//go:build !purego // This is an optimized implementation of AES-GCM using AES-NI and CLMUL-NI // The implementation uses some optimization as described in: // [1] Gueron, S., Kounavis, M.E.: IntelĀ® Carry-Less Multiplication // Instruction and its Usage for Computing the GCM Mode rev. 2.02 // [2] Gueron, S., Krasnov, V.: Speeding up Counter Mode in Software and // Hardware #include "textflag.h" #define B0 X0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 23.4K bytes - Viewed (0) -
tensorflow/c/eager/c_api_unified_experimental_test.cc
TF_DeleteAbstractOp(add_op); // Extract the resulting tensor. add_output2 = TF_OutputListGet(add_outputs, 0); TF_DeleteOutputList(add_outputs); } // 3rd Output will be Matrix Multiplication of add_output1 and add_output2 TF_AbstractTensor* mm_output; { // Build an abstract operation, inputs and output. auto* mm_op = TF_NewAbstractOp(graph_ctx); TF_AbstractOpSetOpType(mm_op, "MatMul", s);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 19 21:44:52 UTC 2023 - 39.1K bytes - Viewed (0) -
tensorflow/cc/gradients/math_grad_test.cc
const bool t_x, const bool t_y, std::function<Output(Output, Output)> mul_fn) { TF_ASSERT_OK(root_.status()); // Generate random (but compatible) shapes for matrix multiplication. std::vector<TensorShape> shapes; RandMatMulShapes(is_x_batch, is_y_batch, t_x, t_y, &shapes); TensorShape x_shape = shapes[0]; TensorShape y_shape = shapes[1]; TensorShape z_shape = shapes[2];
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Aug 25 18:20:20 UTC 2023 - 36K bytes - Viewed (0)