- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 176 for chunkOf (0.27 sec)
-
api/openapi-spec/v3/apis__node.k8s.io__v1_openapi.json
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 08 04:18:56 UTC 2024 - 122.9K bytes - Viewed (0) -
samples/addons/loki.yaml
auth_enabled: false common: compactor_address: 'http://loki:3100' path_prefix: /var/loki replication_factor: 1 storage: filesystem: chunks_directory: /var/loki/chunks rules_directory: /var/loki/rules frontend: scheduler_address: "" tail_proxy_url: http://loki-querier.istio-system.svc.cluster.local:3100 frontend_worker: scheduler_address: ""
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 12 18:57:35 UTC 2024 - 7.8K bytes - Viewed (0) -
src/runtime/mheap.go
ha := h.arenas[ai.l1()][ai.l2()] // Get a chunk of the bitmap to work on. arenaPage := uint(pageIdx % pagesPerArena) inUse := ha.pageInUse[arenaPage/8:] marked := ha.pageMarks[arenaPage/8:] if uintptr(len(inUse)) > n/8 { inUse = inUse[:n/8] marked = marked[:n/8] } // Scan this bitmap chunk for spans that are in-use // but have no marked objects on them.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/math/rand/rand_test.go
} func checkSampleSliceDistributions(t *testing.T, samples []float64, nslices int, expected *statsResults) { t.Helper() chunk := len(samples) / nslices for i := 0; i < nslices; i++ { low := i * chunk var high int if i == nslices-1 { high = len(samples) - 1 } else { high = (i + 1) * chunk } checkSampleDistribution(t, samples[low:high], expected) } } // // Normal distribution tests //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 16.9K bytes - Viewed (0) -
cmd/bitrot-streaming.go
"context" "hash" "io" "sync" xhttp "github.com/minio/minio/internal/http" "github.com/minio/minio/internal/ioutil" "github.com/minio/minio/internal/ringbuffer" ) // Calculates bitrot in chunks and writes the hash into the stream. type streamingBitrotWriter struct { iow io.WriteCloser closeWithErr func(err error) h hash.Hash shardSize int64 canClose *sync.WaitGroup
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed May 15 00:11:04 UTC 2024 - 6.1K bytes - Viewed (0) -
staging/src/k8s.io/api/storagemigration/v1alpha1/types.go
// the endpoint serving the resource. // Immutable. Resource GroupVersionResource `json:"resource" protobuf:"bytes,1,opt,name=resource"` // The token used in the list options to get the next chunk of objects // to migrate. When the .status.conditions indicates the migration is // "Running", users can use this token to check the progress of the // migration. // +optional
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 08 04:18:56 UTC 2024 - 5.4K bytes - Viewed (0) -
cmd/object-handlers_test.go
accessKey: credentials.AccessKey, secretKey: credentials.SecretKey, shouldPass: false, fault: malformedEncoding, }, // Test case - 8 // Chunk with shorter than advertised chunk data. { bucketName: bucketName, objectName: objectName, data: oneKData, dataLen: 1024, chunkSize: 1024,
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:50:49 UTC 2024 - 161.9K bytes - Viewed (0) -
api/openapi-spec/v3/apis__certificates.k8s.io__v1_openapi.json
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 08 04:18:56 UTC 2024 - 151.7K bytes - Viewed (0) -
src/net/http/clientserver_test.go
w.(Flusher).Flush() fmt.Fprintf(w, "I am a chunked response.") })) res, err := cst.c.Get(cst.ts.URL) if err != nil { t.Fatalf("Get error: %v", err) } defer res.Body.Close() if g, e := res.ContentLength, int64(-1); g != e { t.Errorf("expected ContentLength of %d; got %d", e, g) } wantTE := []string{"chunked"} if mode == http2Mode { wantTE = nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 46.6K bytes - Viewed (0) -
src/math/rand/v2/rand_test.go
} func checkSampleSliceDistributions(t *testing.T, samples []float64, nslices int, expected *statsResults) { t.Helper() chunk := len(samples) / nslices for i := 0; i < nslices; i++ { low := i * chunk var high int if i == nslices-1 { high = len(samples) - 1 } else { high = (i + 1) * chunk } checkSampleDistribution(t, samples[low:high], expected) } } // // Normal distribution tests //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 17.4K bytes - Viewed (0)