/*
(c) Copyright 2005, 2006, Hewlett-Packard Development Company, LP
[See end of file]
$Id: RepeatedRetrievalTester.java,v 1.8 2007/05/02 10:52:17 rebach Exp $
*/
package com.hp.hpl.jena.gvs.test;
import org.wymiwyg.rdf.leanifier.MoleculeBasedLeanifier;
import com.hp.hpl.jena.gvs.FCAGraph;
import com.hp.hpl.jena.gvs.Source;
import com.hp.hpl.jena.gvs.Store;
import com.hp.hpl.jena.gvs.impl.FCAGraphImpl;
import com.hp.hpl.jena.gvs.impl.SourceImpl;
import com.hp.hpl.jena.gvs.impl.memory.MemoryStoreImpl;
import com.hp.hpl.jena.gvs.impl.util.ToyClock;
/**
* @author reto
*
*/
public class RepeatedRetrievalTester implements TestPerformer {
/**
*
*/
public RepeatedRetrievalTester() {
super();
// TODO Auto-generated constructor stub
}
/*
* (non-Javadoc)
*
* @see com.hp.hpl.jena.gvs.test.TestPerformer#perfromTest(org.wymiwyg.rdf.graphs.Graph[])
*/
public boolean performTest(FCAGraph[] graphs) {
try {
for (int k = 0; k < 10; k++) {
ToyClock clock = new ToyClock();
Store store = new MemoryStoreImpl(clock);
Source source = new SourceImpl(
"http://example.org/graph-source");
for (int i = 0; i < graphs.length; i++) {
//TODO leanify on dec
graphs[i] = new FCAGraphImpl(MoleculeBasedLeanifier
.getLeanVersionOf(graphs[i]));
}
TimedGraphSequence tgs = TimedGraphSequence
.getSequenceWithRandomDates(graphs);
for (int i = 0; i < tgs.getSize(); i++) {
clock.setTime(tgs.getDate(i));
store.updateGraph(source, tgs.getGraph(i));
}
if (!StoreTest.compareAllVersions(store, source, tgs)) {
return false;
}
// tgs.write(System.out);
}
} catch (Exception ex) {
return false;
}
return true;
}
}
/*
* (c) Copyright 2005, 2006 Hewlett-Packard Development Company, LP All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/