| ... | ... | @@ -935,9 +935,6 @@ pub const Mutable = struct { |
| 935 | 935 | /// The upper bound for r limb count is `b.limbs.len`. |
| 936 | 936 | /// The upper bound for q limb count is given by `a.limbs`. |
| 937 | 937 | /// |
| 938 | | /// If `allocator` is provided, it will be used for temporary storage to improve |
| 939 | | /// multiplication performance. `error.OutOfMemory` is handled with a fallback algorithm. |
| 940 | | /// |
| 941 | 938 | /// `limbs_buffer` is used for temporary storage. The amount required is given by `calcDivLimbsBufferLen`. |
| 942 | 939 | pub fn divFloor( |
| 943 | 940 | q: *Mutable, |
| ... | ... | @@ -1065,9 +1062,6 @@ pub const Mutable = struct { |
| 1065 | 1062 | /// The upper bound for r limb count is `b.limbs.len`. |
| 1066 | 1063 | /// The upper bound for q limb count is given by `a.limbs.len`. |
| 1067 | 1064 | /// |
| 1068 | | /// If `allocator` is provided, it will be used for temporary storage to improve |
| 1069 | | /// multiplication performance. `error.OutOfMemory` is handled with a fallback algorithm. |
| 1070 | | /// |
| 1071 | 1065 | /// `limbs_buffer` is used for temporary storage. The amount required is given by `calcDivLimbsBufferLen`. |
| 1072 | 1066 | pub fn divTrunc( |
| 1073 | 1067 | q: *Mutable, |