📄 testtransitivegraphcache.java
字号:
/******************************************************************
* File: TestTransitiveGraphCacheNew.java
* Created by: Dave Reynolds
* Created on: 25-Nov-2004
*
* (c) Copyright 2004, 2005, 2006, 2007 Hewlett-Packard Development Company, LP
* [See end of file]
* $Id: TestTransitiveGraphCache.java,v 1.17 2007/01/02 11:50:50 andy_seaborne Exp $
*****************************************************************/
package com.hp.hpl.jena.reasoner.test;
import com.hp.hpl.jena.reasoner.transitiveReasoner.TransitiveGraphCache;
import com.hp.hpl.jena.reasoner.TriplePattern;
import com.hp.hpl.jena.graph.Node;
import com.hp.hpl.jena.graph.Triple;
import junit.framework.TestCase;
import junit.framework.TestSuite;
/**
* A purely temporary test suite just used during development and kept
* off the main unit test paths.
*
* @author <a href="mailto:der@hplb.hpl.hp.com">Dave Reynolds</a>
* @version $Revision: 1.17 $
*/
public class TestTransitiveGraphCache extends TestCase {
/** The cache under test */
TransitiveGraphCache cache;
// Dummy predicates and nodes for the graph
String NS = "urn:x-hp-test:ex/";
Node directP = Node.createURI(NS+"directSubProperty");
Node closedP = Node.createURI(NS+"subProperty");
Node a = Node.createURI(NS+"a");
Node b = Node.createURI(NS+"b");
Node c = Node.createURI(NS+"c");
Node d = Node.createURI(NS+"d");
Node e = Node.createURI(NS+"e");
Node f = Node.createURI(NS+"f");
Node g = Node.createURI(NS+"g");
/**
* Boilerplate for junit
*/
public TestTransitiveGraphCache( String name ) {
super( name );
}
/**
* Boilerplate for junit.
* This is its own test suite
*/
public static TestSuite suite() {
return new TestSuite( TestTransitiveGraphCache.class );
// TestSuite suite = new TestSuite();
// suite.addTest( new TestTransitiveGraphCache("testEquivalencesSimple"));
// return suite;
}
/**
* Test the basic functioning a Transitive closure cache.
* Caches the graph but not the final closure.
*/
public void testBasicCache() {
initCache();
cache.setCaching(false);
doBasicTest(cache);
}
/**
* Test the basic functioning a Transitive closure cache.
* Caches the graph and any requested closures
*/
public void testCachingCache() {
initCache();
cache.setCaching(true);
doBasicTest(cache);
}
/**
* Test the clone operation
*/
public void testCloning() {
initCache();
TransitiveGraphCache clone = cache.deepCopy();
// Mess with the original to check cloning
cache.addRelation(new Triple(a, closedP, d));
cache.addRelation(new Triple(g, closedP, a));
doBasicTest(clone);
}
/**
* Initialize the cache with some test data
*/
private void initCache() {
// Create a graph with reflexive references, cycles, redundant links
cache = new TransitiveGraphCache(directP, closedP);
cache.addRelation(new Triple(a, closedP, b));
cache.addRelation(new Triple(b, closedP, e));
cache.addRelation(new Triple(b, closedP, c));
cache.addRelation(new Triple(e, closedP, f));
cache.addRelation(new Triple(c, closedP, f));
cache.addRelation(new Triple(f, closedP, g));
cache.addRelation(new Triple(d, closedP, c));
cache.addRelation(new Triple(d, closedP, e));
cache.addRelation(new Triple(d, closedP, g)); // reduntant two ways
cache.addRelation(new Triple(a, closedP, e)); // redundant
cache.addRelation(new Triple(d, closedP, b)); // Makes both earlier d's redundant
cache.addRelation(new Triple(a, closedP, a));
cache.addRelation(new Triple(b, closedP, b));
cache.addRelation(new Triple(c, closedP, c));
cache.addRelation(new Triple(d, closedP, d));
cache.addRelation(new Triple(e, closedP, e));
cache.addRelation(new Triple(f, closedP, f));
cache.addRelation(new Triple(g, closedP, g));
}
public void doBasicTest(TransitiveGraphCache cache) {
// Test forward property patterns
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(a, directP, null)),
new Object[] {
new Triple(a, closedP, a),
new Triple(a, closedP, b)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(a, closedP, null)),
new Object[] {
new Triple(a, closedP, a),
new Triple(a, closedP, b),
new Triple(a, closedP, c),
new Triple(a, closedP, e),
new Triple(a, closedP, f),
new Triple(a, closedP, g)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(a, closedP, g)),
new Object[] {
new Triple(a, closedP, g),
});
// Test backward patterns
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, directP, f)),
new Object[] {
new Triple(e, closedP, f),
new Triple(f, closedP, f),
new Triple(c, closedP, f)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, closedP, f)),
new Object[] {
new Triple(f, closedP, f),
new Triple(e, closedP, f),
new Triple(b, closedP, f),
new Triple(c, closedP, f),
new Triple(a, closedP, f),
new Triple(d, closedP, f)
});
// List all cases
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, directP, null)),
new Object[] {
new Triple(a, closedP, a),
new Triple(a, closedP, b),
new Triple(d, closedP, d),
new Triple(d, closedP, b),
new Triple(b, closedP, b),
new Triple(b, closedP, e),
new Triple(b, closedP, c),
new Triple(e, closedP, e),
new Triple(e, closedP, f),
new Triple(c, closedP, c),
new Triple(c, closedP, f),
new Triple(f, closedP, f),
new Triple(f, closedP, g),
new Triple(g, closedP, g)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, closedP, null)),
new Object[] {
new Triple(a, closedP, a),
new Triple(a, closedP, b),
new Triple(a, closedP, c),
new Triple(a, closedP, e),
new Triple(a, closedP, f),
new Triple(a, closedP, g),
new Triple(d, closedP, d),
new Triple(d, closedP, b),
new Triple(d, closedP, e),
new Triple(d, closedP, c),
new Triple(d, closedP, f),
new Triple(d, closedP, g),
new Triple(b, closedP, b),
new Triple(b, closedP, e),
new Triple(b, closedP, c),
new Triple(b, closedP, f),
new Triple(b, closedP, g),
new Triple(e, closedP, e),
new Triple(e, closedP, f),
new Triple(e, closedP, g),
new Triple(c, closedP, c),
new Triple(c, closedP, f),
new Triple(c, closedP, g),
new Triple(f, closedP, f),
new Triple(f, closedP, g),
new Triple(g, closedP, g)
});
// Add a look in the graph and check the loop from each starting position
cache.addRelation(new Triple(g, closedP, e));
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(e, directP, null)),
new Object[] {
new Triple(e, closedP, e),
new Triple(e, closedP, f),
new Triple(e, closedP, g)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(f, directP, null)),
new Object[] {
new Triple(f, closedP, f),
new Triple(f, closedP, g),
new Triple(f, closedP, e)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(g, directP, null)),
new Object[] {
new Triple(g, closedP, g),
new Triple(g, closedP, e),
new Triple(g, closedP, f)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, directP, e)),
new Object[] {
new Triple(e, closedP, e),
new Triple(f, closedP, e),
new Triple(b, closedP, e),
new Triple(c, closedP, e),
new Triple(g, closedP, e)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, directP, f)),
new Object[] {
new Triple(f, closedP, f),
new Triple(g, closedP, f),
new Triple(b, closedP, f),
new Triple(c, closedP, f),
new Triple(e, closedP, f)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(null, directP, g)),
new Object[] {
new Triple(g, closedP, g),
new Triple(e, closedP, g),
new Triple(b, closedP, g),
new Triple(c, closedP, g),
new Triple(f, closedP, g)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(g, closedP, null)),
new Object[] {
new Triple(g, closedP, g),
new Triple(g, closedP, e),
new Triple(g, closedP, f)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(e, closedP, null)),
new Object[] {
new Triple(e, closedP, g),
new Triple(e, closedP, e),
new Triple(e, closedP, f)
});
TestUtil.assertIteratorValues(this,
cache.find(new TriplePattern(f, closedP, null)),
new Object[] {
new Triple(f, closedP, g),
new Triple(f, closedP, e),
new Triple(f, closedP, f)
});
/*
System.out.println("Add e-f-g-e loop");
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -