Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 107 for sealed (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. .github/workflows/team-triage-stale.yml

              days-before-issue-stale: 14
              stale-issue-label: to-triage
              stale-issue-message: ""
              days-before-issue-close: -1
    
              only-pr-labels: 'from:contributor'
              exempt-all-pr-milestones: true
              days-before-pr-stale: 14
              stale-pr-label: to-triage
              stale-pr-message: ""
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Sep 04 22:13:29 GMT 2025
    - 836 bytes
    - Click Count (0)
  2. cmd/metrics.go

    			float64(v), string(k),
    		)
    	}
    	for k, v := range bgSeq.getHealedItemsMap() {
    		ch <- prometheus.MustNewConstMetric(
    			prometheus.NewDesc(
    				prometheus.BuildFQName(healMetricsNamespace, "objects", "healed"),
    				"Objects healed since uptime",
    				[]string{"type"}, nil),
    			prometheus.CounterValue,
    			float64(v), string(k),
    		)
    	}
    	for k, v := range bgSeq.getHealFailedItemsMap() {
    		ch <- prometheus.MustNewConstMetric(
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Oct 24 04:06:31 GMT 2025
    - 16.7K bytes
    - Click Count (0)
  3. docs/config/README.md

    `max_io` values thereby increasing the healing speed. The delays between each operation of the healer can be adjusted by the `mc admin config set alias/ heal max_sleep=1s` and maximum concurrent requests allowed before we start slowing things down can be configured with `mc admin config set alias/ heal max_io=30` . By default the wait delay is `250ms` beyond 100 concurrent operations. This means the healer will sleep *250 milliseconds* at max for each heal operation if there are more than *100* concurrent...
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 18.1K bytes
    - Click Count (1)
  4. cmd/erasure-healing-common_test.go

    		if _, ok := diskFailures[diskIndex]; ok {
    			if !partNeedsHealing(dataErrsPerDisk[diskIndex]) {
    				t.Errorf("Disk expected to be healed, driveIndex: %d", diskIndex)
    			}
    		} else {
    			if partNeedsHealing(dataErrsPerDisk[diskIndex]) {
    				t.Errorf("Disk not expected to be healed, driveIndex: %d", diskIndex)
    			}
    		}
    	}
    }
    
    func TestCommonParities(t *testing.T) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 22.4K bytes
    - Click Count (0)
  5. .github/workflows/cleanup-stale-performance-data.yml

    name: Cleanup stale performance test data
    
    on:
      schedule:
        - cron: '0 4 * * 1'  # Run every Monday at 4:00 AM UTC
      workflow_dispatch:
    
    permissions:
      contents: read
      id-token: write
    
    jobs:
      cleanup-stale-performance-data:
        runs-on: ubuntu-latest
    
        if: github.repository == 'gradle/gradle'
    
        steps:
          - name: Checkout repository
            uses: actions/checkout@v6
          
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Tue Mar 24 22:05:21 GMT 2026
    - 2.6K bytes
    - Click Count (0)
  6. build-logic-commons/gradle-plugin/src/main/kotlin/gradlebuild.kotlin-shared-runtime.gradle.kts

        id("gradlebuild.detekt")
        id("gradlebuild.test-retry")
        id("gradlebuild.ci-reporting")
        id("gradlebuild.private-javadoc")
    }
    
    description = "A plugin that sets up a Kotlin DSL code that is shared between build-logic and runtime"
    
    java {
        sourceCompatibility = JavaVersion.VERSION_1_8
        targetCompatibility = JavaVersion.VERSION_1_8
    }
    
    kotlin {
        compilerOptions {
            allWarningsAsErrors = true
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Jan 22 14:28:13 GMT 2025
    - 869 bytes
    - Click Count (0)
  7. docs/de/docs/tutorial/dependencies/dependencies-in-path-operation-decorators.md

    ///
    
    /// info | Info
    
    In diesem Beispiel verwenden wir zwei erfundene benutzerdefinierte Header `X-Key` und `X-Token`.
    
    Aber in realen Fällen würden Sie bei der Implementierung von Sicherheit mehr Vorteile durch die Verwendung der integrierten [Sicherheits-Werkzeuge (siehe nächstes Kapitel)](../security/index.md) erzielen.
    
    ///
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 3.5K bytes
    - Click Count (0)
  8. cmd/format-erasure.go

    		panic(err)
    	}
    	return &dst
    }
    
    // Returns formatErasure.Erasure.Version
    func newFormatErasureV3(numSets int, setLen int) *formatErasureV3 {
    	format := &formatErasureV3{}
    	format.Version = formatMetaVersionV1
    	format.Format = formatBackendErasure
    	if setLen == 1 {
    		format.Format = formatBackendErasureSingle
    	}
    	format.ID = mustGetUUID()
    	format.Erasure.Version = formatErasureVersionV3
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 23.1K bytes
    - Click Count (0)
  9. cmd/prepare-storage.go

    			logger.Info("Waiting for a minimum of %d drives to come online (elapsed %s)\n",
    				(len(endpoints)/2)+1, getElapsedTime())
    		case errors.Is(err, errErasureV3ThisEmpty):
    			// need to wait for this error to be healed, so continue.
    		default:
    			// For all other unhandled errors we exit and fail.
    			return nil, nil, err
    		}
    
    		select {
    		case <-ticker.C:
    		case <-globalOSSignalCh:
    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)
  10. docs/debugging/hash-set/main.go

    	sum64 := siphash.Hash(k0, k1, []byte(key))
    	return int(sum64 % uint64(cardinality))
    }
    
    // hashOrder - hashes input key to return consistent
    // hashed integer slice. Returned integer order is salted
    // with an input key. This results in consistent order.
    // NOTE: collisions are fine, we are not looking for uniqueness
    // in the slices returned.
    func hashOrder(key string, cardinality int) []int {
    	if cardinality <= 0 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Sep 19 18:05:16 GMT 2022
    - 3.7K bytes
    - Click Count (0)
Back to Top