Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 841 - 850 of 1,554 for makeT (0.03 seconds)

  1. cmd/object-api-utils_test.go

    		{name: "large", data: bytes.Repeat([]byte("hello, world"), 1000000), wantIdx: true},
    	}
    
    	for _, tt := range tests {
    		t.Run(tt.name, func(t *testing.T) {
    			buf := make([]byte, 100) // make small buffer to ensure multiple reads are required for large case
    
    			r, idxCB := newS2CompressReader(bytes.NewReader(tt.data), int64(len(tt.data)), false)
    			defer r.Close()
    
    			var rdrBuf bytes.Buffer
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 24.1K bytes
    - Click Count (0)
  2. docs/features/calls.md

    ## Dispatch
    
    For synchronous calls, you bring your own thread and are responsible for managing how many simultaneous requests you make. Too many simultaneous connections wastes resources; too few harms latency.
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:01:42 GMT 2026
    - 3.9K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/math/DoubleUtils.java

          return x.longValue();
        } else if (exponent > MAX_EXPONENT) {
          return x.signum() * POSITIVE_INFINITY;
        }
    
        /*
         * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding
         * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or
         * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 04:51:56 GMT 2026
    - 5K bytes
    - Click Count (0)
  4. docs/en/docs/advanced/dataclasses.md

    <img src="/img/tutorial/dataclasses/image01.png">
    
    ## Dataclasses in Nested Data Structures { #dataclasses-in-nested-data-structures }
    
    You can also combine `dataclasses` with other type annotations to make nested data structures.
    
    In some cases, you might still have to use Pydantic's version of `dataclasses`. For example, if you have errors with the automatically generated API documentation.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 4K bytes
    - Click Count (0)
  5. fastapi/_compat/shared.py

            or hasattr(origin, "__pydantic_core_schema__")
            or hasattr(origin, "__get_pydantic_core_schema__")
        )
    
    
    def field_annotation_is_scalar(annotation: Any) -> bool:
        # handle Ellipsis here to make tuple[int, ...] work nicely
        return annotation is Ellipsis or not field_annotation_is_complex(annotation)
    
    
    def field_annotation_is_scalar_sequence(annotation: type[Any] | None) -> bool:
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Wed Feb 11 18:32:12 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  6. build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/Jdk.java

        }
    
        private String getHomeRoot() {
            boolean isOSX = "mac".equals(getPlatform()) || "darwin".equals(getPlatform());
            return getPath() + (isOSX ? "/Contents/Home" : "");
        }
    
        // internal, make this jdks configuration unmodifiable
        void finalizeValues() {
            if (version.isPresent() == false) {
                throw new IllegalArgumentException("version not specified for jdk [" + name + "]");
            }
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Mon Sep 27 19:29:10 GMT 2021
    - 6.8K bytes
    - Click Count (0)
  7. cmd/iam-store.go

    	UpdatedAt time.Time `json:"updatedAt"`
    }
    
    // mappedPoliciesToMap copies the map of mapped policies to a regular map.
    func mappedPoliciesToMap(m *xsync.MapOf[string, MappedPolicy]) map[string]MappedPolicy {
    	policies := make(map[string]MappedPolicy, m.Size())
    	m.Range(func(k string, v MappedPolicy) bool {
    		policies[k] = v
    		return true
    	})
    	return policies
    }
    
    // converts a mapped policy into a slice of distinct policies
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 87.1K bytes
    - Click Count (0)
  8. cmd/batch-rotate_gen.go

    			zb0002, err = dc.ReadArrayHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "Tags")
    				return
    			}
    			if cap(z.Tags) >= int(zb0002) {
    				z.Tags = (z.Tags)[:zb0002]
    			} else {
    				z.Tags = make([]BatchJobKV, zb0002)
    			}
    			for za0001 := range z.Tags {
    				err = z.Tags[za0001].DecodeMsg(dc)
    				if err != nil {
    					err = msgp.WrapError(err, "Tags", za0001)
    					return
    				}
    			}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 27.1K bytes
    - Click Count (0)
  9. internal/jwt/parser.go

    const base64BufferSize = 64 * humanize.KiByte
    
    var (
    	base64BufPool bpool.Pool[*[]byte]
    	hmacSigners   []*SigningMethodHMAC
    )
    
    func init() {
    	base64BufPool = bpool.Pool[*[]byte]{
    		New: func() *[]byte {
    			buf := make([]byte, base64BufferSize)
    			return &buf
    		},
    	}
    
    	hmacSigners = []*SigningMethodHMAC{
    		{Name: "HS256", Hash: crypto.SHA256},
    		{Name: "HS384", Hash: crypto.SHA384},
    		{Name: "HS512", Hash: crypto.SHA512},
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  10. cmd/bucket-handlers_test.go

    		}
    	}
    
    	// Test for Anonymous/unsigned http request.
    	// ListBucketsHandler doesn't support bucket policies, setting the policies shouldn't make any difference.
    	anonReq, err := newTestRequest(http.MethodGet, getBucketLocationURL("", bucketName), 0, nil)
    	if err != nil {
    		t.Fatalf("MinIO %s: Failed to create an anonymous request.", instanceType)
    	}
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 39.8K bytes
    - Click Count (0)
Back to Top