// D E F G H I J K L
List<BaseProperty> properties = this.getGlobalProperties();
assertTrue(properties.size() == this.numberOfProperties);
Burst burst = new BurstImpl(properties, true);
List<BaseProperty> allTree1Properties = this.treeI.getAllProperties();
assertTrue(allTree1Properties.containsAll(burst.getProperties()));
assertTrue(burst.getProperties().containsAll(allTree1Properties));
createResourceNodeTreeIII(); // same URI as treeI but ALL properties A ... L
ResourceNode resNode =
(ResourceNode)getNode(TreeImplTest.NODES.NAME_NODE_TREEIII);
System.out.println(resNode.getProperties().size());
System.out.println(properties.size());
assertTrue(resNode.getProperties().containsAll(properties));
assertTrue(properties.containsAll(resNode.getProperties()));
assertTrue(burst.isContentContainedBy(resNode));
assertFalse(resNode.isContentContainedBy(burst));
// ______nameNode______
// / | | | | | | | | | | \
// A B C | | | | | | | | | Paths
// | | | D E F | | | | | |
// |__|_|_^ ^ ^ | | | | | | same as I, but nn for III != nn for I
// treeIII |__|_|___| | G H I | | | This is a tree also
// |__|_|_____| ^ ^ ^ J K L # terminating nodes = # paths
// | |_______| | | ^ ^ ^
// |_|_________| | | | |
// |_|___________| | | |
// |_____________| | |
// |_______________| |
// |_________________|
Graph treeIII =
TreeImpl.valueByResourceNode(resNode);
System.out.println("BEGIN TREEIII");
String s = treeIII.toString();
System.out.println(s);
System.out.println("END TREEIII");
assertTrue(TreeImpl.isTree(treeIII));
assertFalse(treeIII.isContentContainedBy(burst));
assertFalse(burst.isContentContainedBy(treeIII));
assertFalse(treeIII.getNamenode().isContentContainedBy(burst));
assertTrue(burst.isContentContainedBy(treeIII.getNamenode()));
Map map = GraphInformation.recursivelyAnalyzeGraph(resNode);
List<BaseProperty> pRops = GraphInformation.getBaseProperties(map);
Burst burst2 = new BurstImpl(pRops, false);
assertTrue(burst2.getProperties().containsAll(burst.getProperties()));
assertTrue(burst.getProperties().containsAll(burst2.getProperties()));
// this makes sense ... tree1 only has A, B, C but tree2 has A, B, ... L.
assertFalse(this.treeI.hasSameContents(treeIII));
assertTrue(this.treeI.isContentContainedBy(treeIII));