mirror of
https://github.com/ETLCPP/etl.git
synced 2026-04-30 19:09:10 +08:00
333 lines
9.1 KiB
C++
333 lines
9.1 KiB
C++
/******************************************************************************
|
|
The MIT License(MIT)
|
|
|
|
Embedded Template Library.
|
|
https://github.com/ETLCPP/etl
|
|
https://www.etlcpp.com
|
|
|
|
Documentation:
|
|
|
|
Copyright(c) 2023 John Wellbelove
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files(the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions :
|
|
|
|
The above copyright notice and this permission notice shall be included in all
|
|
copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
SOFTWARE.
|
|
******************************************************************************/
|
|
|
|
#include "etl/platform.h"
|
|
|
|
#if ETL_USING_CPP20
|
|
|
|
#include "unit_test_framework.h"
|
|
|
|
#include "etl/chrono.h"
|
|
|
|
#include <chrono>
|
|
#include <array>
|
|
#include <algorithm>
|
|
|
|
namespace
|
|
{
|
|
SUITE(test_chrono_day)
|
|
{
|
|
//*************************************************************************
|
|
TEST(test_default_constructor)
|
|
{
|
|
std::chrono::day std_day;
|
|
etl::chrono::day day;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_constructor_in_range)
|
|
{
|
|
for (unsigned i = 0U; i < 256; ++i)
|
|
{
|
|
std::chrono::day std_day(i);
|
|
etl::chrono::day day(i);
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_pre_increment)
|
|
{
|
|
std::chrono::day std_day(0);
|
|
etl::chrono::day day(0);
|
|
|
|
for (int i = 0; i < 255; ++i)
|
|
{
|
|
++std_day;
|
|
++day;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_post_increment)
|
|
{
|
|
std::chrono::day std_day(0);
|
|
etl::chrono::day day(0);
|
|
|
|
for (int i = 0; i < 255; ++i)
|
|
{
|
|
std::chrono::day std_last_day = std_day++;
|
|
etl::chrono::day last_day = day++;
|
|
|
|
CHECK_EQUAL(std_last_day.ok(), last_day.ok());
|
|
CHECK_EQUAL(unsigned(std_last_day), unsigned(last_day));
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_pre_decrement)
|
|
{
|
|
std::chrono::day std_day(256);
|
|
etl::chrono::day day(256);
|
|
|
|
for (int i = 0; i < 255; ++i)
|
|
{
|
|
--std_day;
|
|
--day;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_post_decrement)
|
|
{
|
|
std::chrono::day std_day(256);
|
|
etl::chrono::day day(256);
|
|
|
|
for (int i = 0; i < 255; ++i)
|
|
{
|
|
std::chrono::day std_last_day = std_day--;
|
|
etl::chrono::day last_day = day--;
|
|
|
|
CHECK_EQUAL(std_last_day.ok(), last_day.ok());
|
|
CHECK_EQUAL(unsigned(std_last_day), unsigned(last_day));
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_plus_equal_days)
|
|
{
|
|
std::chrono::day std_day(0);
|
|
etl::chrono::day day(0);
|
|
|
|
std::chrono::days std_days(2);
|
|
etl::chrono::days days(2);
|
|
|
|
for (int i = 0; i < 128; ++i)
|
|
{
|
|
std_day += std_days;
|
|
day += days;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_day_plus_days)
|
|
{
|
|
for (int d = 0; d < 256; ++d)
|
|
{
|
|
for (int ds = 0; ds < 256; ++ds)
|
|
{
|
|
std::chrono::day std_day(d);
|
|
etl::chrono::day day(d);
|
|
|
|
std::chrono::days std_days(ds);
|
|
etl::chrono::days days(ds);
|
|
|
|
std_day = std_day + std_days;
|
|
day = day + days;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_days_plus_day)
|
|
{
|
|
for (int d = 0; d < 256; ++d)
|
|
{
|
|
for (int ds = 0; ds < 256; ++ds)
|
|
{
|
|
std::chrono::day std_day(d);
|
|
etl::chrono::day day(d);
|
|
|
|
std::chrono::days std_days(ds);
|
|
etl::chrono::days days(ds);
|
|
|
|
std_day = std_days + std_day;
|
|
day = days + day;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_minus_equal_days)
|
|
{
|
|
for (int d = 0; d <= 256; ++d)
|
|
{
|
|
for (int ds = 0; ds <= 256; ++ds)
|
|
{
|
|
std::chrono::day std_day(d);
|
|
etl::chrono::day day(d);
|
|
|
|
std::chrono::days std_days(ds);
|
|
etl::chrono::days days(ds);
|
|
|
|
std_day -= std_days;
|
|
day -= days;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_day_minus_days)
|
|
{
|
|
for (int d = 0; d <= 256; ++d)
|
|
{
|
|
for (int ds = 0; ds <= 256; ++ds)
|
|
{
|
|
std::chrono::day std_day(d);
|
|
etl::chrono::day day(d);
|
|
|
|
std::chrono::days std_days(ds);
|
|
etl::chrono::days days(ds);
|
|
|
|
std_day = std_day - std_days;
|
|
day = day - days;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_day_minus_day)
|
|
{
|
|
for (int d = 0; d < 256; ++d)
|
|
{
|
|
std::chrono::day std_day1(d);
|
|
std::chrono::day std_day2(255 - d);
|
|
|
|
std::chrono::day day1(d);
|
|
std::chrono::day day2(255 - d);
|
|
|
|
auto std_days12 = std_day1 - std_day2;
|
|
auto std_days21 = std_day2 - std_day1;
|
|
|
|
auto days12 = day1 - day2;
|
|
auto days21 = day2 - day1;
|
|
|
|
CHECK_EQUAL(std_days12.count(), days12.count());
|
|
CHECK_EQUAL(std_days21.count(), days21.count());
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_min_max_day)
|
|
{
|
|
CHECK_EQUAL(1U, etl::chrono::day::min());
|
|
CHECK_EQUAL(31U, etl::chrono::day::max());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_literal_day)
|
|
{
|
|
using namespace std::literals::chrono_literals;
|
|
using namespace etl::literals::chrono_literals;
|
|
|
|
std::chrono::day std_day = 25d;
|
|
etl::chrono::day day = 25_day;
|
|
|
|
CHECK_EQUAL(std_day.ok(), day.ok());
|
|
CHECK_EQUAL(unsigned(std_day), unsigned(day));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_day_comparison_operators)
|
|
{
|
|
etl::chrono::day day10(10);
|
|
etl::chrono::day day20(20);
|
|
|
|
CHECK_TRUE(day10 == day10);
|
|
CHECK_FALSE(day10 != day10);
|
|
CHECK_TRUE(day10 < day20);
|
|
CHECK_FALSE(day10 < day10);
|
|
CHECK_FALSE(day20 < day10);
|
|
CHECK_TRUE(day10 <= day20);
|
|
CHECK_TRUE(day10 <= day10);
|
|
CHECK_FALSE(day20 <= day10);
|
|
CHECK_FALSE(day10 > day20);
|
|
CHECK_FALSE(day10 > day10);
|
|
CHECK_TRUE(day20 > day10);
|
|
CHECK_FALSE(day10 >= day20);
|
|
CHECK_TRUE(day10 >= day10);
|
|
CHECK_TRUE(day20 >= day10);
|
|
|
|
#if ETL_USING_CPP20
|
|
CHECK_TRUE((day10 <=> day10) == 0);
|
|
CHECK_TRUE((day10 <=> day20) < 0);
|
|
CHECK_TRUE((day20 <=> day10) > 0);
|
|
#endif
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_day_hashes_are_unique)
|
|
{
|
|
std::vector<size_t> hashes;
|
|
|
|
for (int i = 0; i < 256; ++i)
|
|
{
|
|
hashes.push_back(etl::hash<etl::chrono::day>()(etl::chrono::day(i)));
|
|
}
|
|
|
|
std::sort(hashes.begin(), hashes.end());
|
|
(void)std::unique(hashes.begin(), hashes.end());
|
|
CHECK_EQUAL(256U, hashes.size());
|
|
}
|
|
};
|
|
}
|
|
|
|
#endif |