- Sort Score
- Result 10 results
- Languages All
Results 61 - 64 of 64 for Floor (0.05 sec)
-
src/math/big/natdiv.go
Multi-precision division. Here be dragons. Given u and v, where u is n+m digits, and v is n digits (with no leading zeros), the goal is to return quo, rem such that u = quo*v + rem, where 0 ≤ rem < v. That is, quo = ⌊u/v⌋ where ⌊x⌋ denotes the floor (truncation to integer) of x, and rem = u - quo·v. Long Division Division in a computer proceeds the same as long division in elementary school,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/PPC64Ops.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 43.8K bytes - Viewed (0) -
pkg/controller/controller_utils.go
// // Given a number of pods to start "N": // The number of doomed calls per sync once quota is exceeded is given by: // min(N,SlowStartInitialBatchSize) // The number of batches is given by: // 1+floor(log_2(ceil(N/SlowStartInitialBatchSize))) SlowStartInitialBatchSize = 1 ) var UpdateTaintBackoff = wait.Backoff{ Steps: 5, Duration: 100 * time.Millisecond, Jitter: 1.0, }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jan 12 15:34:44 UTC 2024 - 47.6K bytes - Viewed (0)