Lines Matching defs:n_
433 : n_(n), K_(K), length_(K + 1), processor_(processor) {
434 storage_ = new digit_t[length_ * n_];
435 part_ = new digit_t*[n_];
472 const int n_; // Number of parts.
497 for (; i < n_ && len > 0; i++, current_theta += theta) {
499 // For invocations via MultiplyFFT_Inner, X.len() == n_ * chunk_size + 1,
502 // corner case where X[n_ * chunk_size] == 1. Detect that case, and handle
504 if (i == n_ - 1 && len == chunk_size + 1) {
505 DCHECK(X[n_ * chunk_size] <= 1);
521 for (; i < n_; i++) {
524 FFT_ReturnShuffledThreadsafe(0, n_, omega, temp_);
531 if (len > n_ * chunk_size / 2) {
537 int nhalf = n_ / 2;
618 const int shift = n_ * omega - m;
619 for (int i = 0; i < n_; i++, z_index += chunk_size) {
654 for (int k = 0; k < n_; k++, z_index += s) {
656 if (shift < 0) shift += 2 * n_ * theta;
753 DCHECK(n_ == other.n_);
754 DoPointwiseMultiplication(other, 0, n_, temp_);