/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.
 */

package org.apache.flink.graph.asm.translate;

import org.apache.flink.api.java.DataSet;
import org.apache.flink.graph.Edge;
import org.apache.flink.graph.Graph;
import org.apache.flink.graph.Vertex;
import org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingGraph;
import org.apache.flink.util.Preconditions;

import static org.apache.flink.api.common.ExecutionConfig.PARALLELISM_DEFAULT;
import static org.apache.flink.graph.asm.translate.Translate.translateEdgeIds;
import static org.apache.flink.graph.asm.translate.Translate.translateVertexIds;

/**
 * Translate {@link Vertex} and {@link Edge} IDs of a {@link Graph} using the given {@link TranslateFunction}
 *
 * @param <OLD> old graph ID type
 * @param <NEW> new graph ID type
 * @param <VV> vertex value type
 * @param <EV> edge value type
 */
public class TranslateGraphIds<OLD, NEW, VV, EV>
extends GraphAlgorithmWrappingGraph<OLD, VV, EV, NEW, VV, EV> {

	// Required configuration
	private TranslateFunction<OLD, NEW> translator;

	// Optional configuration
	private int parallelism = PARALLELISM_DEFAULT;

	/**
	 * Translate {@link Vertex} and {@link Edge} IDs of a {@link Graph} using the given {@link TranslateFunction}
	 *
	 * @param translator implements conversion from {@code OLD} to {@code NEW}
	 */
	public TranslateGraphIds(TranslateFunction<OLD, NEW> translator) {
		Preconditions.checkNotNull(translator);

		this.translator = translator;
	}

	/**
	 * Override the operator parallelism.
	 *
	 * @param parallelism operator parallelism
	 * @return this
	 */
	public TranslateGraphIds<OLD, NEW, VV, EV> setParallelism(int parallelism) {
		Preconditions.checkArgument(parallelism > 0 || parallelism == PARALLELISM_DEFAULT,
			"The parallelism must be greater than zero.");

		this.parallelism = parallelism;

		return this;
	}

	@Override
	protected String getAlgorithmName() {
		return TranslateGraphIds.class.getName();
	}

	@Override
	protected boolean mergeConfiguration(GraphAlgorithmWrappingGraph other) {
		Preconditions.checkNotNull(other);

		if (! TranslateGraphIds.class.isAssignableFrom(other.getClass())) {
			return false;
		}

		TranslateGraphIds rhs = (TranslateGraphIds) other;

		// verify that configurations can be merged

		if (translator != rhs.translator) {
			return false;
		}

		// merge configurations

		parallelism = (parallelism == PARALLELISM_DEFAULT) ? rhs.parallelism :
			((rhs.parallelism == PARALLELISM_DEFAULT) ? parallelism : Math.min(parallelism, rhs.parallelism));

		return true;
	}

	@Override
	public Graph<NEW, VV, EV> runInternal(Graph<OLD, VV, EV> input)
			throws Exception {
		// Vertices
		DataSet<Vertex<NEW, VV>> translatedVertices = translateVertexIds(input.getVertices(), translator, parallelism);

		// Edges
		DataSet<Edge<NEW, EV>> translatedEdges = translateEdgeIds(input.getEdges(), translator, parallelism);

		// Graph
		return Graph.fromDataSet(translatedVertices, translatedEdges, input.getContext());
	}
}