- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,196 for assignOp (0.13 sec)
-
src/cmd/compile/internal/typecheck/typecheck.go
base.Errorf("cannot assign to %v (declared const)", n) default: base.Errorf("cannot assign to %v", n) } } func checkassignto(src *types.Type, dst ir.Node) { // TODO(mdempsky): Handle all untyped types correctly. if src == types.UntypedBool && dst.Type().IsBoolean() { return } if op, why := assignOp(src, dst.Type()); op == ir.OXXX {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 19:08:34 UTC 2024 - 30.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/assign/assign.go
"golang.org/x/tools/go/ast/inspector" ) //go:embed doc.go var doc string var Analyzer = &analysis.Analyzer{ Name: "assign", Doc: analysisutil.MustExtractDoc(doc, "assign"), URL: "https://pkg.go.dev/golang.org/x/tools/go/analysis/passes/assign", Requires: []*analysis.Analyzer{inspect.Analyzer}, Run: run, } func run(pass *analysis.Pass) (interface{}, error) {
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/walk/assign.go
} return nn } // check assign expression list to // an expression list. called in // // expr-list = expr-list func ascompatee(op ir.Op, nl, nr []ir.Node) []ir.Node { // cannot happen: should have been rejected during type checking if len(nl) != len(nr) { base.Fatalf("assignment operands mismatch: %+v / %+v", ir.Nodes(nl), ir.Nodes(nr)) } var assigned ir.NameSet var memWrite, deferResultWrite bool
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
src/cmd/vet/testdata/assign/assign.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // This file contains tests for the useless-assignment checker. package assign import "math/rand" type ST struct { x int l []int } func (s *ST) SetX(x int, ch chan int) { // Accidental self-assignment; it should be "s.x = x" x = x // ERROR "self-assignment of x to x"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 20 15:46:42 UTC 2019 - 804 bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/host_runtime/tpu_merge_variables_with_execute.cc
} info.execute_output_index = execute_output.index(); info.assign = assign_op; if (!last_assign || last_assign->isBeforeInBlock(assign_op)) { last_assign = assign_op; } VLOG(2) << "Adding assign op to merge candidates: " << debugString(assign_op); all_assigns.insert(assign_op); output_merged[execute_output.index()] = true; } if (last_assign != nullptr) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 17:52:11 UTC 2024 - 27K bytes - Viewed (0) -
.github/workflows/auto-assign-pr-to-author.yml
name: 'Auto Assign PR to Author' on: pull_request: types: [opened] permissions: {} jobs: add-reviews: permissions: contents: read # for kentaro-m/auto-assign-action to fetch config file pull-requests: write # for kentaro-m/auto-assign-action to assign PR reviewers runs-on: ubuntu-latest steps:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu May 02 09:13:16 UTC 2024 - 381 bytes - Viewed (0) -
src/reflect/abi.go
panic("unknown type kind") } panic("unhandled register assignment path") } // assignIntN assigns n values to registers, each "size" bytes large, // from the data at [offset, offset+n*size) in memory. Each value at // [offset+i*size, offset+(i+1)*size) for i < n is assigned to the // next n integer registers. // // Bit i in ptrMap indicates whether the i'th value is a pointer. // n must be <= 8. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:08:32 UTC 2024 - 15K bytes - Viewed (0) -
test/assign1.go
Rob Pike <******@****.***> 1329617983 +1100
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 02:19:43 UTC 2012 - 5.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsetree.go
if c != c0 { s += " " } s += t.treestructure1(c, i+1) } s += ")" } return s } // numberBlock assigns entry and exit numbers for b and b's // children in an in-order walk from a gappy sequence, where n // is the first number not yet assigned or reserved. N should // be larger than zero. For each entry and exit number, the // values one larger and smaller are reserved to indicate
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
test/assign.go
Robert Griesemer <******@****.***> 1607975635 -0800
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 14 20:13:36 UTC 2020 - 1K bytes - Viewed (0)