Search Options

Results per page
Sort
Preferred Languages
Advance

Results 421 - 430 of 918 for up (0.01 sec)

  1. tensorflow/c/eager/gradients.cc

      // Builds a tensor filled with ones with the same shape and dtype as `t`.
      absl::Status BuildOnesLike(const TapeTensor& t,
                                 AbstractTensorHandle** result) const override;
    
      // Looks up the ID of a Gradient.
      int64_t TensorId(AbstractTensorHandle* tensor) const override;
    
      // Converts a Gradient to a TapeTensor.
      TapeTensor TapeTensorFromGradient(AbstractTensorHandle* g) const override;
    
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 19.7K bytes
    - Viewed (0)
  2. docs/erasure/README.md

    MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data.
    
    ## What is Erasure Code?
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 4.1K bytes
    - Viewed (0)
  3. internal/etag/reader.go

    			src:      r,
    			md5:      NewUUIDHash(forceMD5),
    			checksum: etag,
    		}
    	}
    	return &Reader{
    		src:      r,
    		md5:      md5.New(),
    		checksum: etag,
    	}
    }
    
    // Read reads up to len(p) bytes from the underlying
    // io.Reader as specified by the io.Reader interface.
    func (r *Reader) Read(p []byte) (int, error) {
    	n, err := r.src.Read(p)
    	r.readN += int64(n)
    	r.md5.Write(p[:n])
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  4. RELEASE_BRANCHES.md

        * To trigger the bot cherry pick, either;
            * Apply the correct `cherrypick/release-X.XX` label to the PR, and the bot should pick it up.
            * Use an explicit PR comment command: `/cherry-pick release-X.XX`
            * It is strongly preferred to always apply the correct `cherrypick/` label manually to aid search and tracking, even if you use the comment command method.
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Sep 16 21:14:17 UTC 2024
    - 4.2K bytes
    - Viewed (0)
  5. cni/pkg/log/uds.go

    	mux.HandleFunc(constants.UDSLogPath, l.handleLog)
    	loggingServer := &http.Server{
    		Handler: mux,
    	}
    	l.loggingServer = loggingServer
    	pluginLog.SetOutputLevel(level)
    	return l
    }
    
    // StartUDSLogServer starts up a UDS server which receives log reported from CNI network plugin.
    func (l *UDSLogger) StartUDSLogServer(sockAddress string, stop <-chan struct{}) error {
    	if sockAddress == "" {
    		return nil
    	}
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Fri Jun 28 19:12:54 UTC 2024
    - 4.7K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/util/concurrent/ReflectionFreeAssertThrows.java

                  + " map in that class.");
        }
        Object result;
        try {
          result = supplier.get();
        } catch (Throwable t) {
          if (predicate.apply(t)) {
            // We are careful to set up INSTANCE_OF to match each Predicate to its target Class.
            @SuppressWarnings("unchecked")
            T caught = (T) t;
            return caught;
          }
          throw new AssertionError(
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 15:41:36 UTC 2024
    - 7K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/FarmHashFingerprint64Test.java

      private static long fingerprint(byte[] bytes, int length) {
        return HASH_FN.hashBytes(bytes, 0, length).asLong();
      }
    
      /**
       * Tests that the Java port of FarmHashFingerprint64 provides the same results on buffers up to
       * 800 bytes long as the C++ reference implementation.
       */
      public void testMultipleLengths() {
        int iterations = 800;
        byte[] buf = new byte[iterations * 4];
        int bufLen = 0;
        long h = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 6.2K bytes
    - Viewed (0)
  8. pyproject.toml

    [tool.ruff.lint]
    select = [
        "E",  # pycodestyle errors
        "W",  # pycodestyle warnings
        "F",  # pyflakes
        "I",  # isort
        "B",  # flake8-bugbear
        "C4",  # flake8-comprehensions
        "UP",  # pyupgrade
    ]
    ignore = [
        "E501",  # line too long, handled by black
        "B008",  # do not perform function calls in argument defaults
        "C901",  # too complex
        "W191",  # indentation contains tabs
    ]
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Oct 22 14:19:56 UTC 2024
    - 7.9K bytes
    - Viewed (0)
  9. .teamcity/mvnw.cmd

    @REM under the License.
    @REM ----------------------------------------------------------------------------
    
    @REM ----------------------------------------------------------------------------
    @REM Maven Start Up Batch script
    @REM
    @REM Required ENV vars:
    @REM JAVA_HOME - location of a JDK home dir
    @REM
    @REM Optional ENV vars
    @REM M2_HOME - location of maven2's installed home dir
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Wed Feb 26 01:48:39 UTC 2020
    - 6.5K bytes
    - Viewed (0)
  10. cmd/data-usage_test.go

    		},
    	}
    	createUsageTestFiles(t, base, bucket, files)
    	err = os.RemoveAll(filepath.Join(base, bucket, "dir1/dira/dirasub/dcfile"))
    	if err != nil {
    		t.Fatal(err)
    	}
    	// Changed dir must be picked up in this many cycles.
    	for i := 0; i < dataUsageUpdateDirCycles; i++ {
    		got, err = scanDataFolder(context.Background(), nil, &xls, got, getSize, 0, weSleep)
    		got.Info.NextCycle++
    		if err != nil {
    			t.Fatal(err)
    		}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 04 22:23:33 UTC 2024
    - 14.7K bytes
    - Viewed (0)
Back to top