Ichthyostega
6de24bc7f0
to carry out that rather obvious step, I was bound to consider all the implications of choosing a given layout and handling pattern for our external structure representation. Finally, I settled upon the following decisions - the value space represented within the DataCap is flat, not further structured - the distinction between "attribute" and "nested object" is merely conceptual and will be enforced solely by the diff detection / representation protocol - basically, a nested subtree may appear as an attribute; the difference between attributes and children lies solely in the way of access and referral: by-name vs. positional - it is pointless to save space for the representation of the discriminator ID - but we can omit any further explicit type tag, because - we do *not* support programming by switch-on-type, and thus - we do *not* support full introspection, only a passive type-safety check - this is *not* a limitation, since we acknowledge that GenNode is a *Monad* - and the partial function needed within any flatMap implementation maps naturally onto our Variant-Visitor; thus - the DataCap can basically just *be* a Variant - and GenNode has just to supply the neccessary shaffolding to turn that into a full fledged Monad implementation, including direct construction by wrapping a value and flatMap with tree walk
115 lines
2.3 KiB
C++
115 lines
2.3 KiB
C++
/*
|
|
GenNodeBasic(Test) - fundamental properties of a generic tree node element
|
|
|
|
Copyright (C) Lumiera.org
|
|
2015, 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.
|
|
|
|
* *****************************************************/
|
|
|
|
|
|
#include "lib/test/run.hpp"
|
|
#include "lib/test/test-helper.hpp"
|
|
#include "lib/diff/gen-node.hpp"
|
|
#include "lib/diff/record.hpp"
|
|
|
|
//#include <utility>
|
|
//#include <string>
|
|
//#include <vector>
|
|
|
|
//using std::string;
|
|
//using std::vector;
|
|
//using std::swap;
|
|
|
|
|
|
namespace lib {
|
|
namespace diff{
|
|
namespace test{
|
|
|
|
// using lumiera::error::LUMIERA_ERROR_LOGIC;
|
|
|
|
namespace {//Test fixture....
|
|
|
|
|
|
|
|
}//(End)Test fixture
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************//**
|
|
* @test Verify properties of a special collection type shaped for
|
|
* external representation of object-like data.
|
|
*
|
|
* @see IndexTable
|
|
* @see DiffListApplication_test
|
|
*/
|
|
class GenNodeBasic_test : public Test
|
|
{
|
|
|
|
virtual void
|
|
run (Arg)
|
|
{
|
|
simpleUsage();
|
|
verifySnapshot();
|
|
sequenceIteration();
|
|
duplicateDetection();
|
|
copy_and_move();
|
|
}
|
|
|
|
|
|
void
|
|
simpleUsage()
|
|
{
|
|
}
|
|
|
|
|
|
void
|
|
verifySnapshot()
|
|
{
|
|
}
|
|
|
|
|
|
void
|
|
sequenceIteration()
|
|
{
|
|
}
|
|
|
|
|
|
void
|
|
duplicateDetection()
|
|
{
|
|
}
|
|
|
|
|
|
void
|
|
copy_and_move()
|
|
{
|
|
}
|
|
};
|
|
|
|
|
|
/** Register this test class... */
|
|
LAUNCHER (GenNodeBasic_test, "unit common");
|
|
|
|
|
|
|
|
}}} // namespace lib::diff::test
|