This distribution implements faster divmod() (and .mod()) operations for moduli with a large number of trailing 0 bits (where the div/mod base is divisible by 2 ** n for an integer n). It should yield ...
This PEP describes an extension to the built-in divmod() function, allowing it to take multiple divisors, chaining several calls to divmod() into one. This PEP is rejected. Most uses for chained ...
一部の結果でアクセス不可の可能性があるため、非表示になっています。
アクセス不可の結果を表示する