git subrepo clone --branch=20.41.6 git@github.com:ETLCPP/etl.git components/etl
subrepo: subdir: "components/etl" merged: "be5537ec" upstream: origin: "git@github.com:ETLCPP/etl.git" branch: "20.41.6" commit: "be5537ec" git-subrepo: version: "0.4.9" origin: "???" commit: "???"
This commit is contained in:
parent
931c4def56
commit
11c24647ea
GPG key ID:
BD0C6214E68FB5CF
1296 changed files with 801882 additions and 0 deletions
565
components/etl/test/test_stack.cpp
Normal file
565
components/etl/test/test_stack.cpp
Normal file
|
|
@ -0,0 +1,565 @@
|
|||
/******************************************************************************
|
||||
The MIT License(MIT)
|
||||
|
||||
Embedded Template Library.
|
||||
https://github.com/ETLCPP/etl
|
||||
https://www.etlcpp.com
|
||||
|
||||
Copyright(c) 2014 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 "unit_test_framework.h"
|
||||
|
||||
#include <stack>
|
||||
|
||||
#include "data.h"
|
||||
|
||||
#include "etl/stack.h"
|
||||
#include "etl/math.h"
|
||||
|
||||
namespace
|
||||
{
|
||||
struct Item
|
||||
{
|
||||
Item()
|
||||
: c('a')
|
||||
, i(1)
|
||||
, d(1.2)
|
||||
{
|
||||
}
|
||||
|
||||
Item(char c_, int i_, double d_)
|
||||
: c(c_)
|
||||
, i(i_)
|
||||
, d(d_)
|
||||
{
|
||||
}
|
||||
|
||||
char c;
|
||||
int i;
|
||||
double d;
|
||||
};
|
||||
|
||||
bool operator == (const Item& lhs, const Item& rhs)
|
||||
{
|
||||
#include "etl/private/diagnostic_float_equal_push.h"
|
||||
return (lhs.c == rhs.c) && (lhs.i == rhs.i) && (lhs.d == rhs.d);
|
||||
#include "etl/private/diagnostic_pop.h"
|
||||
}
|
||||
|
||||
struct ItemNTD
|
||||
{
|
||||
ItemNTD()
|
||||
{
|
||||
p = new char;
|
||||
}
|
||||
|
||||
ItemNTD(const ItemNTD&)
|
||||
: p(new char)
|
||||
{
|
||||
}
|
||||
|
||||
~ItemNTD()
|
||||
{
|
||||
delete p;
|
||||
}
|
||||
|
||||
char* p;
|
||||
};
|
||||
|
||||
SUITE(test_stack)
|
||||
{
|
||||
typedef TestDataDC<std::string> ItemDC;
|
||||
typedef TestDataNDC<std::string> ItemNDC;
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_copy_constructor)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
stack.push(4);
|
||||
|
||||
etl::stack<int, 4> stack2(stack);
|
||||
|
||||
CHECK(stack.size() == stack2.size());
|
||||
|
||||
while (!stack.empty())
|
||||
{
|
||||
CHECK_EQUAL(stack.top(), stack2.top());
|
||||
stack.pop();
|
||||
stack2.pop();
|
||||
}
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_delete_via_istack)
|
||||
{
|
||||
etl::stack<int, 4>* pstack = new etl::stack<int, 4>;
|
||||
|
||||
etl::istack<int>* pistack = pstack;
|
||||
|
||||
pistack->push(1);
|
||||
pistack->push(2);
|
||||
pistack->push(3);
|
||||
pistack->push(4);
|
||||
|
||||
delete pistack;
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_empty)
|
||||
{
|
||||
etl::stack<ItemNDC, 4> stack;
|
||||
|
||||
CHECK(stack.empty());
|
||||
|
||||
stack.push(ItemNDC("1"));
|
||||
|
||||
CHECK(!stack.empty());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_full)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
CHECK(!stack.full());
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
stack.push(4);
|
||||
|
||||
CHECK(stack.full());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_size)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
|
||||
CHECK_EQUAL(3U, stack.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_max_size)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
CHECK_EQUAL(4U, stack.max_size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_clear)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.clear();
|
||||
CHECK_EQUAL(0U, stack.size());
|
||||
|
||||
// Do it again to check that clear() didn't screw up the internals.
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
CHECK_EQUAL(2U, stack.size());
|
||||
stack.clear();
|
||||
CHECK_EQUAL(0U, stack.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_clear_non_pod)
|
||||
{
|
||||
etl::stack<ItemNTD, 4> stack;
|
||||
|
||||
stack.push(ItemNTD());
|
||||
stack.push(ItemNTD());
|
||||
stack.clear();
|
||||
CHECK_EQUAL(0U, stack.size());
|
||||
|
||||
// Do it again to check that clear() didn't screw up the internals.
|
||||
stack.push(ItemNTD());
|
||||
stack.push(ItemNTD());
|
||||
CHECK_EQUAL(2U, stack.size());
|
||||
stack.clear();
|
||||
CHECK_EQUAL(0U, stack.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_push)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
CHECK_EQUAL(1U, stack.size());
|
||||
|
||||
stack.push(2);
|
||||
CHECK_EQUAL(2U, stack.size());
|
||||
|
||||
CHECK_EQUAL(2, stack.top());
|
||||
stack.pop();
|
||||
CHECK_EQUAL(1, stack.top());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_emplace)
|
||||
{
|
||||
etl::stack<Item, 5> stack;
|
||||
|
||||
Item& item1 = stack.emplace();
|
||||
CHECK_EQUAL(1U, stack.size());
|
||||
|
||||
Item& item2 = stack.emplace('b', 2, 2.3);
|
||||
CHECK_EQUAL(2U, stack.size());
|
||||
|
||||
Item& item3 = stack.emplace('c', 3, 3.4);
|
||||
CHECK_EQUAL(3U, stack.size());
|
||||
|
||||
Item& item4 = stack.emplace('d', 4, 4.5);
|
||||
CHECK_EQUAL(4U, stack.size());
|
||||
|
||||
Item& item5 = stack.emplace('e', 5, 5.6);
|
||||
CHECK_EQUAL(5U, stack.size());
|
||||
|
||||
CHECK(item1 == Item('a', 1, 1.2));
|
||||
CHECK(item2 == Item('b', 2, 2.3));
|
||||
CHECK(item3 == Item('c', 3, 3.4));
|
||||
CHECK(item4 == Item('d', 4, 4.5));
|
||||
CHECK(item5 == Item('e', 5, 5.6));
|
||||
|
||||
CHECK(stack.top() == Item('e', 5, 5.6));
|
||||
|
||||
stack.pop();
|
||||
CHECK(stack.top() == Item('d', 4, 4.5));
|
||||
|
||||
stack.pop();
|
||||
CHECK(stack.top() == Item('c', 3, 3.4));
|
||||
|
||||
stack.pop();
|
||||
CHECK(stack.top() == Item('b', 2, 2.3));
|
||||
|
||||
stack.pop();
|
||||
CHECK(stack.top() == Item('a', 1, 1.2));
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_push_excess)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
for (size_t i = 0UL; i < stack.max_size(); ++i)
|
||||
{
|
||||
stack.push(1);
|
||||
}
|
||||
|
||||
CHECK_THROW(stack.push(1), etl::stack_full);
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_pop)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.pop();
|
||||
CHECK_EQUAL(1U, stack.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_pop_into)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
stack.push(4);
|
||||
|
||||
int i;
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(4, i);
|
||||
CHECK_EQUAL(3U, stack.size());
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(3, i);
|
||||
CHECK_EQUAL(2U, stack.size());
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(2, i);
|
||||
CHECK_EQUAL(1U, stack.size());
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(1, i);
|
||||
CHECK_EQUAL(0U, stack.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_pop_into_stack)
|
||||
{
|
||||
etl::stack<int, 4> stack1;
|
||||
etl::stack<int, 4> stack2;
|
||||
|
||||
stack1.push(1);
|
||||
stack1.push(2);
|
||||
stack1.push(3);
|
||||
stack1.push(4);
|
||||
|
||||
stack1.pop_into(stack2);
|
||||
CHECK_EQUAL(1U, stack2.size());
|
||||
CHECK_EQUAL(4, stack2.top());
|
||||
|
||||
stack1.pop_into(stack2);
|
||||
CHECK_EQUAL(2U, stack2.size());
|
||||
CHECK_EQUAL(3, stack2.top());
|
||||
|
||||
stack1.pop_into(stack2);
|
||||
CHECK_EQUAL(3U, stack2.size());
|
||||
CHECK_EQUAL(2, stack2.top());
|
||||
|
||||
stack1.pop_into(stack2);
|
||||
CHECK_EQUAL(4U, stack2.size());
|
||||
CHECK_EQUAL(1, stack2.top());
|
||||
|
||||
int i;
|
||||
|
||||
stack2.pop_into(i);
|
||||
CHECK_EQUAL(1, i);
|
||||
|
||||
stack2.pop_into(i);
|
||||
CHECK_EQUAL(2, i);
|
||||
|
||||
stack2.pop_into(i);
|
||||
CHECK_EQUAL(3, i);
|
||||
|
||||
stack2.pop_into(i);
|
||||
CHECK_EQUAL(4, i);
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_pop_excess)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
for (size_t i = 0UL; i < stack.max_size(); ++i)
|
||||
{
|
||||
stack.push(1);
|
||||
}
|
||||
|
||||
for (size_t i = 0UL; i < stack.max_size(); ++i)
|
||||
{
|
||||
stack.pop();
|
||||
}
|
||||
|
||||
CHECK_THROW(stack.pop(), etl::stack_empty);
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_top)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
|
||||
CHECK_EQUAL(3, stack.top());
|
||||
|
||||
stack.pop();
|
||||
CHECK_EQUAL(2, stack.top());
|
||||
|
||||
stack.pop();
|
||||
CHECK_EQUAL(1, stack.top());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_top_const)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
const etl::stack<int, 4>& constQueue = stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
|
||||
CHECK_EQUAL(3, constQueue.top());
|
||||
|
||||
stack.pop();
|
||||
CHECK_EQUAL(2, constQueue.top());
|
||||
|
||||
stack.pop();
|
||||
CHECK_EQUAL(1, constQueue.top());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_multiple_push)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
|
||||
bool pass = true;
|
||||
|
||||
if (stack.top() != 3)
|
||||
{
|
||||
pass = false;
|
||||
}
|
||||
|
||||
stack.pop();
|
||||
|
||||
if (stack.top() != 2)
|
||||
{
|
||||
pass = false;
|
||||
}
|
||||
|
||||
stack.pop();
|
||||
|
||||
if (stack.top() != 1)
|
||||
{
|
||||
pass = false;
|
||||
}
|
||||
|
||||
CHECK(pass);
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_assignment)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
stack.push(4);
|
||||
|
||||
etl::stack<int, 4> stack2;
|
||||
|
||||
// These should be overwritten.
|
||||
stack2.push(5);
|
||||
stack2.push(6);
|
||||
|
||||
stack2 = stack;
|
||||
|
||||
CHECK(stack.size() == stack2.size());
|
||||
|
||||
while (!stack.empty())
|
||||
{
|
||||
CHECK_EQUAL(stack.top(), stack2.top());
|
||||
stack.pop();
|
||||
stack2.pop();
|
||||
}
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_assignment_interface)
|
||||
{
|
||||
etl::stack<int, 4> stack1;
|
||||
|
||||
stack1.push(1);
|
||||
stack1.push(2);
|
||||
stack1.push(3);
|
||||
stack1.push(4);
|
||||
|
||||
etl::stack<int, 4> stack2;
|
||||
|
||||
etl::istack<int>& istack1 = stack1;
|
||||
etl::istack<int>& istack2 = stack2;
|
||||
|
||||
istack2 = istack1;
|
||||
|
||||
CHECK(istack1.size() == stack2.size());
|
||||
|
||||
while (!stack1.empty())
|
||||
{
|
||||
CHECK_EQUAL(stack1.top(), stack2.top());
|
||||
stack1.pop();
|
||||
stack2.pop();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_self_assignment)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
stack.push(4);
|
||||
|
||||
#include "etl/private/diagnostic_self_assign_overloaded_push.h"
|
||||
stack = stack;
|
||||
#include "etl/private/diagnostic_pop.h"
|
||||
|
||||
CHECK(stack.max_size() == stack.size());
|
||||
|
||||
CHECK_EQUAL(4, stack.top());
|
||||
stack.pop();
|
||||
|
||||
CHECK_EQUAL(3, stack.top());
|
||||
stack.pop();
|
||||
|
||||
CHECK_EQUAL(2, stack.top());
|
||||
stack.pop();
|
||||
|
||||
CHECK_EQUAL(1, stack.top());
|
||||
stack.pop();
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_reverse)
|
||||
{
|
||||
etl::stack<int, 4> stack;
|
||||
|
||||
stack.push(1);
|
||||
stack.push(2);
|
||||
stack.push(3);
|
||||
stack.push(4);
|
||||
|
||||
stack.reverse();
|
||||
|
||||
int i;
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(1, i);
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(2, i);
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(3, i);
|
||||
|
||||
stack.pop_into(i);
|
||||
CHECK_EQUAL(4, i);
|
||||
}
|
||||
};
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue