- Sort Score
- Num 10 results
- Language All
Results 11 - 20 of 452 for endPoint (0.07 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
tests/test_pydantic_v1_error.py
@app.post("/param") def endpoint(data: ParamModelV1): # pragma: no cover return data def test_raises_pydantic_v1_model_in_return_type() -> None: class ReturnModelV1(BaseModel): name: str app = FastAPI() with pytest.raises(PydanticV1NotSupportedError): @app.get("/return") def endpoint() -> ReturnModelV1: # pragma: no coverCreated: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Tue Feb 17 09:59:14 GMT 2026 - 2.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */ @VisibleForTesting transient long @Nullable [] links; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 10.2K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
/** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ private transient int @Nullable [] predecessor; /** * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the lastCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
/** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ private transient int @Nullable [] predecessor; /** * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the lastCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0) -
cmd/prepare-storage.go
) var printEndpointError = func() func(Endpoint, error, bool) { var mutex sync.Mutex printOnce := make(map[Endpoint]map[string]int) return func(endpoint Endpoint, err error, once bool) { reqInfo := (&logger.ReqInfo{}).AppendTags("endpoint", endpoint.String()) ctx := logger.SetReqInfo(GlobalContext, reqInfo) mutex.Lock() defer mutex.Unlock() m, ok := printOnce[endpoint] if !ok { m = make(map[string]int)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Jul 12 20:51:54 GMT 2024 - 11.1K bytes - Click Count (1) -
docs/metrics/prometheus/README.md
- MinIO exports Prometheus compatible data by default as an authorized endpoint at `/minio/v2/metrics/cluster`. - MinIO exports Prometheus compatible data by default which is bucket centric as an authorized endpoint at `/minio/v2/metrics/bucket`. - MinIO exports Prometheus compatible data by default which is node centric as an authorized endpoint at `/minio/v2/metrics/node`.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 7.1K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/GeneralRange.java
* endpoint behavior. */ static <T extends @Nullable Object> GeneralRange<T> upTo( Comparator<? super T> comparator, @ParametricNullness T endpoint, BoundType boundType) { return new GeneralRange<>(comparator, false, null, OPEN, true, endpoint, boundType); } /** * Returns everything between the endpoints relative to the specified comparator, with the
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 10.8K bytes - Click Count (0) -
cmd/bucket-targets.go
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 20.9K bytes - Click Count (0) -
cmd/test-utils_test.go
} for i := range endpoints { endpoints[i].SetPoolIndex(poolIdx) endpoints[i].SetSetIndex(i / drivesPerSet) endpoints[i].SetDiskIndex(i % drivesPerSet) } return endpoints } func getEndpointsLocalAddr(endpointServerPools EndpointServerPools) string { for _, endpoints := range endpointServerPools { for _, endpoint := range endpoints.Endpoints { if endpoint.IsLocal && endpoint.Type() == URLEndpointType {Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 77K bytes - Click Count (0) -
cmd/erasure.go
g := errgroup.WithNErrs(len(disks)) for index := range disks { g.Go(func() error { di := madmin.Disk{ Endpoint: endpoints[index].String(), PoolIndex: endpoints[index].PoolIdx, SetIndex: endpoints[index].SetIdx, DiskIndex: endpoints[index].DiskIdx, Local: endpoints[index].IsLocal, } if disks[index] == OfflineDisk { di.State = diskErrToDriveState(errDiskNotFound) disksInfo[index] = di
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 16.1K bytes - Click Count (0)