Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 833 for len2 (0.01 seconds)

  1. callbacks/helper.go

    	columns := make([]string, 0, len(mapValues))
    
    	// when the length of mapValues is zero,return directly here
    	// no need to call stmt.SelectAndOmitColumns method
    	if len(mapValues) == 0 {
    		stmt.AddError(gorm.ErrEmptySlice)
    		return
    	}
    
    	var (
    		result                    = make(map[string][]interface{}, len(mapValues))
    		selectColumns, restricted = stmt.SelectAndOmitColumns(true, false)
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Thu Apr 14 12:32:57 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  2. cmd/endpoint-ellipses.go

    	for _, ss := range setCounts {
    		var symmetry bool
    		for _, argPattern := range argPatterns {
    			for _, p := range argPattern {
    				if uint64(len(p.Seq)) > ss {
    					symmetry = uint64(len(p.Seq))%ss == 0
    				} else {
    					symmetry = ss%uint64(len(p.Seq)) == 0
    				}
    			}
    		}
    		// With no arg patterns, it is expected that user knows
    		// the right symmetry, so either ellipses patterns are
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 14.7K bytes
    - Click Count (0)
  3. tests/joins_test.go

    		t.Fatalf("Failed to load with joins, got error: %v", err)
    	} else if len(users2) != len(users) {
    		t.Fatalf("Failed to load join users, got: %v, expect: %v", len(users2), len(users))
    	}
    
    	sort.Slice(users2, func(i, j int) bool {
    		return users2[i].ID > users2[j].ID
    	})
    
    	sort.Slice(users, func(i, j int) bool {
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Sun May 25 07:40:40 GMT 2025
    - 15K bytes
    - Click Count (0)
  4. internal/crypto/sse-s3.go

    	if k == nil {
    		return nil, Errorf("KMS not configured")
    	}
    
    	if len(metadata) != len(buckets) || len(metadata) != len(objects) {
    		return nil, Errorf("invalid metadata/object count: %d != %d != %d", len(metadata), len(buckets), len(objects))
    	}
    	keys := make([]ObjectKey, 0, len(metadata))
    	for i := range metadata {
    		key, err := s3.UnsealObjectKey(k, metadata[i], buckets[i], objects[i])
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue May 07 23:55:37 GMT 2024
    - 7.6K bytes
    - Click Count (0)
  5. src/archive/tar/strconv.go

    func (f *formatter) formatString(b []byte, s string) {
    	if len(s) > len(b) {
    		f.err = ErrFieldTooLong
    	}
    	copy(b, s)
    	if len(s) < len(b) {
    		b[len(s)] = 0
    	}
    
    	// Some buggy readers treat regular files with a trailing slash
    	// in the V7 path field as a directory even though the full path
    	// recorded elsewhere (e.g., via PAX record) contains no trailing slash.
    	if len(s) > len(b) && b[len(b)-1] == '/' {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Sep 08 17:08:20 GMT 2025
    - 9.1K bytes
    - Click Count (0)
  6. internal/grid/types_test.go

    	}
    	var v2 MSS
    	left, err := v2.UnmarshalMsg(bts)
    	if err != nil {
    		t.Fatal(err)
    	}
    	if len(left) != 0 {
    		t.Errorf("%d bytes left over after UnmarshalMsg(): %q", len(left), left)
    	}
    
    	left, err = msgp.Skip(bts)
    	if err != nil {
    		t.Fatal(err)
    	}
    	if len(left) > 0 {
    		t.Errorf("%d bytes left over after Skip(): %q", len(left), left)
    	}
    	if !reflect.DeepEqual(v, v2) {
    		t.Errorf("MSS: %v != %v", v, v2)
    	}
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 3.6K bytes
    - Click Count (0)
  7. internal/grid/types.go

    	}
    	val, bytes, err := msgp.ReadBytesZC(bytes)
    	if err != nil {
    		return bytes, err
    	}
    	if cap(*b) >= len(val) {
    		*b = (*b)[:len(val)]
    		copy(*b, val)
    	} else {
    		if cap(*b) == 0 && len(val) <= maxBufferSize {
    			*b = GetByteBufferCap(len(val))
    		} else {
    			PutByteBuffer(*b)
    			*b = make([]byte, 0, len(val))
    		}
    		in := *b
    		in = append(in[:0], val...)
    		*b = in
    	}
    	return bytes, nil
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 15.5K bytes
    - Click Count (0)
  8. src/archive/zip/zip_test.go

    				rp.n += int64(len(p))
    				return len(p), nil
    			}
    		}
    	}
    
    	for _, b := range p {
    		if rp == nil || rp.b != b {
    			r.buf = append(r.buf, repeatedByte{r.Size(), b, 1})
    			rp = &r.buf[len(r.buf)-1]
    		} else {
    			rp.n++
    		}
    	}
    	return len(p), nil
    }
    
    func memset(a []byte, b byte) {
    	if len(a) == 0 {
    		return
    	}
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu May 23 01:00:11 GMT 2024
    - 19.6K bytes
    - Click Count (0)
  9. callbacks/create.go

    				for _, c := range db.Statement.Schema.CreateClauses {
    					db.Statement.AddClause(c)
    				}
    			}
    
    			if supportReturning && len(db.Statement.Schema.FieldsWithDefaultDBValue) > 0 {
    				if _, ok := db.Statement.Clauses["RETURNING"]; !ok {
    					fromColumns := make([]clause.Column, 0, len(db.Statement.Schema.FieldsWithDefaultDBValue))
    					for _, field := range db.Statement.Schema.FieldsWithDefaultDBValue {
    						if field.Readable {
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Tue Jul 29 11:06:13 GMT 2025
    - 13K bytes
    - Click Count (0)
  10. guava/src/com/google/common/hash/AbstractNonStreamingHashFunction.java

      }
    
      @Override
      public HashCode hashUnencodedChars(CharSequence input) {
        int len = input.length();
        ByteBuffer buffer = ByteBuffer.allocate(len * 2).order(ByteOrder.LITTLE_ENDIAN);
        for (int i = 0; i < len; i++) {
          buffer.putChar(input.charAt(i));
        }
        return hashBytes(buffer.array());
      }
    
      @Override
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 04 15:39:10 GMT 2025
    - 4.8K bytes
    - Click Count (0)
Back to Top