/**
 * ============LICENSE_START=======================================================
 * org.onap.aai
 * ================================================================================
 * Copyright © 2017 AT&T Intellectual Property. All rights reserved.
 * ================================================================================
 * 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.
 * ============LICENSE_END=========================================================
 *
 * ECOMP is a trademark and service mark of AT&T Intellectual Property.
 */
package org.onap.aai.query.builder;

import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Optional;
import java.util.Set;

import org.apache.tinkerpop.gremlin.process.traversal.P;
import org.apache.tinkerpop.gremlin.process.traversal.Traversal;
import org.apache.tinkerpop.gremlin.process.traversal.Traversal.Admin;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversalSource;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__;
import org.apache.tinkerpop.gremlin.process.traversal.util.TraversalHelper;
import org.apache.tinkerpop.gremlin.structure.Direction;
import org.apache.tinkerpop.gremlin.structure.Edge;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import org.onap.aai.db.props.AAIProperties;
import org.onap.aai.exceptions.AAIException;
import org.onap.aai.introspection.Introspector;
import org.onap.aai.introspection.Loader;
import org.onap.aai.schema.enums.ObjectMetadata;
import org.onap.aai.schema.enums.PropertyMetadata;
import org.onap.aai.serialization.db.EdgeRule;
import org.onap.aai.serialization.db.EdgeRules;
import org.onap.aai.serialization.db.EdgeType;
import org.onap.aai.serialization.db.exceptions.NoEdgeRuleFoundException;

/**
 * The Class GraphTraversalBuilder.
 */
public abstract class GraphTraversalBuilder<E> extends QueryBuilder<E> {

	protected GraphTraversal<Vertex, E> traversal = null;
	protected Admin<Vertex, E> completeTraversal = null;
	private EdgeRules edgeRules = EdgeRules.getInstance();
	
	protected int parentStepIndex = 0;
	protected int containerStepIndex = 0;
	protected int stepIndex = 0;
	
	/**
	 * Instantiates a new graph traversal builder.
	 *
	 * @param loader the loader
	 */
	public GraphTraversalBuilder(Loader loader, GraphTraversalSource source) {
		super(loader, source);
		
		traversal = (GraphTraversal<Vertex, E>) __.<E>start();
		
	}
	
	/**
	 * Instantiates a new graph traversal builder.
	 *
	 * @param loader the loader
	 */
	public GraphTraversalBuilder(Loader loader, GraphTraversalSource source, EdgeRules edgeRules) {
		super(loader, source);
		this.edgeRules = edgeRules;
		traversal = (GraphTraversal<Vertex, E>) __.<E>start();
		
	}
	
	/**
	 * Instantiates a new graph traversal builder.
	 *
	 * @param loader the loader
	 * @param start the start
	 */
	public GraphTraversalBuilder(Loader loader, GraphTraversalSource source, Vertex start) {
		super(loader, source, start);
		
		traversal = (GraphTraversal<Vertex, E>) __.__(start);
		
	}
	
	/**
	 * Instantiates a new graph traversal builder.
	 *
	 * @param loader the loader
	 * @param start the start
	 */
	public GraphTraversalBuilder(Loader loader, GraphTraversalSource source, Vertex start, EdgeRules edgeRules) {
		super(loader, source, start);
		this.edgeRules = edgeRules;
		traversal = (GraphTraversal<Vertex, E>) __.__(start);
		
	}

	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> getVerticesByProperty(String key, Object value) {
		
		// correct value call because the index is registered as an Integer
		traversal.has(key, this.correctObjectType(value));
		
		stepIndex++;
		return (QueryBuilder<Vertex>) this;
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> getVerticesByProperty(final String key, final List<?> values) {
		
		//this is because the index is registered as an Integer
		List<Object> correctedValues = new ArrayList<>();
		for (Object item : values) {
			correctedValues.add(this.correctObjectType(item));
		}
		
		traversal.has(key, P.within(correctedValues));
		
		stepIndex++;
		return (QueryBuilder<Vertex>) this;
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> getVerticesExcludeByProperty(String key, Object value) {
		
		// correct value call because the index is registered as an Integer
		traversal.has(key, P.neq(this.correctObjectType(value)));
		
		stepIndex++;
		return (QueryBuilder<Vertex>) this;
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> getVerticesExcludeByProperty(final String key, final List<?> values) {
		
		//this is because the index is registered as an Integer
		List<Object> correctedValues = new ArrayList<>();
		for (Object item : values) {
			correctedValues.add(this.correctObjectType(item));
		}
		
		traversal.has(key, P.without(correctedValues));
		
		stepIndex++;
		return (QueryBuilder<Vertex>) this;
	}

	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> getChildVerticesFromParent(String parentKey, String parentValue, String childType) {
		traversal.has(parentKey, parentValue).has(AAIProperties.NODE_TYPE, childType);
		stepIndex++;
		return (QueryBuilder<Vertex>) this;
	}

	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> getTypedVerticesByMap(String type, Map<String, String> map) {
		
		for (Map.Entry<String, String> es : map.entrySet()) {
			traversal.has(es.getKey(), es.getValue());
			stepIndex++;
		}
		traversal.has(AAIProperties.NODE_TYPE, type);
		stepIndex++;
		return (QueryBuilder<Vertex>) this;
	}

	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> createKeyQuery(Introspector obj) {
		Set<String> keys = obj.getKeys();
		Object val;
		for (String key : keys) {
			val = obj.getValue(key);
			Optional<String> metadata = obj.getPropertyMetadata(key, PropertyMetadata.DB_ALIAS);
			if (metadata.isPresent()) {
				//use the db name for the field rather than the object model
				key = metadata.get();
			}
			if (val != null) {
				//this is because the index is registered as an Integer
				if (val.getClass().equals(Long.class)) {
					traversal.has(key,new Integer(val.toString()));
				} else {
					traversal.has(key, val);
				}
				stepIndex++;
			}
		}
		return (QueryBuilder<Vertex>) this;
	}

	@Override
	public QueryBuilder<Vertex> exactMatchQuery(Introspector obj) {
		this.createKeyQuery(obj);
		allPropertiesQuery(obj);
		this.createContainerQuery(obj);
		return (QueryBuilder<Vertex>) this;
	}
	
	private void allPropertiesQuery(Introspector obj) {
		Set<String> props = obj.getProperties();
		Set<String> keys = obj.getKeys();
		Object val;
		for (String prop : props) {
			if (obj.isSimpleType(prop) && !keys.contains(prop)) {
				val = obj.getValue(prop);
				if (val != null) {
					Optional<String> metadata = obj.getPropertyMetadata(prop, PropertyMetadata.DB_ALIAS);
					if (metadata.isPresent()) {
						//use the db name for the field rather than the object model
						prop = metadata.get();
					}
					//this is because the index is registered as an Integer
					if (val.getClass().equals(Long.class)) {
						traversal.has(prop,new Integer(val.toString()));
					} else {
						traversal.has(prop, val);
					}
					stepIndex++;
				}
			}
		}
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	
	public QueryBuilder<Vertex> createContainerQuery(Introspector obj) {
		String type = obj.getChildDBName();
		String abstractType = obj.getMetadata(ObjectMetadata.ABSTRACT);
		if (abstractType != null) {
			String[] inheritors = obj.getMetadata(ObjectMetadata.INHERITORS).split(",");
			traversal.has(AAIProperties.NODE_TYPE, P.within(inheritors));
		} else {
			traversal.has(AAIProperties.NODE_TYPE, type);
		}
		stepIndex++;
		markContainer();
		return (QueryBuilder<Vertex>) this;
	}

	/**
	 * @throws NoEdgeRuleFoundException 
	 * @throws AAIException 
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> createEdgeTraversal(EdgeType type, Introspector parent, Introspector child) throws AAIException {
		String isAbstractType = parent.getMetadata(ObjectMetadata.ABSTRACT);
		if ("true".equals(isAbstractType)) {
			markParentBoundary();
			traversal.union(handleAbstractEdge(type, parent, child));
			stepIndex++;
		} else {
			this.edgeQueryToVertex(type, parent, child, null);
		}
		return (QueryBuilder<Vertex>) this;
			
	}

	/**
	 *
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<Vertex> createEdgeTraversalWithLabels(EdgeType type, Introspector out, Introspector in, List<String> labels) throws AAIException {
		this.edgeQueryToVertex(type, out, in, labels);
		return (QueryBuilder<Vertex>) this;
	}


	private Traversal<Vertex, Vertex>[] handleAbstractEdge(EdgeType type, Introspector abstractParent, Introspector child) throws AAIException, NoEdgeRuleFoundException {
		String childName = child.getDbName();
		String inheritorMetadata = abstractParent.getMetadata(ObjectMetadata.INHERITORS);
		String[] inheritors = inheritorMetadata.split(",");
		List<Traversal<Vertex, Vertex>> unionTraversals = new ArrayList<>(inheritors.length);

		for (int i = 0; i < inheritors.length; i++) {
			String inheritor = inheritors[i];
			if (edgeRules.hasEdgeRule(inheritor, childName) || edgeRules.hasEdgeRule(childName, inheritor)) {
				Map<String, EdgeRule> rules = edgeRules.getEdgeRules(type, inheritor, childName);
				GraphTraversal<Vertex, Vertex> innerTraversal = __.start();
				
				final List<String> inLabels = new ArrayList<>();
				final List<String> outLabels = new ArrayList<>();

				rules.forEach((k,v) -> {
					if (v.getDirection().equals(Direction.IN)) {
						inLabels.add(k);
					} else {
						outLabels.add(k);
					}
				} );
		
				if (inLabels.isEmpty() && !outLabels.isEmpty()) {
					innerTraversal.out(outLabels.toArray(new String[outLabels.size()]));
				} else if (outLabels.isEmpty() && !inLabels.isEmpty()) {
					innerTraversal.in(inLabels.toArray(new String[inLabels.size()]));
				} else {				
					innerTraversal.union(__.out(outLabels.toArray(new String[outLabels.size()])), __.in(inLabels.toArray(new String[inLabels.size()])));
				}
				
				innerTraversal.has(AAIProperties.NODE_TYPE, childName);
				unionTraversals.add(innerTraversal);
			}
		}
		
		return unionTraversals.toArray(new Traversal[unionTraversals.size()]);
	}

	public QueryBuilder<Edge> getEdgesBetweenWithLabels(EdgeType type, String outNodeType, String inNodeType, List<String> labels) throws AAIException {
		Introspector outObj = loader.introspectorFromName(outNodeType);
		Introspector inObj = loader.introspectorFromName(inNodeType);
		this.edgeQuery(type, outObj, inObj, labels);

		return (QueryBuilder<Edge>)this;
	}


	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<E> union(QueryBuilder... builder) {
		GraphTraversal<Vertex, Vertex>[] traversals = new GraphTraversal[builder.length];
		for (int i = 0; i < builder.length; i++) {
			traversals[i] = (GraphTraversal<Vertex, Vertex>)builder[i].getQuery();
		}
		this.traversal.union(traversals);
		stepIndex++;
		
		return this;
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<E> where(QueryBuilder... builder) {
		GraphTraversal<Vertex, Vertex>[] traversals = new GraphTraversal[builder.length];
		for (int i = 0; i < builder.length; i++) {
			this.traversal.where((GraphTraversal<Vertex, Vertex>)builder[i].getQuery());
			stepIndex++;
		}
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> store(String name) {
		
		this.traversal.store(name);
		stepIndex++;
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> cap(String name) {
		this.traversal.cap(name);
		stepIndex++;
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> unfold() {
		this.traversal.unfold();
		stepIndex++;
			
		return this;
	}
	
	@Override
	public QueryBuilder<E> dedup() {
		
		this.traversal.dedup();
		stepIndex++;
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> emit() {
		
		this.traversal.emit();
		stepIndex++;
		
		return this;
		
	}
	
	@Override
	public QueryBuilder<E> repeat(QueryBuilder<E> builder) {
		
		this.traversal.repeat((GraphTraversal<Vertex, E>)builder.getQuery());
		stepIndex++;

		return this;
	}
	
	@Override
	public QueryBuilder<E> until(QueryBuilder<E> builder) {
		this.traversal.until((GraphTraversal<Vertex,E>)builder.getQuery());
		stepIndex++;
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> groupCount() {
		this.traversal.groupCount();
		stepIndex++;
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> both() {
		this.traversal.both();
		stepIndex++;
		
		return this;
	}
	
	@Override
	public QueryBuilder<E> by(String name) {
		this.traversal.by(name);
		stepIndex++;
		
		return this;
	}
	
	/**
	 * {@inheritDoc}
	 */
	@Override
	public QueryBuilder<E> simplePath(){
		this.traversal.simplePath();
		stepIndex++;
		return this;
	}
	
	@Override
	public QueryBuilder<Edge> outE() {
		this.traversal.outE();
		stepIndex++;
		return (QueryBuilder<Edge>)this;
	}
	
	@Override
	public QueryBuilder<Edge> inE() {
		this.traversal.inE();
		stepIndex++;
		return (QueryBuilder<Edge>)this;
	}
	
	@Override
	public QueryBuilder<Vertex> outV() {
		this.traversal.outV();
		stepIndex++;
		return (QueryBuilder<Vertex>)this;
	}
	
	@Override
	public QueryBuilder<Vertex> inV() {
		this.traversal.inV();
		stepIndex++;
		return (QueryBuilder<Vertex>)this;
	}
	
	@Override
	public QueryBuilder<E> as(String name) {
		this.traversal.as(name);
		
		stepIndex++;
		return this;
	}
	
	@Override
	public QueryBuilder<E> not(QueryBuilder<E> builder) {
		this.traversal.not(builder.getQuery());
		
		stepIndex++;
		return this;
	}
	
	@Override
	public QueryBuilder<E> select(String name) {
		this.traversal.select(name);
		
		stepIndex++;
		
		return this;
	}
	
	/**
	 * Edge query.
	 *
	 * @param outObj the out type
	 * @param inObj the in type
	 * @throws NoEdgeRuleFoundException 
	 * @throws AAIException 
	 */
	private void edgeQueryToVertex(EdgeType type, Introspector outObj, Introspector inObj, List<String> labels) throws AAIException {
		String outType = outObj.getDbName();
		String inType = inObj.getDbName();
		
		if (outObj.isContainer()) {
			outType = outObj.getChildDBName();
		}
		if (inObj.isContainer()) {
			inType = inObj.getChildDBName();
		}
		markParentBoundary();
		Map<String, EdgeRule> rules;
		if (labels == null) {
			rules = edgeRules.getEdgeRules(type, outType, inType);
		} else {
			rules = edgeRules.getEdgeRulesWithLabels(type, outType, inType, labels);
		}
		
		final List<String> inLabels = new ArrayList<>();
		final List<String> outLabels = new ArrayList<>();

		rules.forEach((k, edgeRule) -> {
			if (labels != null && !labels.contains(k)) {
				return;
			} else {
				if (edgeRule.getDirection().equals(Direction.IN)) {
					inLabels.add(edgeRule.getLabel());
				} else {
					outLabels.add(edgeRule.getLabel());
				}
			}
		});

		if (inLabels.isEmpty() && !outLabels.isEmpty()) {
			traversal.out(outLabels.toArray(new String[outLabels.size()]));
		} else if (outLabels.isEmpty() && !inLabels.isEmpty()) {
			traversal.in(inLabels.toArray(new String[inLabels.size()]));
		} else {				
			traversal.union(__.out(outLabels.toArray(new String[outLabels.size()])), __.in(inLabels.toArray(new String[inLabels.size()])));
		}
		
		stepIndex++;

		this.createContainerQuery(inObj);
		
	}
	
	/**
	 * Edge query.
	 *
	 * @param outObj the out type
	 * @param inObj the in type
	 * @throws NoEdgeRuleFoundException 
	 * @throws AAIException 
	 */
	private void edgeQuery(EdgeType type, Introspector outObj, Introspector inObj, List<String> labels) throws AAIException {
		String outType = outObj.getDbName();
		String inType = inObj.getDbName();
		
		if (outObj.isContainer()) {
			outType = outObj.getChildDBName();
		}
		if (inObj.isContainer()) {
			inType = inObj.getChildDBName();
		}
		
		markParentBoundary();
		Map<String, EdgeRule> rules;
		if (labels == null) {
			rules = edgeRules.getEdgeRules(type, outType, inType);
		} else {
			rules = edgeRules.getEdgeRulesWithLabels(type, outType, inType, labels);
		}
		
		final List<String> inLabels = new ArrayList<>();
		final List<String> outLabels = new ArrayList<>();

		rules.forEach((k, edgeRule) -> {
			if (labels != null && !labels.contains(k)) {
				return;
			} else {
				if (edgeRule.getDirection().equals(Direction.IN)) {
					inLabels.add(edgeRule.getLabel());
				} else {
					outLabels.add(edgeRule.getLabel());
				}
			}
		});

		if (inLabels.isEmpty() && !outLabels.isEmpty()) {
			traversal.outE(outLabels.toArray(new String[outLabels.size()]));
		} else if (outLabels.isEmpty() && !inLabels.isEmpty()) {
			traversal.inE(inLabels.toArray(new String[inLabels.size()]));
		} else {				
			traversal.union(__.outE(outLabels.toArray(new String[outLabels.size()])), __.inE(inLabels.toArray(new String[inLabels.size()])));
		}
	}
	
	@Override
	public QueryBuilder<E> limit(long amount) {
		traversal.limit(amount);
		return this;
	}

	/**
	 * @{inheritDoc}
	 */
	@Override
	public <E2> E2 getQuery() {
		return (E2)this.traversal;
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public QueryBuilder<E> getParentQuery() {

		return cloneQueryAtStep(parentStepIndex);
	}
	
	@Override
	public QueryBuilder<E> getContainerQuery() {
		
		if (this.parentStepIndex == 0) {
			return removeQueryStepsBetween(0, containerStepIndex);
		} else {
			return cloneQueryAtStep(containerStepIndex);
		}
	}
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public void markParentBoundary() {
		parentStepIndex = stepIndex;
	}
	
	@Override
	public void markContainer() {
		containerStepIndex = stepIndex;
	}
	
	
	/**
	 * @{inheritDoc}
	 */
	@Override
	public Vertex getStart() {
		return this.start;
	}

	protected int getParentStepIndex() {
		return parentStepIndex;
	}

	protected int getContainerStepIndex() {
		return containerStepIndex;
	}

	protected int getStepIndex() {
		return stepIndex;
	}

	protected abstract QueryBuilder<E> cloneQueryAtStep(int index);
	/**
	 * end is exclusive
	 * 
	 * @param start
	 * @param end
	 * @return
	 */
	protected abstract QueryBuilder<E> removeQueryStepsBetween(int start, int end);
	
	private void executeQuery() {
		
		Admin admin;
		if (start != null) {
			this.completeTraversal = traversal.asAdmin();
		} else {
			admin = source.V().asAdmin();
			TraversalHelper.insertTraversal(admin.getEndStep(), traversal.asAdmin(), admin);
			
			this.completeTraversal = (Admin<Vertex, E>) admin;

		}
		
		
	}
	
	@Override
	public boolean hasNext() {
		if (this.completeTraversal == null) {
			executeQuery();
		}
		
		return this.completeTraversal.hasNext();
	}
	
	@Override
	public E next() {
		if (this.completeTraversal == null) {
			executeQuery();
		}
		
		return this.completeTraversal.next();
	}
	
	@Override
	public List<E> toList() {
		if (this.completeTraversal == null) {
			executeQuery();
		}
		
		return this.completeTraversal.toList();
	}

}