- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 94 for calculations (0.1 sec)
-
src/main/webapp/css/admin/bootstrap.min.css.map
1em,\n \"%\": 1%\n );\n @if ($dividend-unit != $divisor-unit and map-has-key($unit-map, $dividend-unit)) {\n $result: $result * map-get($unit-map, $dividend-unit);\n }\n @return $result;\n}\n\n// Remove px-unit from $rfs-base-font-size for calculations\n@if $rfs-base-font-size-unit == \"px\" {\n $rfs-base-font-size: divide($rfs-base-font-size, $rfs-base-font-size * 0 + 1);\n}\n@else if $rfs-base-font-size-unit == \"rem\" {\n $rfs-base-font-size: divide($rfs-base-font-size, divide($rfs-base-font-size...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 639.3K bytes - Viewed (0) -
docs/debugging/s3-check-md5/main.go
log.Println("FAILED: GET", objFullPath(object), "=>", err) failedMD5 = true break } h := md5.New() if _, err := io.Copy(h, obj); err != nil { log.Println("FAILED: MD5 calculation error:", objFullPath(object), "=>", err) failedMD5 = true break } partsMD5Sum = append(partsMD5Sum, h.Sum(nil)) } if failedMD5 {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat Feb 17 01:15:57 UTC 2024 - 6.3K bytes - Viewed (0) -
manifests/addons/dashboards/lib/output.json
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Tue Jun 04 18:05:06 UTC 2024 - 25.2K bytes - Viewed (0) -
manifests/addons/dashboards/pilot-dashboard.gen.json
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Fri Jul 26 23:54:32 UTC 2024 - 24.7K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/services/ChecksumAlgorithmService.java
/** * Returns the algorithm end result as string, never {@code null}. After invoking this method, this instance should * be discarded and not reused. For new checksum calculation you have to get new instance. */ @Nonnull String checksum(); }
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Wed Jul 10 20:52:34 UTC 2024 - 6.4K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
if d <= prevD { prevD = d setSize = cnt } } } return setSize } // possibleSetCountsWithSymmetry returns symmetrical setCounts based on the // input argument patterns, the symmetry calculation is to ensure that // we also use uniform number of drives common across all ellipses patterns. func possibleSetCountsWithSymmetry(setCounts []uint64, argPatterns []ellipses.ArgPattern) []uint64 {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Aug 14 17:11:51 UTC 2024 - 14.7K bytes - Viewed (0) -
RELEASE.md
Google discovered in mid-December 2017 that the PTX-to-SASS compiler in CUDA 9 and CUDA 9.1 sometimes does not properly compute the carry bit when decomposing 64-bit address calculations with large offsets (e.g. `load [x + large_constant]`) into 32-bit arithmetic in SASS. As a result, these versions of `ptxas` miscompile most XLA programs which
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Tue Oct 22 14:33:53 UTC 2024 - 735.3K bytes - Viewed (0) -
cmd/bootstrap-peer-server.go
func getBinaryChecksum() string { mw := md5.New() binPath, err := os.Executable() if err != nil { logger.Error("Calculating checksum failed: %s", err) return "00000000000000000000000000000000" } b, err := os.Open(binPath) if err != nil { logger.Error("Calculating checksum failed: %s", err) return "00000000000000000000000000000000" } defer b.Close() io.Copy(mw, b)
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 01 22:13:18 UTC 2024 - 8.4K bytes - Viewed (0) -
cmd/endpoint-ellipses_test.go
gotGCD := getDivisibleSize(testCase.totalSizes) if testCase.result != gotGCD { t.Errorf("Expected %v, got %v", testCase.result, gotGCD) } }) } } // Test tests calculating set indexes with ENV override for drive count. func TestGetSetIndexesEnvOverride(t *testing.T) { testCases := []struct { args []string totalSizes []uint64 indexes [][]uint64 envOverride uint64
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 15.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/Collections2Test.java
.size()); // Almost force an overflow in the binomial coefficient calculation assertEquals( 1391975640 /*C(34,14)*/, Collections2.orderedPermutations(concat(nCopies(20, 1), nCopies(14, 2))).size()); // Do force an overflow in the binomial coefficient calculation assertEquals( Integer.MAX_VALUE,
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Feb 21 10:16:44 UTC 2024 - 19.7K bytes - Viewed (0)