Lines Matching defs:part
11 // The classic algorithm: for every part, multiply the accumulator with
12 // the appropriate multiplier, and add the part. O(n²) overall.
15 // We always have at least one part to process.
52 // part is left. The benefit is that the multiplications will have inputs of
57 // - We can skip the multiplier for the first part, because we never need it.
130 // Trailing last part (if {num_parts} was odd).
185 // Trailing last part (if {num_parts} was odd).
218 // in the last part.
224 // - A maximally populated part stores a non-fractional number of characters,
226 // - The populated bits in a part are at the low end.
227 // - The number of unused bits in the last part is stored in
259 // If the last part is fully populated, then all parts must be, and we can
276 // Holds the last part that we read from {parts}...
277 digit_t part;
281 part = parts[part_index--];
283 digit |= part << digit_bits;
287 part = 0;
292 part >>= part_shift;
297 digit = part;