mirror of
https://github.com/ETLCPP/etl.git
synced 2026-06-16 17:06:05 +08:00
5803d928a1
# Conflicts: # include/etl/stl/alternate/algorithm.h # include/etl/stl/alternate/iterator.h # include/etl/version.h # library.json # library.properties # support/Release notes.txt # test/test_no_stl_algorithm.cpp # test/test_no_stl_iterator.cpp # test/vs2017/etl.vcxproj
254 lines
7.9 KiB
C++
254 lines
7.9 KiB
C++
/******************************************************************************
|
|
The MIT License(MIT)
|
|
|
|
Embedded Template Library.
|
|
https://github.com/ETLCPP/etl
|
|
https://www.etlcpp.com
|
|
|
|
Copyright(c) 2018 jwellbelove
|
|
|
|
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 "UnitTest++.h"
|
|
|
|
#undef min
|
|
#undef max
|
|
|
|
#include "etl/stl/iterator.h"
|
|
#include "etl/stl/alternate/iterator.h"
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
#include <list>
|
|
|
|
#include "no_stl_test_iterators.h"
|
|
|
|
namespace
|
|
{
|
|
const size_t SIZE = 10;
|
|
|
|
int dataA[SIZE] = { 2, 1, 4, 3, 6, 5, 8, 7, 10, 9 };
|
|
|
|
SUITE(test_no_stl_iterator)
|
|
{
|
|
//*************************************************************************
|
|
TEST(distance_non_random)
|
|
{
|
|
ptrdiff_t d = etlstd::distance(non_random_iterator<int>(&dataA[0]), non_random_iterator<int>(&dataA[SIZE]));
|
|
|
|
CHECK_EQUAL(SIZE, d);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(distance_random)
|
|
{
|
|
ptrdiff_t d = etlstd::distance(random_iterator<int>(&dataA[0]), random_iterator<int>(&dataA[SIZE]));
|
|
|
|
CHECK_EQUAL(SIZE, d);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(advance_non_random)
|
|
{
|
|
int* itr1 = std::begin(dataA);
|
|
non_random_iterator<int> itr2 = std::begin(dataA);
|
|
|
|
std::advance(itr1, 4);
|
|
etlstd::advance(itr2, 4);
|
|
CHECK_EQUAL(*itr1, *itr2);
|
|
|
|
std::advance(itr1, -3);
|
|
etlstd::advance(itr2, -3);
|
|
CHECK_EQUAL(*itr1, *itr2);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(advance_random)
|
|
{
|
|
int* itr1 = std::begin(dataA);
|
|
random_iterator<int> itr2 = std::begin(dataA);
|
|
|
|
std::advance(itr1, 4);
|
|
etlstd::advance(itr2, 4);
|
|
CHECK_EQUAL(*itr1, *itr2);
|
|
|
|
std::advance(itr1, -3);
|
|
etlstd::advance(itr2, -3);
|
|
CHECK_EQUAL(*itr1, *itr2);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(prev)
|
|
{
|
|
int data[] = { 1, 2, 3, 4, 5, 6, 7 };
|
|
|
|
size_t length = 6U;
|
|
|
|
int* itr = &data[0] + length;
|
|
|
|
for (size_t i = 1; i <= length; ++i)
|
|
{
|
|
CHECK_EQUAL(data[length - i], *etlstd::prev(itr, i));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(next)
|
|
{
|
|
int data[] = { 1, 2, 3, 4, 5, 6, 7 };
|
|
|
|
size_t length = 6U;
|
|
|
|
int* itr = &data[0];
|
|
|
|
for (size_t i = 1; i <= length; ++i)
|
|
{
|
|
CHECK_EQUAL(data[i], *etlstd::next(itr, i));
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(reverse_iterator)
|
|
{
|
|
int data[] = { 1, 2, 3, 4, 5, 6, 7 };
|
|
|
|
std::reverse_iterator<int*> sri(&data[7]);
|
|
etlstd::reverse_iterator<int*> eri(&data[7]);
|
|
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[5]) < eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[3]) > eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[4]) <= eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[5]) <= eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[4]) >= eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[3]) >= eri);
|
|
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[1]) == eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[2]) != eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[3]) != eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[4]) != eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[5]) != eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[6]) != eri);
|
|
CHECK(etlstd::reverse_iterator<int*>(&data[7]) != eri);
|
|
|
|
sri = std::reverse_iterator<int*>(&data[7]);
|
|
eri = etlstd::reverse_iterator<int*>(&data[7]);
|
|
CHECK_EQUAL(sri[0], eri[0]);
|
|
CHECK_EQUAL(sri[1], eri[1]);
|
|
CHECK_EQUAL(sri[2], eri[2]);
|
|
CHECK_EQUAL(sri[3], eri[3]);
|
|
CHECK_EQUAL(sri[4], eri[4]);
|
|
CHECK_EQUAL(sri[5], eri[5]);
|
|
CHECK_EQUAL(sri[6], eri[6]);
|
|
|
|
sri += 4;
|
|
eri += 4;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
sri -= 2;
|
|
eri -= 2;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
std::reverse_iterator<int*> sri2 = sri + 3;
|
|
etlstd::reverse_iterator<int*> eri2 = eri + 3;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
sri2 = sri - 3;
|
|
eri2 = eri - 3;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(reverse_iterator_const)
|
|
{
|
|
const int data[] = { 1, 2, 3, 4, 5, 6, 7 };
|
|
|
|
std::reverse_iterator<const int*> sri(&data[7]);
|
|
etlstd::reverse_iterator<const int*> eri(&data[7]);
|
|
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[5]) < eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[3]) > eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[4]) <= eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[5]) <= eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[4]) >= eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[3]) >= eri);
|
|
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri++, *eri++);
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[1]) == eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[2]) != eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[3]) != eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[4]) != eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[5]) != eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[6]) != eri);
|
|
CHECK(etlstd::reverse_iterator<const int*>(&data[7]) != eri);
|
|
|
|
sri = std::reverse_iterator<const int*>(&data[7]);
|
|
eri = etlstd::reverse_iterator<const int*>(&data[7]);
|
|
CHECK_EQUAL(sri[0], eri[0]);
|
|
CHECK_EQUAL(sri[1], eri[1]);
|
|
CHECK_EQUAL(sri[2], eri[2]);
|
|
CHECK_EQUAL(sri[3], eri[3]);
|
|
CHECK_EQUAL(sri[4], eri[4]);
|
|
CHECK_EQUAL(sri[5], eri[5]);
|
|
CHECK_EQUAL(sri[6], eri[6]);
|
|
|
|
CHECK_EQUAL(*sri, *eri);
|
|
CHECK_EQUAL(*(sri + 1), *(eri + 1));
|
|
CHECK_EQUAL(*(sri + 2), *(eri + 2));
|
|
CHECK_EQUAL(*(sri + 3), *(eri + 3));
|
|
CHECK_EQUAL(*(sri + 4), *(eri + 4));
|
|
CHECK_EQUAL(*(sri + 5), *(eri + 5));
|
|
CHECK_EQUAL(*(sri + 6), *(eri + 6));
|
|
|
|
sri += 4;
|
|
eri += 4;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
sri -= 2;
|
|
eri -= 2;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
std::reverse_iterator<const int*> sri2 = sri + 3;
|
|
etlstd::reverse_iterator<const int*> eri2 = eri + 3;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
|
|
sri2 = sri - 3;
|
|
eri2 = eri - 3;
|
|
CHECK_EQUAL(*sri, *eri);
|
|
}
|
|
};
|
|
}
|