Merge pull request #714 from jpcima/linear-smoother-bypass
Smoother bypass when delay is short
This commit is contained in:
commit
c81805c545
1 changed files with 2 additions and 2 deletions
|
|
@ -87,8 +87,9 @@ void LinearSmoother::process(absl::Span<const float> input, absl::Span<float> ou
|
|||
|
||||
float current = current_;
|
||||
float target = target_;
|
||||
const int32_t smoothFrames = smoothFrames_;
|
||||
|
||||
if (canShortcut && current == target && current == input.front()) {
|
||||
if (smoothFrames < 2 || (canShortcut && current == target && current == input.front())) {
|
||||
if (input.data() != output.data())
|
||||
copy<float>(input, output);
|
||||
reset(input.back());
|
||||
|
|
@ -97,7 +98,6 @@ void LinearSmoother::process(absl::Span<const float> input, absl::Span<float> ou
|
|||
|
||||
float step = step_;
|
||||
// int32_t framesToTarget = framesToTarget_;
|
||||
const int32_t smoothFrames = smoothFrames_;
|
||||
|
||||
#if SIMDE_NATURAL_VECTOR_SIZE_GE(128)
|
||||
for (; i + 15 < count; i += 16) {
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue