- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 226 for lhs0 (0.06 sec)
-
tensorflow/compiler/mlir/quantization/stablehlo/tests/bridge/optimize.mlir
// RUN: stablehlo-quant-opt -optimize-int-graph -split-input-file %s -verify-diagnostics | FileCheck %s // CHECK-LABEL: func @convolution_add_add func.func @convolution_add_add( %lhs: tensor<?x3x2x1xi8>, %rhs: tensor<2x1x1x1xi8>, %zp_offset: tensor<?x2x2x1xi32>, %bias: tensor<1xi32> ) -> tensor<?x2x2x1xi32> { // CHECK-DAG: %[[conv:.*]] = mhlo.convolution // CHECK-DAG: %[[combined:.*]] = chlo.broadcast_add %[[zp_offset:.*]], %[[bias:.*]]
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Feb 24 02:26:47 UTC 2024 - 10.7K bytes - Viewed (0) -
src/go/types/stmt.go
case token.ASSIGN, token.DEFINE: if len(s.Lhs) == 0 { check.error(s, InvalidSyntaxTree, "missing lhs in assignment") return } if s.Tok == token.DEFINE { check.shortVarDecl(inNode(s, s.TokPos), s.Lhs, s.Rhs) } else { // regular assignment check.assignVars(s.Lhs, s.Rhs) } default: // assignment operations if len(s.Lhs) != 1 || len(s.Rhs) != 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/cel/openapi/values_test.go
SchemaProps: spec.SchemaProps{Type: []string{"object"}}, } ) func TestEquality(t *testing.T) { cases := []struct { name string lhs ref.Val rhs ref.Val equal bool }{ { name: "map lists are equal regardless of order", lhs: UnstructuredToVal([]interface{}{ map[string]interface{}{ "key": "a", "val": 1, }, map[string]interface{}{ "key": "b",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 23 22:30:17 UTC 2023 - 17.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/einsum.cc
op, "unary einsum equation does not require transpose"); } else if (needs_reduce_sum && !needs_transpose) { rewriter.replaceOp(op, lhs); return success(); } lhs = createTransposeOp(lhs, lhs.getLoc(), lhs_transpose, &rewriter); rewriter.replaceOp(op, lhs); return success(); } std::vector<int64_t> inverseTransposeVector( llvm::ArrayRef<int64_t> input, llvm::ArrayRef<int32_t> permutation) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 33.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/optimize_patterns.td
(BinaryOp (TFL_ReshapeOp:$lhs $input, (Arith_ConstantOp:$shape $s)), $rhs, $act_fn), (BinaryOp $input, $rhs, $act_fn), [(AnyStaticShapeTensor $input), (AnyStaticShapeTensor $rhs), (IsRankLessThanEqualTo $input, $lhs), (IsRankLessThanEqualTo $lhs, $rhs), (IsReducedTailOfShape $lhs, $input), (HasOneUseOrUsedByOnlyBinaryOps $lhs),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 16 20:31:41 UTC 2024 - 66.4K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/stmt.go
// so that the conversion below happens). checkLHS := func(i int, typ *types.Type) { if n := lhs[i]; typ != nil && ir.DeclaredBy(n, stmt) && n.Type() == nil { base.Assertf(typ.Kind() == types.TNIL, "unexpected untyped nil") n.SetType(defaultType(typ)) } if lhs[i].Typecheck() == 0 { lhs[i] = AssignExpr(lhs[i]) } checkassign(lhs[i]) } assignType := func(i int, typ *types.Type) { checkLHS(i, typ)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 15:10:54 UTC 2023 - 17.8K bytes - Viewed (0) -
maven-xml-impl/src/test/java/org/apache/maven/internal/xml/XmlNodeImplTest.java
* * @throws java.lang.Exception if any. */ @Test void testCombineId() throws Exception { String lhs = "<props>" + "<property combine.id='LHS-ONLY'><name>LHS-ONLY</name><value>LHS</value></property>" + "<property combine.id='TOOVERWRITE'><name>TOOVERWRITE</name><value>LHS</value></property>" + "</props>";
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Mar 25 10:50:01 UTC 2024 - 28.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/assign/assign.go
return // ignore := } if len(stmt.Lhs) != len(stmt.Rhs) { // If LHS and RHS have different cardinality, they can't be the same. return } for i, lhs := range stmt.Lhs { rhs := stmt.Rhs[i] if analysisutil.HasSideEffects(pass.TypesInfo, lhs) || analysisutil.HasSideEffects(pass.TypesInfo, rhs) || isMapIndex(pass.TypesInfo, lhs) { continue // expressions may not be equal }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 2.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/stmt.go
// check lhs, if any lhs := guard.Lhs if lhs != nil { if lhs.Value == "_" { // _ := x.(type) is an invalid short variable declaration check.softErrorf(lhs, NoNewVar, "no new variable on left side of :=") lhs = nil // avoid declared and not used error below } else { check.recordDef(lhs, nil) // lhs variable is implicitly declared in each cause clause } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.7K bytes - Viewed (0) -
src/cmd/compile/internal/walk/select.go
n := n.(*ir.SendStmt) n.Value = typecheck.NodAddr(n.Value) n.Value = typecheck.Expr(n.Value) case ir.OSELRECV2: n := n.(*ir.AssignListStmt) if !ir.IsBlank(n.Lhs[0]) { n.Lhs[0] = typecheck.NodAddr(n.Lhs[0]) n.Lhs[0] = typecheck.Expr(n.Lhs[0]) } } } // optimization: two-case select but one is default: single non-blocking op. if ncas == 2 && dflt != nil { cas := cases[0] if cas == dflt {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 01:53:41 UTC 2023 - 7.8K bytes - Viewed (0)