Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 66 for linear (0.08 sec)

  1. docs/metrics/prometheus/grafana/bucket/minio-bucket.json

                "barAlignment": 0,
                "drawStyle": "line",
                "fillOpacity": 10,
                "gradientMode": "none",
                "hideFrom": {
                  "legend": false,
                  "tooltip": false,
                  "viz": false
                },
                "insertNulls": false,
                "lineInterpolation": "linear",
                "lineWidth": 1,
                "pointSize": 5,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 11:11:51 UTC 2024
    - 101.8K bytes
    - Viewed (0)
  2. docs/metrics/prometheus/grafana/replication/minio-replication-node.json

                "barAlignment": 0,
                "drawStyle": "line",
                "fillOpacity": 10,
                "gradientMode": "none",
                "hideFrom": {
                  "legend": false,
                  "tooltip": false,
                  "viz": false
                },
                "insertNulls": false,
                "lineInterpolation": "linear",
                "lineWidth": 1,
                "pointSize": 5,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jun 13 22:26:54 UTC 2024
    - 57.4K bytes
    - Viewed (0)
  3. docs/metrics/prometheus/grafana/minio-dashboard.json

                  "tooltip": false,
                  "viz": false
                },
                "insertNulls": false,
                "lineInterpolation": "linear",
                "lineWidth": 1,
                "pointSize": 5,
                "scaleDistribution": {
                  "type": "linear"
                },
                "showPoints": "never",
                "spanNulls": false,
                "stacking": {
                  "group": "A",
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jul 24 14:51:03 UTC 2024
    - 93K bytes
    - Viewed (0)
  4. docs/metrics/prometheus/grafana/node/minio-node.json

                "barAlignment": 0,
                "drawStyle": "line",
                "fillOpacity": 10,
                "gradientMode": "none",
                "hideFrom": {
                  "legend": false,
                  "tooltip": false,
                  "viz": false
                },
                "insertNulls": false,
                "lineInterpolation": "linear",
                "lineWidth": 1,
                "pointSize": 5,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jun 04 13:24:37 UTC 2024
    - 22.4K bytes
    - Viewed (0)
  5. src/main/webapp/css/admin/adminlte.min.css

    ght:15px;top:15px;transition:-webkit-transform .3s linear;transition:transform .3s linear;transition:transform .3s linear,-webkit-transform .3s linear}.small-box .icon>i.fa,.small-box .icon>i.fab,.small-box .icon>i.fad,.small-box .icon>i.fal,.small-box .icon>i.far,.small-box .icon>i.fas,.small-box .icon>i.ion{font-size:70px;top:20px}.small-box .icon svg{font-size:70px;position:absolute;right:15px;top:15px;transition:-webkit-transform .3s linear;transition:transform .3s linear;transition:transform...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 1.3M bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/escape/ArrayBasedEscaperMap.java

      // Returns the non-null array of replacements for fast lookup.
      char[][] getReplacementArray() {
        return replacementArray;
      }
    
      // Creates a replacement array from the given map. The returned array is a
      // linear lookup table of replacement character sequences indexed by the
      // original character value.
      @VisibleForTesting
      static char[][] createReplacementArray(Map<Character, String> map) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/TopKSelector.java

        }
        return this;
      }
    
      /**
       * Adds each member of {@code elements} as a candidate for the top {@code k} elements. This
       * operation takes amortized linear time in the length of {@code elements}.
       *
       * <p>If all input data to this {@code TopKSelector} is in a single {@code Iterable}, prefer
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  8. src/main/webapp/css/admin/adminlte.min.css.map

    background-color: inherit !important;\n}\n\n[data-widget=\"expandable-table\"] {\n  cursor: pointer;\n}\n\n[data-widget=\"expandable-table\"] i.expandable-table-caret {\n  transition: -webkit-transform 0.3s linear;\n  transition: transform 0.3s linear;\n  transition: transform 0.3s linear, -webkit-transform 0.3s linear;\n}\n\n[data-widget=\"expandable-table\"][aria-expanded=\"true\"] i.expandable-table-caret[class*=\"right\"] {\n  -webkit-transform: rotate(90deg);\n  transform: rotate(90deg);\n}\n\n[data-widg...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 3.7M bytes
    - Viewed (1)
  9. android/guava/src/com/google/common/collect/SortedLists.java

        checkNotNull(presentBehavior);
        checkNotNull(absentBehavior);
        if (!(list instanceof RandomAccess)) {
          list = new ArrayList<>(list);
        }
        // TODO(lowasser): benchmark when it's best to do a linear search
    
        int lower = 0;
        int upper = list.size() - 1;
    
        while (lower <= upper) {
          int middle = (lower + upper) >>> 1;
          int c = comparator.compare(key, list.get(middle));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 11K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/SortedLists.java

        checkNotNull(presentBehavior);
        checkNotNull(absentBehavior);
        if (!(list instanceof RandomAccess)) {
          list = new ArrayList<>(list);
        }
        // TODO(lowasser): benchmark when it's best to do a linear search
    
        int lower = 0;
        int upper = list.size() - 1;
    
        while (lower <= upper) {
          int middle = (lower + upper) >>> 1;
          int c = comparator.compare(key, list.get(middle));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 11K bytes
    - Viewed (0)
Back to top