Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for bucketDone (0.05 seconds)

  1. cmd/background-newdisks-heal-ops.go

    	h.BytesDone = h.ResumeBytesDone
    	h.BytesFailed = h.ResumeBytesFailed
    	h.BytesSkipped = h.ResumeBytesSkipped
    }
    
    // bucketDone should be called when a bucket is done healing.
    // Adds the bucket to the list of healed buckets and updates resume numbers.
    func (h *healingTracker) bucketDone(bucket string) {
    	h.mu.Lock()
    	defer h.mu.Unlock()
    
    	h.ResumeItemsHealed = h.ItemsHealed
    	h.ResumeItemsFailed = h.ItemsFailed
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 16.5K bytes
    - Click Count (0)
  2. cmd/erasure-server-pool-decom.go

    		return true
    	}
    	return false
    }
    
    func (p poolMeta) isBucketDecommissioned(idx int, bucket string) bool {
    	return p.Pools[idx].Decommission.isBucketDecommissioned(bucket)
    }
    
    func (p *poolMeta) BucketDone(idx int, bucket decomBucketInfo) bool {
    	if p.Pools[idx].Decommission == nil {
    		// Decommission not in progress.
    		return false
    	}
    	return p.Pools[idx].Decommission.bucketPop(bucket.String())
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 42.2K bytes
    - Click Count (1)
  3. cmd/global-heal.go

    			continue
    		}
    
    		select {
    		// If context is canceled don't mark as done...
    		case <-ctx.Done():
    			return ctx.Err()
    		default:
    			tracker.bucketDone(bucket)
    			healingLogIf(ctx, tracker.update(ctx))
    		}
    	}
    	if retErr != nil {
    		return retErr
    	}
    
    	// Last sanity check
    	if len(tracker.QueuedBuckets) > 0 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Apr 04 13:49:12 GMT 2025
    - 16.2K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/HashBiMap.java

            }
            break;
          }
          prevBucketNode = bucketNode;
        }
    
        int valueBucket = node.valueHash & mask;
        prevBucketNode = null;
        for (Node<K, V> bucketNode = hashTableVToK[valueBucket];
            true;
            bucketNode = bucketNode.nextInVToKBucket) {
          if (bucketNode == node) {
            if (prevBucketNode == null) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 25.7K bytes
    - Click Count (0)
Back to Top