lumiera_/tests/library/iter-stack-test.cpp
Ichthyostega a90b9e5f16 Library: uniform definition scheme for error-IDs
In the Lumiera code base, we use C-String constants as unique error-IDs.
Basically this allows to create new unique error IDs anywhere in the code.

However, definition of such IDs in arbitrary namespaces tends to create
slight confusion and ambiguities, while maintaining the proper use statements
requires some manual work.

Thus I introduce a new **standard scheme**
 * Error-IDs for widespread use shall be defined _exclusively_ into `namespace lumiera::error`
 * The shorthand-Macro `LERR_()` can now be used to simplify inclusion and referral
 * (for local or single-usage errors, a local or even hidden definition is OK)
2024-03-21 19:57:34 +01:00

115 lines
2.9 KiB
C++

/*
IterStack(Test) - verify stack-like iterator
Copyright (C) Lumiera.org
2012, Hermann Vosseler <Ichthyostega@web.de>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of
the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
* *****************************************************/
/** @file iter-stack-test.cpp
** unit test \ref IterStack_test
*/
#include "lib/test/run.hpp"
#include "lib/test/test-helper.hpp"
#include "lib/util.hpp"
#include "lib/iter-stack.hpp"
namespace lib {
namespace test{
using ::Test;
using util::isnil;
using LERR_(ITER_EXHAUST);
typedef IterStack<int> IStack;
/*****************************************************************//**
* @test cover behaviour of a convenience class built by using a
* \c std::deque as "state core" of an Lumiera IterStateWrapper.
* - iterable according to the Lumiera Forward Iterator concept
* - can push and pop values repeatedly
* - iterating and push / pop can be mixed
* - empty state detected consistently
*
* @see IterExplorer
* @see IterAdapter
*/
class IterStack_test : public Test
{
virtual void
run (Arg)
{
IStack stack;
CHECK (isnil (stack));
VERIFY_ERROR (ITER_EXHAUST, *stack );
VERIFY_ERROR (ITER_EXHAUST, ++stack );
stack.push (1);
stack.push (3);
stack.push (5);
stack.push (7);
stack.push (9);
CHECK (!isnil (stack));
CHECK (9 == *stack);
++stack;
CHECK (7 == *stack);
CHECK (7 == stack.pop());
CHECK (5 == *stack);
++++stack;
CHECK (1 == *stack);
CHECK (1 == stack.pop());
CHECK (isnil (stack));
VERIFY_ERROR (ITER_EXHAUST, *stack );
VERIFY_ERROR (ITER_EXHAUST, ++stack );
VERIFY_ERROR (ITER_EXHAUST, stack.pop() );
stack.push(23);
CHECK (23 == *stack);
int i = stack.pop();
CHECK (i == 23);
VERIFY_ERROR (ITER_EXHAUST, *stack );
CHECK (isnil (stack));
}
};
LAUNCHER (IterStack_test, "unit common");
}} // namespace lib::test