servius/rapr-rs
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Initial docs commit

Browse Source
This commit is contained in:
Uttarayan Mondal
2021-03-15 01:27:34 +05:30
commit d5ecda4c73
20211 changed files with 1370362 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/num_integer/sidebar-items.js
+1
View File
@@ -0,0 +1 @@
initSidebarItems({"fn":[["average_ceil","Returns the ceiling value of the average of `x` and `y` – see Average::average_ceil."],["average_floor","Returns the floor value of the average of `x` and `y` – see Average::average_floor."],["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":[["Average","Provides methods to compute the average of two integers, without overflows."],["Integer",""],["Roots","Provides methods to compute an integer’s square root, cube root, and arbitrary `n`th root."]]});