package it.unibz.inf.ontop.si.dag;

/*
 * #%L
 * ontop-quest-owlapi
 * %%
 * Copyright (C) 2009 - 2014 Free University of Bozen-Bolzano
 * %%
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *      http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * #L%
 */


import it.unibz.inf.ontop.spec.ontology.*;
import it.unibz.inf.ontop.spec.ontology.impl.ClassifiedTBoxImpl;
import junit.framework.TestCase;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;

import static it.unibz.inf.ontop.utils.SITestingTools.loadOntologyFromFileAndClassify;

public class S_EquivalenceOverNamed_NewDAG_Test extends TestCase {


	private final Logger log = LoggerFactory.getLogger(S_EquivalenceOverNamed_NewDAG_Test.class);

	public S_EquivalenceOverNamed_NewDAG_Test (String name){
		super(name);
	}

	public void testNamedAndEquivalences() throws Exception {
		ArrayList<String> input = new ArrayList<>();
		input.add("src/test/resources/test/stockexchange-unittest.owl");
		input.add("src/test/resources/test/dag/test-equivalence-roles-inverse.owl");
		input.add("src/test/resources/test/dag/test-role-hierarchy.owl");
		/** C = B -> ER -> A*/
		input.add("src/test/resources/test/newDag/equivalents1.owl");
		/** B -> A -> ER=C */
		input.add("src/test/resources/test/newDag/equivalents2.owl");
		/** C->B = ER -> A*/
		input.add("src/test/resources/test/newDag/equivalents3.owl");
		/** ER-> A=B=C */
		input.add("src/test/resources/test/newDag/equivalents4.owl");
		/** C=ER=A->B */
		input.add("src/test/resources/test/newDag/equivalents5.owl");
		/** D-> ER=C=B -> A*/
		input.add("src/test/resources/test/newDag/equivalents6.owl");
		/** P-> ER=B -> A  C=L ->ES-> ER */
		input.add("src/test/resources/test/newDag/equivalents7.owl");
		/** B->A=ET->ER C->ES=D->A*/
		input.add("src/test/resources/test/newDag/equivalents8.owl");

		/** C = B -> ER- -> A*/
		input.add("src/test/resources/test/newDag/inverseEquivalents1.owl");
		/** B -> A -> ER- = C */
		input.add("src/test/resources/test/newDag/inverseEquivalents2.owl");
		/** C->B = ER- -> A*/
		input.add("src/test/resources/test/newDag/inverseEquivalents3.owl");
		/** ER- -> A=B=C */
		input.add("src/test/resources/test/newDag/inverseEquivalents4.owl");
		/** C=ER- =A->B */
		input.add("src/test/resources/test/newDag/inverseEquivalents5.owl");
		/** D-> ER  ER- =C=B -> A*/
		input.add("src/test/resources/test/newDag/inverseEquivalents6.owl");
		/** D->  ER- =C=B -> A*/
		input.add("src/test/resources/test/newDag/inverseEquivalents6b.owl");
		/** P-> ER- =B -> A  C=L ->ES- -> ER- */
		input.add("src/test/resources/test/newDag/inverseEquivalents7.owl");
		/** B->A=ET- ->ER- C->ES- = D->A*/
		input.add("src/test/resources/test/newDag/inverseEquivalents8.owl");

		//for each file in the input
		for (String fileInput : input){
			ClassifiedTBoxImpl reasoner = (ClassifiedTBoxImpl) loadOntologyFromFileAndClassify(fileInput);
			//transform in a named graph
			TestClassifiedTBoxImpl_OnNamedDAG namedDag2 = new TestClassifiedTBoxImpl_OnNamedDAG(reasoner);
			log.debug("Input {}", fileInput);
			log.info("First graph {}", reasoner.getClassGraph());
			log.info("First graph {}", reasoner.getObjectPropertyGraph());
			log.info("Second dag {}", namedDag2);
			TestClassifiedTBoxImpl_Named dag2 = new TestClassifiedTBoxImpl_Named(reasoner);

			assertTrue(testDescendants(dag2.classesDAG(), namedDag2.classesDAG()));
			assertTrue(testDescendants(dag2.objectPropertiesDAG(), namedDag2.objectPropertiesDAG()));
			assertTrue(testDescendants(namedDag2.classesDAG(), dag2.classesDAG()));
			assertTrue(testDescendants(namedDag2.objectPropertiesDAG(), dag2.objectPropertiesDAG()));
			assertTrue(testChildren(dag2.classesDAG(), namedDag2.classesDAG()));
			assertTrue(testChildren(dag2.objectPropertiesDAG(), namedDag2.objectPropertiesDAG()));
			assertTrue(testChildren(namedDag2.classesDAG(), dag2.classesDAG()));
			assertTrue(testChildren(namedDag2.objectPropertiesDAG(), dag2.objectPropertiesDAG()));
			assertTrue(testAncestors(dag2.classesDAG(), namedDag2.classesDAG()));
			assertTrue(testAncestors(dag2.objectPropertiesDAG(), namedDag2.objectPropertiesDAG()));
			assertTrue(testAncestors(namedDag2.classesDAG(), dag2.classesDAG()));
			assertTrue(testAncestors(namedDag2.objectPropertiesDAG(), dag2.objectPropertiesDAG()));
			assertTrue(testParents(dag2.classesDAG(), namedDag2.classesDAG()));
			assertTrue(testParents(dag2.objectPropertiesDAG(), namedDag2.objectPropertiesDAG()));
			assertTrue(testParents(namedDag2.classesDAG(), dag2.classesDAG()));
			assertTrue(testParents(namedDag2.objectPropertiesDAG(), dag2.objectPropertiesDAG()));
//			assertTrue(checkVertexReduction(graph1, namedDag2, true));
			//check only if the number of edges is smaller
			//assertTrue(checkEdgeReduction(graph1, namedDag2, true)); COMMENTED OUT BY ROMAN
			assertTrue(checkforNamedVertexesOnly(namedDag2, reasoner));
		}
	}

	
	private static <T> boolean coincide(Set<Equivalences<T>> setd1, Set<Equivalences<T>> setd2) {
		
		Set<T> set1 = new HashSet<>();
		for (Equivalences<T> tEquivalences : setd1) {
			set1.addAll(tEquivalences.getMembers());
		}
		
		Set<T> set2 = new HashSet<>();
		for (Equivalences<T> ts : setd2) {
			set2.addAll(ts.getMembers());
		}
		return set1.equals(set2);		
	}
	
	private <T> boolean testDescendants(EquivalencesDAG<T> d1, EquivalencesDAG<T> d2) {
		
		for(Equivalences<T> node : d1) {
			Set<Equivalences<T>> setd1 = d1.getSub(node);
			log.info("vertex {}", node);
			log.debug("descendants {} ", setd1);
			Set<Equivalences<T>> setd2 = d2.getSub(node);
			log.debug("descendants {} ", setd2);
			if (!coincide(setd1, setd2))
				return false;
		}
		return true;
	}

	private <T> boolean testChildren(EquivalencesDAG<T> d1, EquivalencesDAG<T> d2){

		for(Equivalences<T> node : d1) {
			Set<Equivalences<T>> setd1	= d1.getDirectSub(node);
			log.info("vertex {}", node);
			log.debug("children {} ", setd1);
			Set<Equivalences<T>> setd2	= d2.getDirectSub(node);
			log.debug("children {} ", setd2);
			if (!coincide(setd1, setd2))
				return false;
		}

		return true;
	}
			
	
	private <T> boolean testAncestors(EquivalencesDAG<T> d1, EquivalencesDAG<T> d2) {
		
		for(Equivalences<T> v: d1){
			Set<Equivalences<T>> setd1 = d1.getSuper(v);
			log.info("vertex {}", v);
			log.debug("ancestors {} ", setd1);
			Set<Equivalences<T>> setd2 = d2.getSuper(v);
			log.debug("ancestors {} ", setd2);
			
			if (!coincide(setd1, setd2))
				return false;
		}
		return true;
	}

	private <T> boolean testParents(EquivalencesDAG<T> d1, EquivalencesDAG<T> d2) {
	
		for(Equivalences<T> node : d1) {
			Set<Equivalences<T>> setd1	= d1.getDirectSuper(node);
			log.info("vertex {}", node);
			log.debug("parents {} ", setd1);
			Set<Equivalences<T>> setd2	= d2.getDirectSuper(node);
			log.debug("parents {} ", setd2);
			if (!coincide(setd1, setd2))  
				return false;
		}
		return true;
	}

	private boolean checkforNamedVertexesOnly(TestClassifiedTBoxImpl_OnNamedDAG dag, ClassifiedTBox reasoner){
		for (Equivalences<ObjectPropertyExpression> node: dag.objectPropertiesDAG()) {
			ObjectPropertyExpression vertex = node.getRepresentative();
			if (!reasoner.objectPropertiesDAG().getVertex(vertex).isIndexed())
				return false;
		}
		for (Equivalences<DataPropertyExpression> node: dag.dataPropertiesDAG()) {
			DataPropertyExpression vertex = node.getRepresentative();
			if(!reasoner.dataPropertiesDAG().getVertex(vertex).isIndexed())
				return false;
		}
		for (Equivalences<ClassExpression> node: dag.classesDAG()) {
			ClassExpression vertex = node.getRepresentative();
			if (!reasoner.classesDAG().getVertex(vertex).isIndexed())
				return false;
		}
		return true;
	}
}


