- Sort Score
- Result 10 results
- Languages All
Results 11 - 17 of 17 for laking (0.17 sec)
-
cmd/namespace-lock_test.go
}() time.Sleep(1 * time.Millisecond) // wait for goroutine to advance; ref=2 // Unlock the 1st lock; ref=1 after this line nsLk.unlock("volume", "path", false) // Taking another lockMapMutex here allows queuing up additional lockers. This should // not be required but makes reproduction much easier. nsLk.lockMapMutex.Lock() // lk3 blocks. lk3ch := make(chan bool) go func() {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 3.1K bytes - Viewed (0) -
internal/config/identity/openid/providercfg.go
// UserInfo returns claims for authenticated user from userInfo endpoint. // // Some OIDC implementations such as GitLab do not support // claims as part of the normal oauth2 flow, instead rely // on service providers making calls to IDP to fetch additional // claims available from the UserInfo endpoint func (p *providerCfg) UserInfo(ctx context.Context, accessToken string, transport http.RoundTripper) (map[string]interface{}, error) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 4.6K bytes - Viewed (0) -
internal/cachevalue/cache.go
// `.TnitOnce`. func New[T any]() *Cache[T] { return &Cache[T]{} } // NewFromFunc allocates a new cached value instance and initializes it with an // update function, making it ready for use. func NewFromFunc[T any](ttl time.Duration, opts Opts, update func() (T, error)) *Cache[T] { return &Cache[T]{ ttl: ttl, updateFn: update, opts: opts, } }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Mar 01 16:00:42 GMT 2024 - 4.2K bytes - Viewed (0) -
internal/s3select/json/preader.go
// Move to next block item, ok := <-r.queue if !ok { r.err = io.EOF return nil, r.err } //nolint:staticcheck // SA6002 Using pointer would allocate more since we would have to copy slice header before taking a pointer. r.kvDstPool.Put(r.current) r.current = <-item.dst r.err = item.err r.recordsRead = 0 } kvRecord := r.current[r.recordsRead] r.recordsRead++ dstRec, ok := dst.(*Record) if !ok {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Mar 05 04:57:35 GMT 2023 - 6.4K bytes - Viewed (0) -
cmd/shared-lock.go
// if one lock lost quorum due to cluster instability // in that case, try to lock again. break keepLock case ld.lockContext <- lkctx: // Send the lock context to anyone asking for it } } } } func mergeContext(ctx1, ctx2 context.Context) (context.Context, context.CancelFunc) { ctx, cancel := context.WithCancel(context.Background()) go func() { select {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Feb 13 09:26:38 GMT 2023 - 2.3K bytes - Viewed (0) -
docs/distributed/DECOMMISSION.md
- On Operator based MinIO deployments, you need to modify the `tenant.yaml` specification and modify the `pools:` section from two entries to a single entry. After making relevant changes, proceed to execute `kubectl apply -f tenant.yaml`. > Without a 'Complete' status any 'Active' or 'Draining' pool(s) are not allowed to be removed once configured. ## NOTE
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Jul 11 14:59:49 GMT 2022 - 8.3K bytes - Viewed (0) -
docs/distributed/README.md
- **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**. - **Each object is written to a single EC set, and therefore is spread over no more than 16 drives.**
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 8.8K bytes - Viewed (0)