- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 112 for factor (0.04 sec)
-
src/cmd/asm/internal/asm/parse.go
return 0 } // term = factor | factor ('*' | '/' | '%' | '>>' | '<<' | '&') factor func (p *Parser) term() uint64 { value := p.factor() for { switch p.peek() { case '*': p.next() value *= p.factor() case '/': p.next() if int64(value) < 0 { p.errorf("divide of value with high bit set") } divisor := p.factor() if divisor == 0 {Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 37.3K bytes - Viewed (0) -
cmd/data-scanner.go
} } // Sleep sleeps the specified time multiplied by the sleep factor. // If the factor is updated the sleep will be done again with the new factor. func (d *dynamicSleeper) Sleep(ctx context.Context, base time.Duration) { for { // Grab current values d.mu.RLock() minWait, maxWait := d.minSleep, d.maxSleep factor := d.factor cycle := d.cycle d.mu.RUnlock()
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 45.5K bytes - Viewed (0) -
docs/compression/README.md
- Already compressed objects are not fit for compression since they do not have compressible patterns. Such objects do not produce efficient [`LZ compression`](https://en.wikipedia.org/wiki/LZ77_and_LZ78) which is a fitness factor for a lossless data compression. Pre-compressed input typically compresses in excess of 2GiB/s per core, so performance impact should be minimal even if precompressed data is re-compressed.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 5.2K bytes - Viewed (0) -
.teamcity/src/main/kotlin/model/FunctionalTestBucketGenerator.kt
splitIntoBuckets( LinkedList(subProjectTestClassTimes), SubprojectTestClassTime::totalTime, { largeElement, factor -> List(factor) { SmallSubprojectBucket(largeElement.subProject, parallelization(factor)) } }, { list -> SmallSubprojectBucket(list.map { it.subProject }, parallelization(1)) },
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Thu Apr 10 15:09:32 UTC 2025 - 7.3K bytes - Viewed (0) -
docs/en/docs/environment-variables.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 8.1K bytes - Viewed (0) -
docs/en/docs/tutorial/dependencies/classes-as-dependencies.md
Up to now you have seen dependencies declared as functions. But that's not the only way to declare dependencies (although it would probably be the more common). The key factor is that a dependency should be a "callable". A "**callable**" in Python is anything that Python can "call" like a function.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 6.7K bytes - Viewed (0) -
docs/distributed/DESIGN.md
- In this algorithm, we also make sure that we spread the drives out evenly. MinIO server expands ellipses passed as arguments. Here is a sample expansion to demonstrate the process.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Feb 26 09:25:50 UTC 2025 - 8K bytes - Viewed (2) -
docs/es/docs/tutorial/dependencies/classes-as-dependencies.md
Podemos hacerlo mejor... ## Qué hace a una dependencia Hasta ahora has visto dependencias declaradas como funciones. Pero esa no es la única forma de declarar dependencias (aunque probablemente sea la más común). El factor clave es que una dependencia debe ser un "callable". Un "**callable**" en Python es cualquier cosa que Python pueda "llamar" como una función.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Dec 30 18:26:57 UTC 2024 - 6.9K bytes - Viewed (0) -
docs/bn/docs/environment-variables.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Jun 05 08:15:56 UTC 2025 - 17.2K bytes - Viewed (0) -
docs/es/docs/environment-variables.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Dec 30 18:26:57 UTC 2024 - 8.3K bytes - Viewed (0)