293 lines
9.9 KiB
C++
293 lines
9.9 KiB
C++
/*
|
|
ScopePath(Test) - verify handling of logical access path down from Session root
|
|
|
|
Copyright (C) Lumiera.org
|
|
2009, 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 "proc/mobject/session/test-scopes.hpp"
|
|
//#include "lib/lumitime.hpp"
|
|
//#include "proc/mobject/placement-ref.hpp"
|
|
//#include "proc/mobject/placement-index.hpp"
|
|
//#include "proc/mobject/test-dummy-mobject.hpp"
|
|
#include "lib/util.hpp"
|
|
|
|
//#include <iostream>
|
|
//#include <string>
|
|
|
|
|
|
|
|
namespace mobject {
|
|
namespace session {
|
|
namespace test {
|
|
|
|
using util::isSameObject;
|
|
//using lumiera::Time;
|
|
//using std::string;
|
|
//using std::cout;
|
|
//using std::endl;
|
|
// using namespace mobject::test;
|
|
using lumiera::error::LUMIERA_ERROR_LOGIC;
|
|
|
|
|
|
/***************************************************************************
|
|
* @test properties and behaviour of the path of nested scopes.
|
|
* Using a pseudo-session (actually just a PlacementIndex), this test
|
|
* creates some nested scopes and executes navigation moves on them.
|
|
* @see mobject::Placement
|
|
* @see mobject::session::ScopePath
|
|
* @see mobject::session::QueryFocus
|
|
*/
|
|
class ScopePath_test : public Test
|
|
{
|
|
|
|
virtual void
|
|
run (Arg)
|
|
{
|
|
// Prepare an (test)Index backing the PlacementRefs
|
|
PPIdx index = build_testScopes();
|
|
PMO& startPlacement = *(index->query<TestSubMO1>(index->getRoot()));
|
|
ASSERT (startPlacement);
|
|
|
|
ScopePath testPath = buildPath (startPlacement);
|
|
checkRelations (testPath,startPlacement);
|
|
invalildPath (testPath,startPlacement);
|
|
check_Identity_and_Copy (startPlacement);
|
|
navigate (testPath, index);
|
|
clear (testPath, index);
|
|
}
|
|
|
|
|
|
ScopePath
|
|
buildPath (PMO& startPla)
|
|
{
|
|
Scope startScope (startPla);
|
|
ScopePath path (startScope);
|
|
ASSERT (path);
|
|
ASSERT (path.contains (startScope));
|
|
return path;
|
|
ScopePath path (startScope);
|
|
|
|
ScopePath path2 (startScope);
|
|
ScopePath path3 (path2);
|
|
}
|
|
|
|
|
|
void
|
|
checkRelations (ScopePath path1, PMO& refPla)
|
|
{
|
|
ASSERT (path1.contains (refPla));
|
|
|
|
Scope refScope (refPla);
|
|
ASSERT (path1.contains (refScope));
|
|
ASSERT (path1.endsAt (refScope));
|
|
|
|
ScopePath path2 (refScope);
|
|
ASSERT (path2.contains (refScope));
|
|
ASSERT (path2.endsAt (refScope));
|
|
|
|
ASSERT (path1 == path2);
|
|
ASSERT (!isSameObject (path,path2));
|
|
|
|
Scope parent = path2.moveUp();
|
|
ASSERT (path2.endsAt (parent));
|
|
ASSERT (path1.endsAt (refScope));
|
|
ASSERT (parent == refScope.getParent());
|
|
ASSERT (path1 != path2);
|
|
ASSERT (path2 != path1);
|
|
ASSERT (path1.contains (path2)); ////////////////////TODO: not clear if we really need to implement those relations
|
|
ASSERT (!disjoint(path1,path2));
|
|
ASSERT (path2 == commonPrefix(path1,path2));
|
|
ASSERT (path2 == commonPrefix(path2,path1));
|
|
ASSERT (path1 != commonPrefix(path1,path2));
|
|
ASSERT (path1 != commonPrefix(path2,path1));
|
|
}
|
|
|
|
|
|
void
|
|
invalidPath (ScopePath refPath, PMO& refPla)
|
|
{
|
|
ASSERT (refPath);
|
|
ASSERT (!ScopePath::INVALID);
|
|
|
|
ScopePath invalidP (ScopePath::INVALID);
|
|
ASSERT (!invalildP);
|
|
ASSERT (invalildP == ScopePath::INVALID);
|
|
ASSERT (!isSameObject (invalidP, ScopePath::INVALID));
|
|
|
|
ASSERT (refPath.contains (refPla));
|
|
ASSERT (!invalidP.contains (refPla));
|
|
|
|
Scope refScope (refPla);
|
|
ASSERT (!invalidP.contains (refScope));
|
|
ASSERT (!invalidP.endsAt (refScope));
|
|
|
|
ASSERT (refPath.contains (invalidP)); // If the moon consists of green cheese, I'll eat my hat!
|
|
ASSERT (!invalidP.contains (refPath));
|
|
ASSERT (invalidP == commonPrefix(refPath,invalidP));
|
|
ASSERT (invalidP == commonPrefix(invalidP,refPath));
|
|
|
|
VERIFY_ERROR (LOGIC, invalidP.moveUp());
|
|
Scope root = refPath.goRoot();
|
|
ASSERT (1 == refPath.length());
|
|
|
|
Scope nil = refPath.moveUp();
|
|
ASSERT (!refPath);
|
|
ASSERT (!nil.isValid());
|
|
ASSERT (refPath == invalidP);
|
|
ASSERT (invalidP.contains (nil));
|
|
|
|
refPath.navigate(root);
|
|
ASSERT (refPath != invalidP);
|
|
ASSERT (refPath);
|
|
|
|
//ScopePath::INVALID.navigate(root); // doesn't compile
|
|
}
|
|
|
|
|
|
void
|
|
check_Identity_and_Copy (PMO& refPla)
|
|
{
|
|
Scope startScope (startPla);
|
|
ScopePath path1 (startScope);
|
|
ScopePath path2 (startScope);
|
|
ScopePath path3 (path2);
|
|
|
|
ASSERT (path1.contains (startScope));
|
|
ASSERT (path2.contains (startScope));
|
|
ASSERT (path3.contains (startScope));
|
|
|
|
ASSERT (path1 == path2);
|
|
ASSERT (path2 == path3);
|
|
ASSERT (path1 == path3);
|
|
ASSERT (!isSameObject (path1,path2));
|
|
ASSERT (!isSameObject (path2,path3));
|
|
ASSERT (!isSameObject (path1,path3));
|
|
|
|
Scope parent = path3.moveUp();
|
|
ASSERT (path1 == path2);
|
|
ASSERT (path2 != path3);
|
|
ASSERT (path1 != path3);
|
|
|
|
path2 = path3;
|
|
ASSERT (path1 != path2);
|
|
ASSERT (path2 == path3);
|
|
ASSERT (path1 != path3);
|
|
|
|
path1 = ScopePath::INVALID;
|
|
ASSERT (path1 != path2);
|
|
ASSERT (path2 != path3);
|
|
ASSERT (path1 != path3);
|
|
}
|
|
|
|
|
|
/** @test modify a path by \em navigating it.
|
|
* - move one step above the current leaf
|
|
* - move up to the root element
|
|
* - move back to the parent and verify we're just above the leaf
|
|
* - attach a new sibling node and move the path down to there
|
|
* - extract the common prefix, which should again point to the parent
|
|
* - find a placement in a completely separate branch (only sharing the
|
|
* root node). Navigate to there and verify root is the common prefix.
|
|
*/
|
|
void
|
|
navigate (const ScopePath refPath, PPIdx index)
|
|
{
|
|
ScopePath path (refPath);
|
|
ASSERT (path == refPath);
|
|
|
|
Scope leaf = path.getLeaf();
|
|
Scope parent = path.moveUp();
|
|
ASSERT (path != refPath);
|
|
ASSERT (refPath.contains (path));
|
|
ASSERT (refPath.endsAt (leaf));
|
|
ASSERT (path.endsAt (parent));
|
|
ASSERT (parent == leaf.getParent());
|
|
ASSERT (parent == path.getLeaf());
|
|
|
|
Scope root = path.goRoot();
|
|
ASSERT (path != refPath);
|
|
ASSERT (path.endsAt (root));
|
|
ASSERT (refPath.contains (path));
|
|
ASSERT (!path.endsAt (parent));
|
|
ASSERT (!path.endsAt (leaf));
|
|
|
|
path.navigate (parent);
|
|
ASSERT (path.endsAt (parent));
|
|
ASSERT (!path.endsAt (root));
|
|
ASSERT (!path.endsAt (leaf));
|
|
|
|
PMO newNode (*new DummyMO);
|
|
index->insert (newNode, parent); // place as sibling of "leaf"
|
|
path.navigate (newNode);
|
|
Scope sibling = path.getLeaf();
|
|
ASSERT (parent == sibling.getParent());
|
|
ASSERT (path.endsAt (sibling));
|
|
ASSERT (path.contains (parent));
|
|
ASSERT (path.contains (root));
|
|
ASSERT (!refPath.contains (path));
|
|
ASSERT (!path.contains (refPath));
|
|
ASSERT (!disjoint (path,refPath));
|
|
ASSERT (!disjoint (refPath,path));
|
|
|
|
Path prefix = commonPrefix (path,refPath);
|
|
ASSERT (prefix == commonPrefix (refPath,path));
|
|
ASSERT (prefix.endsAt (parent));
|
|
ASSERT (!prefix.contains (leaf));
|
|
ASSERT (!prefix.contains (sibling));
|
|
path.navigate (prefix.getLeaf());
|
|
ASSERT (path == prefix);
|
|
|
|
// now explore a completely separate branch....
|
|
PMO& separatePlacement = *index->query<TestSubMO21> (
|
|
*index->query<TestSubMO21> (
|
|
*index->query<TestSubMO21> (root)));
|
|
path.navigate (separatePlacement);
|
|
ASSERT (path);
|
|
ASSERT (disjoint (path,refPath));
|
|
ASSERT (path.contains(separatePlacement));
|
|
Scope other = path.getLeaf();
|
|
ASSERT (other.getTop() == separatePlacement);
|
|
ScopePath rootPrefix = commonPrefix (path,refPath);
|
|
ASSERT (rootPrefix.endsAt (root));
|
|
}
|
|
|
|
|
|
void
|
|
clear (ScopePath& testPath, PPIdx index)
|
|
{
|
|
ASSERT (path);
|
|
PMO rootNode = index->getRoot();
|
|
ASSERT (path.getLeaf() != rootNode);
|
|
|
|
path.clear();
|
|
ASSERT (path);
|
|
ASSERT (path.getLeaf() == rootNode);
|
|
}
|
|
|
|
};
|
|
|
|
|
|
/** Register this test class... */
|
|
LAUNCHER (ScopePath_test, "unit session");
|
|
|
|
|
|
}}} // namespace mobject::session::test
|