- Sort Score
- Result 10 results
- Languages All
Results 71 - 72 of 72 for qsub (0.03 sec)
-
src/go/printer/printer.go
return min(n, maxNewlines) } func mayCombine(prev token.Token, next byte) (b bool) { switch prev { case token.INT: b = next == '.' // 1. case token.ADD: b = next == '+' // ++ case token.SUB: b = next == '-' // -- case token.QUO: b = next == '*' // /* case token.LSS: b = next == '-' || next == '<' // <- or << case token.AND: b = next == '&' || next == '^' // && or &^ } return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 41.6K bytes - Viewed (0) -
src/math/big/natdiv.go
Burnikel and Ziegler's “Fast Recursive Division” introduced the key insight of implementing division by an n-digit divisor using recursive calls to division by an n/2-digit divisor, relying on Karatsuba multiplication to yield a sub-quadratic run time. However, the presentation decisions are made almost entirely for the purpose of simplifying the run-time analysis, rather than simplifying the presentation. Instead of a single algorithm that loops over
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0)