mitchellhansen/Trac3r-rust
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

add doc

Browse Source
This commit is contained in:
mitchellhansen
2020-01-23 23:13:36 -08:00
parent dcc0df955e
commit 2bc9ebdc6b
31829 changed files with 1229378 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
doc/num/integer/sidebar-items.js Normal file
View File

@@ -0,0 +1 @@
initSidebarItems({"fn":[["binomial","Calculate the binomial coefficient."],["cbrt","Returns the truncated principal cube root of an integer -- see Roots::cbrt."],["div_ceil","Ceiled integer division"],["div_floor","Floored integer division"],["div_mod_floor","Simultaneous floored integer division and modulus"],["div_rem","Simultaneous integer division and modulus"],["gcd","Calculates the Greatest Common Divisor (GCD) of the number and `other`. The result is always positive."],["gcd_lcm","Calculates the Greatest Common Divisor (GCD) and Lowest Common Multiple (LCM) of the number and `other`."],["lcm","Calculates the Lowest Common Multiple (LCM) of the number and `other`."],["mod_floor","Floored integer modulus"],["multinomial","Calculate the multinomial coefficient."],["nth_root","Returns the truncated principal `n`th root of an integer -- see Roots::nth_root."],["sqrt","Returns the truncated principal square root of an integer -- see Roots::sqrt."]],"struct":[["ExtendedGcd","Greatest common divisor and Bézout coefficients"],["IterBinomial","An iterator over binomial coefficients."]],"trait":[["Integer",""],["Roots","Provides methods to compute an integer's square root, cube root, and arbitrary `n`th root."]]});