- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 210 for x1 (0.03 sec)
-
guava/src/com/google/common/base/Throwables.java
* null}. */ @Deprecated @J2ktIncompatible @GwtIncompatible // propagateIfInstanceOf public static <X1 extends Throwable, X2 extends Throwable> void propagateIfPossible( @CheckForNull Throwable throwable, Class<X1> declaredType1, Class<X2> declaredType2) throws X1, X2 { checkNotNull(declaredType2); propagateIfInstanceOf(throwable, declaredType1);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 06 15:38:58 UTC 2024 - 20.6K bytes - Viewed (0) -
src/crypto/elliptic/elliptic_test.go
} byteLen := (curve.Params().BitSize + 7) / 8 b := make([]byte, 1+2*byteLen) b[0] = 4 // uncompressed point x.FillBytes(b[1 : 1+byteLen]) y.FillBytes(b[1+byteLen : 1+2*byteLen]) x1, y1 := Unmarshal(curve, b) if x1 != nil || y1 != nil { t.Errorf("unmarshaling a point not on the curve succeeded") } }) } func TestInfinity(t *testing.T) { t.Parallel() testAllCurves(t, testInfinity) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 27 02:00:03 UTC 2023 - 11.6K bytes - Viewed (0) -
tensorflow/compiler/jit/partially_decluster_pass.cc
} // Declusters nodes to reduce the number of times we think we need to recompile // a TensorFlow graph. // // Abstractly, if we have a cluster of this form: // // x0 = arg0 // x1 = arg1 // ... // shape = f(x0, x1, ...) // result = Reshape(input=<something>, new_shape=shape) // // then pulling `f` out of the cluster may reduce the number of compilations and // will never increase the number of compilations.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 15.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/builtins.go
check.dump("%v: trace() without arguments", atPos(call)) x.mode = novalue break } var t operand x1 := x for _, arg := range argList { check.rawExpr(nil, x1, arg, nil, false) // permit trace for types, e.g.: new(trace(T)) check.dump("%v: %s", atPos(x1), x1) x1 = &t // use incoming x only for first argument } if x.mode == invalid { return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 27.1K bytes - Viewed (0) -
tensorflow/cc/gradients/math_grad.cc
// The gradient that will flow back to the gather operation will look like // [x1, x2], it will have the same shape as the output of the SegmentSum // operation. The differentiation step of the SegmentSum operation just // broadcast the gradient in order to retrieve the z's shape. // dy/dz = [x1, x1, x1, x2] grad_outputs->push_back(Gather(scope, grad_inputs[0], op.input(1)));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Aug 25 18:20:20 UTC 2023 - 50.7K bytes - Viewed (0) -
src/crypto/internal/nistec/p384.go
// prime order elliptic curves" (https://eprint.iacr.org/2015/1060), §A.2. t0 := new(fiat.P384Element).Mul(p1.x, p2.x) // t0 := X1 * X2 t1 := new(fiat.P384Element).Mul(p1.y, p2.y) // t1 := Y1 * Y2 t2 := new(fiat.P384Element).Mul(p1.z, p2.z) // t2 := Z1 * Z2 t3 := new(fiat.P384Element).Add(p1.x, p1.y) // t3 := X1 + Y1 t4 := new(fiat.P384Element).Add(p2.x, p2.y) // t4 := X2 + Y2 t3.Mul(t3, t4) // t3 := t3 * t4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 18K bytes - Viewed (0) -
src/crypto/internal/nistec/p256.go
// prime order elliptic curves" (https://eprint.iacr.org/2015/1060), §A.2. t0 := new(fiat.P256Element).Mul(p1.x, p2.x) // t0 := X1 * X2 t1 := new(fiat.P256Element).Mul(p1.y, p2.y) // t1 := Y1 * Y2 t2 := new(fiat.P256Element).Mul(p1.z, p2.z) // t2 := Z1 * Z2 t3 := new(fiat.P256Element).Add(p1.x, p1.y) // t3 := X1 + Y1 t4 := new(fiat.P256Element).Add(p2.x, p2.y) // t4 := X2 + Y2 t3.Mul(t3, t4) // t3 := t3 * t4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 17.2K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/filtering_test.go
st.MakePod().Name("p-b1").Node("node-b").Label("foo", "").Obj(), st.MakePod().Name("p-x1").Node("node-x").Label("foo", "").Obj(), st.MakePod().Name("p-x2").Node("node-x").Label("foo", "").Obj(), }, deletedPodIdx: 3, // remove pod "p-x1" nodeIdx: 2, // node-x want: &preFilterState{ Constraints: []topologySpreadConstraint{zoneConstraint, nodeConstraint},
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 10:42:29 UTC 2024 - 143.1K bytes - Viewed (0) -
src/crypto/internal/nistec/p224.go
// prime order elliptic curves" (https://eprint.iacr.org/2015/1060), §A.2. t0 := new(fiat.P224Element).Mul(p1.x, p2.x) // t0 := X1 * X2 t1 := new(fiat.P224Element).Mul(p1.y, p2.y) // t1 := Y1 * Y2 t2 := new(fiat.P224Element).Mul(p1.z, p2.z) // t2 := Z1 * Z2 t3 := new(fiat.P224Element).Add(p1.x, p1.y) // t3 := X1 + Y1 t4 := new(fiat.P224Element).Add(p2.x, p2.y) // t4 := X2 + Y2 t3.Mul(t3, t4) // t3 := t3 * t4
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/p521.go
// prime order elliptic curves" (https://eprint.iacr.org/2015/1060), §A.2. t0 := new(fiat.P521Element).Mul(p1.x, p2.x) // t0 := X1 * X2 t1 := new(fiat.P521Element).Mul(p1.y, p2.y) // t1 := Y1 * Y2 t2 := new(fiat.P521Element).Mul(p1.z, p2.z) // t2 := Z1 * Z2 t3 := new(fiat.P521Element).Add(p1.x, p1.y) // t3 := X1 + Y1 t4 := new(fiat.P521Element).Add(p2.x, p2.y) // t4 := X2 + Y2 t3.Mul(t3, t4) // t3 := t3 * t4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 17K bytes - Viewed (0)