OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 #include "webrtc/modules/audio_processing/test/echo_canceller_test_tools.h" | 11 #include "webrtc/modules/audio_processing/test/echo_canceller_test_tools.h" |
12 | 12 |
13 #include "webrtc/rtc_base/checks.h" | 13 #include "webrtc/base/checks.h" |
14 | 14 |
15 namespace webrtc { | 15 namespace webrtc { |
16 | 16 |
17 void RandomizeSampleVector(Random* random_generator, rtc::ArrayView<float> v) { | 17 void RandomizeSampleVector(Random* random_generator, rtc::ArrayView<float> v) { |
18 for (auto& v_k : v) { | 18 for (auto& v_k : v) { |
19 v_k = 2 * 32767.f * random_generator->Rand<float>() - 32767.f; | 19 v_k = 2 * 32767.f * random_generator->Rand<float>() - 32767.f; |
20 } | 20 } |
21 } | 21 } |
22 | 22 |
23 template <typename T> | 23 template <typename T> |
24 void DelayBuffer<T>::Delay(rtc::ArrayView<const T> x, | 24 void DelayBuffer<T>::Delay(rtc::ArrayView<const T> x, |
25 rtc::ArrayView<T> x_delayed) { | 25 rtc::ArrayView<T> x_delayed) { |
26 RTC_DCHECK_EQ(x.size(), x_delayed.size()); | 26 RTC_DCHECK_EQ(x.size(), x_delayed.size()); |
27 if (buffer_.size() == 0) { | 27 if (buffer_.size() == 0) { |
28 std::copy(x.begin(), x.end(), x_delayed.begin()); | 28 std::copy(x.begin(), x.end(), x_delayed.begin()); |
29 } else { | 29 } else { |
30 for (size_t k = 0; k < x.size(); ++k) { | 30 for (size_t k = 0; k < x.size(); ++k) { |
31 x_delayed[k] = buffer_[next_insert_index_]; | 31 x_delayed[k] = buffer_[next_insert_index_]; |
32 buffer_[next_insert_index_] = x[k]; | 32 buffer_[next_insert_index_] = x[k]; |
33 next_insert_index_ = (next_insert_index_ + 1) % buffer_.size(); | 33 next_insert_index_ = (next_insert_index_ + 1) % buffer_.size(); |
34 } | 34 } |
35 } | 35 } |
36 } | 36 } |
37 | 37 |
38 template class DelayBuffer<float>; | 38 template class DelayBuffer<float>; |
39 template class DelayBuffer<int>; | 39 template class DelayBuffer<int>; |
40 } // namespace webrtc | 40 } // namespace webrtc |
OLD | NEW |