- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 1,343 for numbers (0.05 sec)
-
guava/src/com/google/common/hash/Hashing.java
* * <ul> * <li>You want to assign the same fraction of inputs to each bucket. * <li>When you reduce the number of buckets, you can accept that the most recently added * buckets will be removed first. More concretely, if you are dividing traffic among tasks, * you can decrease the number of tasks from 15 and 10, killing off the final 5 tasks, and
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:06:57 UTC 2025 - 31.1K bytes - Viewed (0) -
src/archive/tar/writer_test.go
if err != nil { t.Fatalf("os.Stat:1 %v", err) } hdr.Typeflag = TypeDir // Force a PAX long name to be written. The name was taken from a practical example // that fails and replaced ever char through numbers to anonymize the sample.Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Feb 03 16:38:43 UTC 2025 - 39.8K bytes - Viewed (0) -
src/main/webapp/js/admin/plugins/daterangepicker/daterangepicker.js
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 64.8K bytes - Viewed (0) -
fess-crawler-opensearch/src/main/java/org/codelibs/fess/crawler/service/impl/AbstractCrawlerService.java
} /** * Sets the number of shards for the OpenSearch index. * * @param numberOfShards The number of shards. */ public void setNumberOfShards(final int numberOfShards) { this.numberOfShards = numberOfShards; } /** * Sets the number of replicas for the OpenSearch index. * * @param numberOfReplicas The number of replicas. */Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Thu Aug 07 02:55:08 UTC 2025 - 34.2K bytes - Viewed (0) -
doc/go_spec.html
float32 the set of all IEEE 754 32-bit floating-point numbers float64 the set of all IEEE 754 64-bit floating-point numbers complex64 the set of all complex numbers with float32 real and imaginary parts complex128 the set of all complex numbers with float64 real and imaginary parts byte alias for uint8 rune alias for int32 </pre> <p>
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.10.md
using vSphere. ([#59328](https://github.com/kubernetes/kubernetes/pull/59328), [@divyenpatel](https://github.com/divyenpatel)) * Emit number of bound and unbound persistent volumes as Metrics. This PR adds four kinds of Volume Metrics for kube-controller-manager: bound PVC numbers, unbound PVC numbers, bound PV numbers and unbound PV numbers. The PVC metrics use namespace as dimension and the PV metrics use StorageClassName as its dimension. With these metrics we can better monitor the...
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu May 05 13:44:43 UTC 2022 - 341.8K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
"cmd/internal/objabi" "cmd/internal/src" "cmd/internal/sys" ) type Parser struct { lex lex.TokenReader lineNum int // Line number in source file. errorLine int // Line number of last error. errorCount int // Number of errors. sawCode bool // saw code in this file (as opposed to comments and blank lines) pc int64 // virtual PC; count of Progs; doesn't advance for GLOBL or DATA.Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 37.3K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
* href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater * than one</i> that cannot be factored into a product of <i>smaller</i> positive integers. * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be * factored into smaller positive integers). * * <p>To test larger numbers, use {@link BigInteger#isProbablePrime}. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 29 16:20:07 UTC 2025 - 46.8K bytes - Viewed (0) -
src/archive/tar/reader_test.go
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Thu Oct 03 15:48:09 UTC 2024 - 46.9K bytes - Viewed (0) -
cmd/object-api-utils.go
const sseDAREEncPackageBlockSize = SSEDAREPackageBlockSize + SSEDAREPackageMetaSize // Number of full blocks in skipped area seqNum = uint32(compOff / SSEDAREPackageBlockSize) // Skip this many inside a decrypted block to get to compression block start decryptSkip = compOff % SSEDAREPackageBlockSize // Skip this number of full blocks. skipEnc := compOff / SSEDAREPackageBlockSize
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Jun 25 15:08:54 UTC 2025 - 37.3K bytes - Viewed (0)