Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 47 for int1 (0.05 sec)

  1. tests/migrate_test.go

    		return
    	}
    
    	type Smallint int8
    
    	type MigrateInt struct {
    		Int8 Smallint
    	}
    
    	tracer := Tracer{
    		Logger: DB.Config.Logger,
    		Test: func(ctx context.Context, begin time.Time, fc func() (sql string, rowsAffected int64), err error) {
    			sql, _ := fc()
    			if strings.HasPrefix(sql, "ALTER TABLE \"migrate_ints\" ALTER COLUMN \"int8\" TYPE smallint") {
    Registered: Wed Jun 12 16:27:09 UTC 2024
    - Last Modified: Mon Mar 18 11:24:16 UTC 2024
    - 56.2K bytes
    - Viewed (0)
  2. tensorflow/compiler/mlir/tensorflow/transforms/lower_tf.cc

    }
    
    // Returns a 1-d i64 elements attribute populated with numbers from start to
    // end, excluding.
    static DenseIntElementsAttr GetI64ElementsAttrForSeq(int start, int end,
                                                         Builder *builder) {
      int size = end - start;
    
      SmallVector<int64_t, 4> vals;
      vals.resize(size);
      std::iota(vals.begin(), vals.end(), start);
    
      TensorType ty =
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 74.9K bytes
    - Viewed (0)
  3. src/cmd/cgo/gcc.go

    var dwarfToName = map[string]string{
    	"long int":               "long",
    	"long unsigned int":      "ulong",
    	"unsigned int":           "uint",
    	"short unsigned int":     "ushort",
    	"unsigned short":         "ushort", // Used by Clang; issue 13129.
    	"short int":              "short",
    	"long long int":          "longlong",
    	"long long unsigned int": "ulonglong",
    	"signed char":            "schar",
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 15:50:06 UTC 2024
    - 97K bytes
    - Viewed (0)
  4. src/sync/atomic/atomic_test.go

    }
    
    func hammerSwapUint32(addr *uint32, count int) {
    	seed := int(uintptr(unsafe.Pointer(&count)))
    	for i := 0; i < count; i++ {
    		new := uint32(seed+i)<<16 | uint32(seed+i)<<16>>16
    		old := SwapUint32(addr, new)
    		if old>>16 != old<<16>>16 {
    			panic(fmt.Sprintf("SwapUint32 is not atomic: %v", old))
    		}
    	}
    }
    
    func hammerSwapUint32Method(uaddr *uint32, count int) {
    	addr := (*Uint32)(unsafe.Pointer(uaddr))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:37:29 UTC 2024
    - 71.4K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/types2/api_test.go

    		{`package u1c; type _ interface{~int}`, `~int`, `~int`},
    		{`package u2c; type _ interface{int | string}`, `int | string`, `int | string`},
    		{`package u3c; type _ interface{int | string | ~bool}`, `int | string | ~bool`, `int | string | ~bool`},
    		{`package u3c; type _ interface{int | string | ~bool}`, `int | string`, `int | string`},
    		{`package u3c; type _ interface{int | string | ~bool}`, `~bool`, `~bool`},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 07 20:08:23 UTC 2024
    - 93.3K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/ssa/_gen/S390X.rules

    // Match (x >> c) << d to 'rotate then insert selected bits [into zero]'.
    (SLDconst (SRDconst x [c]) [d]) => (RISBGZ x {s390x.NewRotateParams(uint8(max8(0, int8(c-d))), 63-d, uint8(int8(d-c)&63))})
    
    // Match (x << c) >> d to 'rotate then insert selected bits [into zero]'.
    (SRDconst (SLDconst x [c]) [d]) => (RISBGZ x {s390x.NewRotateParams(d, uint8(min8(63, int8(63-c+d))), uint8(int8(c-d)&63))})
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 12 18:09:26 UTC 2023
    - 74.3K bytes
    - Viewed (0)
  7. src/cmd/compile/internal/ppc64/ssa.go

    	p := s.Prog(loadByType(t))
    	p.From.Type = obj.TYPE_MEM
    	p.From.Name = obj.NAME_AUTO
    	p.From.Sym = n.Linksym()
    	p.From.Offset = n.FrameOffset() + off
    	p.To.Type = obj.TYPE_REG
    	p.To.Reg = reg
    	return p
    }
    
    func spillArgReg(pp *objw.Progs, p *obj.Prog, f *ssa.Func, t *types.Type, reg int16, n *ir.Name, off int64) *obj.Prog {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 19:59:38 UTC 2024
    - 55.4K bytes
    - Viewed (0)
  8. tensorflow/compiler/mlir/lite/quantization/lite/quantize_model_test.cc

      ASSERT_THAT(status, Eq(kTfLiteOk));
      const auto& subgraph = model_.subgraphs[0];
      auto conv_op = subgraph->operators[0].get();
      const int input_tensor_idx = 0;
      const int weights_tensor_idx = 1;
      const int bias_tensor_index = 2;
      const int output_tensor_idx = 0;
      const auto bias_tensor =
          subgraph->tensors[conv_op->inputs[bias_tensor_index]].get();
      const auto input_tensor =
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Jun 12 23:15:24 UTC 2024
    - 73.9K bytes
    - Viewed (0)
  9. src/fmt/fmt_test.go

    	{"%#v", []int(nil), `[]int(nil)`},
    	{"%#v", []int{}, `[]int{}`},
    	{"%#v", array, `[5]int{1, 2, 3, 4, 5}`},
    	{"%#v", &array, `&[5]int{1, 2, 3, 4, 5}`},
    	{"%#v", iarray, `[4]interface {}{1, "hello", 2.5, interface {}(nil)}`},
    	{"%#v", &iarray, `&[4]interface {}{1, "hello", 2.5, interface {}(nil)}`},
    	{"%#v", map[int]byte(nil), `map[int]uint8(nil)`},
    	{"%#v", map[int]byte{}, `map[int]uint8{}`},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:31:55 UTC 2024
    - 58.6K bytes
    - Viewed (0)
  10. src/html/template/exec_test.go

    	var cmpStruct = struct {
    		Uthree, Ufour  uint
    		NegOne, Three  int
    		Ptr, NilPtr    *int
    		NonNilMap      map[int]int
    		Map            map[int]int
    		V1, V2         V
    		Iface1, Iface2 fmt.Stringer
    	}{
    		Uthree:    3,
    		Ufour:     4,
    		NegOne:    -1,
    		Three:     3,
    		Ptr:       new(int),
    		NonNilMap: make(map[int]int),
    		Iface1:    b,
    	}
    	for _, test := range cmpTests {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Feb 24 21:59:12 UTC 2024
    - 57.6K bytes
    - Viewed (0)
Back to top