mirror of
https://github.com/mollyim/webrtc.git
synced 2025-05-18 16:17:50 +01:00
c84f661b10
Googletest recently started replacing the term Test Case by Test Suite.
From now on, the preferred API is TestSuite*; the older TestCase* API
will be slowly deprecated.
This CL moves WebRTC to the new set of APIs.
More info in [1].
This CL has been generated with this script:
declare -A items
items[TYPED_TEST_CASE]=TYPED_TEST_SUITE
items[TYPED_TEST_CASE_P]=TYPED_TEST_SUITE_P
items[REGISTER_TYPED_TEST_CASE_P]=REGISTER_TYPED_TEST_SUITE_P
items[INSTANTIATE_TYPED_TEST_CASE_P]=INSTANTIATE_TYPED_TEST_SUITE_P
items[INSTANTIATE_TEST_CASE_P]=INSTANTIATE_TEST_SUITE_P
for i in "${!items[@]}"
do
git ls-files | xargs sed -i "s/\b$i\b/${items[$i]}/g"
done
git cl format
[1] - https://github.com/google/googletest/blob/master/googletest/docs/primer.md#beware-of-the-nomenclature
Bug: None
Change-Id: I5ae191e3046caf347aeee01554d5743548ab0e3f
Reviewed-on: https://webrtc-review.googlesource.com/c/118701
Commit-Queue: Mirko Bonadei <mbonadei@webrtc.org>
Reviewed-by: Karl Wiberg <kwiberg@webrtc.org>
Cr-Commit-Position: refs/heads/master@{#26494}
110 lines
3.7 KiB
C++
110 lines
3.7 KiB
C++
/*
|
|
* Copyright 2018 The WebRTC project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#include "algorithm"
|
|
#include "string"
|
|
#include "vector"
|
|
|
|
#include "api/array_view.h"
|
|
#include "rtc_base/gunit.h"
|
|
#include "rtc_base/helpers.h"
|
|
#include "rtc_base/unique_id_generator.h"
|
|
#include "test/gmock.h"
|
|
|
|
using ::testing::IsEmpty;
|
|
using ::testing::Test;
|
|
|
|
namespace rtc {
|
|
|
|
template <typename Generator>
|
|
class UniqueIdGeneratorTest : public Test {};
|
|
|
|
using test_types = ::testing::Types<UniqueNumberGenerator<uint8_t>,
|
|
UniqueNumberGenerator<uint16_t>,
|
|
UniqueNumberGenerator<uint32_t>,
|
|
UniqueRandomIdGenerator,
|
|
UniqueStringGenerator>;
|
|
|
|
TYPED_TEST_SUITE(UniqueIdGeneratorTest, test_types);
|
|
|
|
TYPED_TEST(UniqueIdGeneratorTest, ElementsDoNotRepeat) {
|
|
typedef TypeParam Generator;
|
|
const size_t num_elements = 255;
|
|
Generator generator;
|
|
std::vector<typename Generator::value_type> values;
|
|
for (size_t i = 0; i < num_elements; i++) {
|
|
values.push_back(generator());
|
|
}
|
|
|
|
EXPECT_EQ(num_elements, values.size());
|
|
// Use a set to check uniqueness.
|
|
std::set<typename Generator::value_type> set(values.begin(), values.end());
|
|
EXPECT_EQ(values.size(), set.size()) << "Returned values were not unique.";
|
|
}
|
|
|
|
TYPED_TEST(UniqueIdGeneratorTest, KnownElementsAreNotGenerated) {
|
|
typedef TypeParam Generator;
|
|
const size_t num_elements = 100;
|
|
rtc::InitRandom(0);
|
|
Generator generator1;
|
|
std::vector<typename Generator::value_type> known_values;
|
|
for (size_t i = 0; i < num_elements; i++) {
|
|
known_values.push_back(generator1());
|
|
}
|
|
EXPECT_EQ(num_elements, known_values.size());
|
|
|
|
rtc::InitRandom(0);
|
|
Generator generator2(known_values);
|
|
|
|
std::vector<typename Generator::value_type> values;
|
|
for (size_t i = 0; i < num_elements; i++) {
|
|
values.push_back(generator2());
|
|
}
|
|
EXPECT_THAT(values, ::testing::SizeIs(num_elements));
|
|
std::sort(values.begin(), values.end());
|
|
std::sort(known_values.begin(), known_values.end());
|
|
std::vector<typename Generator::value_type> intersection;
|
|
std::set_intersection(values.begin(), values.end(), known_values.begin(),
|
|
known_values.end(), std::back_inserter(intersection));
|
|
EXPECT_THAT(intersection, IsEmpty());
|
|
}
|
|
|
|
TYPED_TEST(UniqueIdGeneratorTest, AddedElementsAreNotGenerated) {
|
|
typedef TypeParam Generator;
|
|
const size_t num_elements = 100;
|
|
rtc::InitRandom(0);
|
|
Generator generator1;
|
|
std::vector<typename Generator::value_type> known_values;
|
|
for (size_t i = 0; i < num_elements; i++) {
|
|
known_values.push_back(generator1());
|
|
}
|
|
EXPECT_EQ(num_elements, known_values.size());
|
|
|
|
rtc::InitRandom(0);
|
|
Generator generator2;
|
|
|
|
for (const typename Generator::value_type& value : known_values) {
|
|
generator2.AddKnownId(value);
|
|
}
|
|
|
|
std::vector<typename Generator::value_type> values;
|
|
for (size_t i = 0; i < num_elements; i++) {
|
|
values.push_back(generator2());
|
|
}
|
|
EXPECT_THAT(values, ::testing::SizeIs(num_elements));
|
|
std::sort(values.begin(), values.end());
|
|
std::sort(known_values.begin(), known_values.end());
|
|
std::vector<typename Generator::value_type> intersection;
|
|
std::set_intersection(values.begin(), values.end(), known_values.begin(),
|
|
known_values.end(), std::back_inserter(intersection));
|
|
EXPECT_THAT(intersection, IsEmpty());
|
|
}
|
|
|
|
} // namespace rtc
|