setBasedir(java.io.File); public java.io.File getBasedir(); public void setCaseSensitive(boolean); public void setFollowSymlinks(boolean); public void setIncludes(String[]); public void setExcludes(String[]); public boolean isEverythingIncluded(); public void scan() throws IllegalStateExceptio; protected void slowScan(); protected void scandir(java.io.File, String, boolean); protected boolean isIncluded(String); protected boolean couldHoldIncluded(String); protected boolean isExcluded(String); protected boolean...

			},
			{
				Description: MetricDescription{
					Namespace: nodeMetricNamespace,
					Subsystem: scannerSubsystem,
					Name:      "bucket_scans_started",
					Help:      "Total number of bucket scans started since server start",
					Type:      counterMetric,
				},
				Value: float64(globalScannerMetrics.lifetime(scannerMetricScanBucketDrive) + uint64(globalScannerMetrics.activeDrives())),

          "interval": "1m",
          "legendFormat": "{{server}}",
          "refId": "A"
        }
      ],
      "title": "Time Elapsed Since Last Scan (nanos)",
      "type": "timeseries"
    },
    {
      "datasource": {
        "type": "prometheus",
        "uid": "${DS_PROMETHEUS}"
      },
      "fieldConfig": {
        "defaults": {

to set the # minimum number of available replicas to 1, you can update this value as follows: # # podDisruptionBudget: # minAvailable: 1 # # Or, to allow a maximum of 1 unavailable replica, you can set: # # podDisruptionBudget: # maxUnavailable: 1 # # You can also specify the `unhealthyPodEviction` field, and the valid values are `IfHealthyBudget` and `AlwaysAllow`. # For example, to set the `unhealthyPodEviction` to `AlwaysAllow`, you can update this value as follows: # # podDisruptionBudget: # minAvailable:...

 *       block or a {@link ListenableFuture}.
 *   <li>Each other step is derived from one or more input steps. At each step, zero or more objects
 *       can be captured for later closing.
 *   <li>There is one last step (the root of the tree), from which you can extract the final result
 *       of the computation. After that result is available (or the computation fails), all objects

          <version>3.0.0+</version>
          <description>The link to a URL where you can browse the mailing list archive.</description>
          <type>String</type>
        </field>
        <field>
          <name>otherArchives</name>
          <version>3.0.0+</version>
          <description>The link to alternate URLs where you can browse the list archive.</description>
          <association>

- Introduced a feature gate mechanism to `client-go`. Depending on the actual implementation, users can control features via environmental variables or command line options. ([#122555](https://github.com/kubernetes/kubernetes/pull/122555), [@p0lyn0mial](https://github.com/p0lyn0mial))

// Copyright (c) 2015-2023 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

            Doc(
                """
                A list of tags used by OpenAPI, these are the same `tags` you can set
                in the *path operations*, like:

                * `@app.get("/users/", tags=["users"])`
                * `@app.get("/items/", tags=["items"])`

                The order of the tags can be used to specify the order shown in
                tools like Swagger UI, used in the automatic path `/docs`.

    }

    // Guarded By Segment.this
    <K, V> void copyAccessEntry(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newEntry) {
      // TODO(fry): when we link values instead of entries this method can go
      // away, as can connectAccessOrder, nullifyAccessOrder.
      newEntry.setAccessTime(original.getAccessTime());

      connectAccessOrder(original.getPreviousInAccessQueue(), newEntry);