Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 395 for insts (0.04 sec)

  1. platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/RemoteDependencyResolveConsoleIntegrationTest.groovy

            }
        }
    
        byte[] longXml(File file) {
            def instr = new ByteArrayOutputStream()
            instr << file.bytes
            while (instr.size() < 2048) {
                instr << "          ".bytes
            }
            return instr.toByteArray()
        }
    
        byte[] longJar(File file) {
            return longXml(file)
        }
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Sun Jan 14 00:59:27 UTC 2024
    - 5.2K bytes
    - Viewed (0)
  2. src/crypto/x509/oid_test.go

    		str  string
    		ints []uint64
    	}{
    		{str: "", ints: []uint64{}},
    		{str: "1", ints: []uint64{1}},
    		{str: "3", ints: []uint64{3}},
    		{str: "3.100.200", ints: []uint64{3, 100, 200}},
    		{str: "1.81", ints: []uint64{1, 81}},
    		{str: "1.81.200", ints: []uint64{1, 81, 200}},
    	}
    
    	for _, tt := range cases {
    		oid, err := OIDFromInts(tt.ints)
    		if err == nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 19:10:38 UTC 2024
    - 10.8K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/lite/transforms/dense_to_sparse.cc

          auto* inst = value.getDefiningOp();
          if (!inst) {
            continue;
          }
    
          // There could be a Dequantize op after the weight tensor in cases like
          // fp16 post-training quantization. We need to get the weight from the
          // input of the Dequantize op.
          if (isa<DequantizeOp>(inst)) {
            op = inst;
            value = inst->getOperand(0);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 16.1K bytes
    - Viewed (0)
  4. tensorflow/compiler/mlir/lite/flatbuffer_export.cc

          }
          if (auto custom_op = dyn_cast<mlir::TFL::CustomOp>(inst)) {
            return BuildCustomOperator(inst, custom_op, operands, results);
          }
          if (auto whileOp = dyn_cast<mlir::TFL::WhileOp>(inst)) {
            if (inst->getNumOperands() != inst->getNumResults()) {
              inst->emitOpError(
                  "number of operands and results don't match, only canonical "
                  "TFL While supported");
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Jun 12 21:41:49 UTC 2024
    - 164.5K bytes
    - Viewed (0)
  5. src/go/types/named_test.go

    	}
    
    	Inst := Unalias(pkg.Scope().Lookup("Inst").Type()).(*Pointer).Elem().(*Named)
    	Node := firstFieldType(Inst)
    	Tree := firstFieldType(Node)
    	if !Identical(Inst, Tree) {
    		t.Fatalf("Not a cycle: got %v, want %v", Tree, Inst)
    	}
    	if Inst != Tree {
    		t.Errorf("Duplicate instances in cycle: %s (%p) -> %s (%p) -> %s (%p)", Inst, Inst, Node, Node, Tree, Tree)
    	}
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 05 16:29:58 UTC 2024
    - 3.9K bytes
    - Viewed (0)
  6. test/interface/pointer.go

    // Does not compile.
    
    package main
    
    type Inst interface {
    	Next() *Inst
    }
    
    type Regexp struct {
    	code  []Inst
    	start Inst
    }
    
    type Start struct {
    	foo *Inst
    }
    
    func (start *Start) Next() *Inst { return nil }
    
    func AddInst(Inst) *Inst {
    	print("ok in addinst\n")
    	return nil
    }
    
    func main() {
    	print("call addinst\n")
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 28 14:28:33 UTC 2023
    - 758 bytes
    - Viewed (0)
  7. src/cmd/compile/internal/types2/named.go

    	if expanding != nil && expanding.Obj().pkg == obj.pkg {
    		inst.ctxt = expanding.inst.ctxt
    	}
    	typ := &Named{check: check, obj: obj, inst: inst}
    	obj.typ = typ
    	// Ensure that typ is always sanity-checked.
    	if check != nil {
    		check.needsCleanup(typ)
    	}
    	return typ
    }
    
    func (t *Named) cleanup() {
    	assert(t.inst == nil || t.inst.orig.inst == nil)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 20:03:31 UTC 2024
    - 23.9K bytes
    - Viewed (0)
  8. pilot/pkg/server/instance_test.go

    			stop := newReclosableChannel()
    			t.Cleanup(stop.Close)
    			inst := server.New()
    			g.Expect(inst.Start(stop.c)).To(BeNil())
    
    			component := c.c.Run
    			go func() {
    				if c.async {
    					if c.wait {
    						inst.RunComponentAsyncAndWait("test", component)
    					} else {
    						inst.RunComponentAsync("test", component)
    					}
    				} else {
    					inst.RunComponent("test", component)
    				}
    			}()
    
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Tue Apr 30 23:02:39 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  9. src/cmd/internal/objfile/disasm.go

    	inst, err := x86asm.Decode(code, arch)
    	var text string
    	size := inst.Len
    	if err != nil || size == 0 || inst.Op == 0 {
    		size = 1
    		text = "?"
    	} else {
    		if gnuAsm {
    			text = fmt.Sprintf("%-36s // %s", x86asm.GoSyntax(inst, pc, lookup), x86asm.GNUSyntax(inst, pc, nil))
    		} else {
    			text = x86asm.GoSyntax(inst, pc, lookup)
    		}
    	}
    	return text, size
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Sep 20 02:13:02 UTC 2022
    - 10.5K bytes
    - Viewed (0)
  10. src/go/types/named.go

    	if expanding != nil && expanding.Obj().pkg == obj.pkg {
    		inst.ctxt = expanding.inst.ctxt
    	}
    	typ := &Named{check: check, obj: obj, inst: inst}
    	obj.typ = typ
    	// Ensure that typ is always sanity-checked.
    	if check != nil {
    		check.needsCleanup(typ)
    	}
    	return typ
    }
    
    func (t *Named) cleanup() {
    	assert(t.inst == nil || t.inst.orig.inst == nil)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 20:03:31 UTC 2024
    - 24K bytes
    - Viewed (0)
Back to top