cfff799d604ea57385ea2c0e49d6ed9662a38a17,librosa/core/constantq.py,,cqt,#Any#Any#Any#Any#Any#Any#Any#Any#Any#Any#Any#,22

Before Change

        res_type = "sinc_fastest"

    // Make sure our hop is long enough to support the bottom octave
    if np.mod(hop_length, 2**n_octaves) != 0 or hop_length < 2**n_octaves:
        raise ParameterError("hop_length must be a positive integer multiple of 2^{0:d} "
                            "for {0:d}-octave CQT".format(n_octaves))

    // Now do the recursive bit
    fft_basis, n_fft, filter_lengths = __fft_filters(sr, fmin_t,
                                                     n_filters,
                                                     bins_per_octave,
                                                     tuning,

After Change

    // Make sure our hop is long enough to support the bottom octave
    num_twos = __num_two_factors(hop_length)
    if num_twos < n_octaves - 1:
        raise ParameterError("hop_length must be a positive integer multiple of 2^{0:d} "
                            "for {1:d}-octave CQT".format(n_octaves - 1, n_octaves))

    // Now do the recursive bit
    fft_basis, n_fft, filter_lengths = __fft_filters(sr, fmin_t,
                                                     n_filters,
                                                     bins_per_octave,
                                                     tuning,

Instances