Scarfski/entt
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

test: minor changes (linter)

Browse Source
This commit is contained in:
Michele Caini
2024-06-06 10:58:31 +02:00
parent 8062bcfb3c
commit 339b78f47c
1 changed files with 7 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
test/entt/core/algorithm.cpp
View File

@@ -1,3 +1,4 @@
#include <algorithm>
#include <array>
#include <cstddef>
#include <vector>
@@ -12,9 +13,7 @@ TEST(Algorithm, StdSort) {
sort(arr.begin(), arr.end());
for(std::size_t pos{}, last = arr.size() - 1u; pos < last; ++pos) {
ASSERT_LT(arr[pos], arr[pos + 1u]);
}
ASSERT_TRUE(std::is_sorted(arr.begin(), arr.end()));
}
TEST(Algorithm, StdSortBoxedInt) {
@@ -26,9 +25,7 @@ TEST(Algorithm, StdSortBoxedInt) {
return lhs.value > rhs.value;
});
for(std::size_t pos{}, last = arr.size() - 1u; pos < last; ++pos) {
ASSERT_GT(arr[pos].value, arr[pos + 1u].value);
}
ASSERT_TRUE(std::is_sorted(arr.rbegin(), arr.rend()));
}
TEST(Algorithm, StdSortEmptyContainer) {
@@ -44,9 +41,7 @@ TEST(Algorithm, InsertionSort) {
sort(arr.begin(), arr.end());
for(std::size_t pos{}, last = arr.size() - 1u; pos < last; ++pos) {
ASSERT_LT(arr[pos], arr[pos + 1u]);
}
ASSERT_TRUE(std::is_sorted(arr.begin(), arr.end()));
}
TEST(Algorithm, InsertionSortBoxedInt) {
@@ -57,9 +52,7 @@ TEST(Algorithm, InsertionSortBoxedInt) {
return lhs.value > rhs.value;
});
for(std::size_t pos{}, last = arr.size() - 1u; pos < last; ++pos) {
ASSERT_GT(arr[pos].value, arr[pos + 1u].value);
}
ASSERT_TRUE(std::is_sorted(arr.rbegin(), arr.rend()));
}
TEST(Algorithm, InsertionSortEmptyContainer) {
@@ -77,9 +70,7 @@ TEST(Algorithm, RadixSort) {
return value;
});
for(std::size_t pos{}, last = arr.size() - 1u; pos < last; ++pos) {
ASSERT_LT(arr[pos], arr[pos + 1u]);
}
ASSERT_TRUE(std::is_sorted(arr.begin(), arr.end()));
}
TEST(Algorithm, RadixSortBoxedInt) {
@@ -90,9 +81,7 @@ TEST(Algorithm, RadixSortBoxedInt) {
return instance.value;
});
for(std::size_t pos{}, last = arr.size() - 1u; pos < last; ++pos) {
ASSERT_GT(arr[pos].value, arr[pos + 1u].value);
}
ASSERT_TRUE(std::is_sorted(arr.rbegin(), arr.rend()));
}
TEST(Algorithm, RadixSortEmptyContainer) {