Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1371 - 1380 of 1,415 for Stable (0.05 sec)

  1. src/archive/tar/writer_test.go

    				Uid:      1000,
    				Gid:      1000,
    				Uname:    "rawr",
    				Gname:    "dsnet",
    				ModTime:  time.Unix(0, 0),
    				Format:   FormatGNU,
    			}, nil},
    			testClose{nil},
    		},
    		// TODO(dsnet): Re-enable this test when adding sparse support.
    		// See https://golang.org/issue/22735
    		/*
    			}, {
    				file: "testdata/gnu-nil-sparse-data.tar",
    				tests: []testFnc{
    					testHeader{Header{
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Sep 23 14:32:33 UTC 2024
    - 39.4K bytes
    - Viewed (0)
  2. docs/metrics/prometheus/grafana/replication/minio-replication-cluster.json

    {
      "annotations": {
        "list": [
          {
            "builtIn": 1,
            "datasource": {
              "type": "datasource",
              "uid": "grafana"
            },
            "enable": true,
            "hide": true,
            "iconColor": "rgba(0, 211, 255, 1)",
            "name": "Annotations & Alerts",
            "type": "dashboard"
          }
        ]
      },
     "__inputs": [
        { 
          "name": "DS_PROMETHEUS",
          "label": "Prometheus",
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Mar 28 17:15:39 UTC 2024
    - 71.1K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/hash/BloomFilter.java

        this.strategy = checkNotNull(strategy);
      }
    
      /**
       * Creates a new {@code BloomFilter} that's a copy of this instance. The new instance is equal to
       * this instance but shares no mutable state.
       *
       * @since 12.0
       */
      public BloomFilter<T> copy() {
        return new BloomFilter<>(bits.copy(), numHashFunctions, funnel, strategy);
      }
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 23 16:45:30 UTC 2024
    - 26.6K bytes
    - Viewed (0)
  4. src/archive/tar/common.go

    	}
    	for k, v := range paxHdrs {
    		if !validPAXRecord(k, v) {
    			return FormatUnknown, nil, headerError{fmt.Sprintf("invalid PAX record: %q", k+" = "+v)}
    		}
    	}
    
    	// TODO(dsnet): Re-enable this when adding sparse support.
    	// See https://golang.org/issue/22735
    	/*
    		// Check sparse files.
    		if len(h.SparseHoles) > 0 || h.Typeflag == TypeGNUSparse {
    			if isHeaderOnlyType(h.Typeflag) {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 13 21:03:27 UTC 2024
    - 24.5K bytes
    - Viewed (0)
  5. src/main/webapp/css/font-awesome.min.css

    a-symfony:before{content:"\f83d"}.fa-synagogue:before{content:"\f69b"}.fa-sync:before{content:"\f021"}.fa-sync-alt:before{content:"\f2f1"}.fa-syringe:before{content:"\f48e"}.fa-table:before{content:"\f0ce"}.fa-table-tennis:before{content:"\f45d"}.fa-tablet:before{content:"\f10a"}.fa-tablet-alt:before{content:"\f3fa"}.fa-tablets:before{content:"\f490"}.fa-tachometer-alt:before{content:"\f3fd"}.fa-tag:before{content:"\f02b"}.fa-tags:before{content:"\f02c"}.fa-tape:before{content:"\f4db"}.fa-tasks:...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (1)
  6. cmd/object-multipart-handlers.go

    		md5hex = "" // Do not try to verify the content.
    		sha256hex = ""
    	}
    
    	var forceMD5 []byte
    	// Optimization: If SSE-KMS and SSE-C did not request Content-Md5. Use uuid as etag. Optionally enable this also
    	// for server that is started with `--no-compat`.
    	if !etag.ContentMD5Requested(r.Header) && (crypto.S3KMS.IsEncrypted(mi.UserDefined) || crypto.SSEC.IsRequested(r.Header) || !globalServerCtxt.StrictS3Compat) {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Aug 31 18:25:48 UTC 2024
    - 39.2K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/LongMath.java

        }
        throw new AssertionError();
      }
    
      @GwtIncompatible // TODO
      static int log10Floor(long x) {
        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  8. src/main/webapp/js/admin/popper.min.js.map

    (!nodeName || nodeName === 'BODY' || nodeName === 'HTML') {\n    return element ? element.ownerDocument.documentElement : document.documentElement;\n  }\n\n  // .offsetParent will return the closest TH, TD or TABLE in case\n  // no offsetParent is present, I hate this job...\n  if (\n    ['TH', 'TD', 'TABLE'].indexOf(offsetParent.nodeName) !== -1 &&\n    getStyleComputedProperty(offsetParent, 'position') === 'static'\n  ) {\n    return getOffsetParent(offsetParent);\n  }\n\n  return offsetParent;\n}\n","import...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 120.9K bytes
    - Viewed (0)
  9. tensorflow/c/eager/c_api_test.cc

    #endif  // PLATFORM_WINDOWS
    }
    TEST(CAPI, ExecuteAdd) {
      ExecuteAdd(
          /*async=*/false,
          /*forward_input*/ false,
          /*tfrt*/ false);
    }
    // TODO(b/234067483): Investigate flakiness and re-enable.
    TEST(CAPI, DISABLED_ExecuteAddAsync) {
      ExecuteAdd(
          /*async=*/true,
          /*forward_input*/ false,
          /*tfrt*/ false);
    }
    TEST(CAPI, ExecuteAddForward) {
      ExecuteAdd(
          /*async=*/false,
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Aug 03 20:50:20 UTC 2023
    - 94.6K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/math/LongMath.java

        }
        throw new AssertionError();
      }
    
      @GwtIncompatible // TODO
      static int log10Floor(long x) {
        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
Back to top