DefaultRelationshipRules.java

/*
 * JBoss, Home of Professional Open Source.
 *
 * See the LEGAL.txt file distributed with this work for information regarding copyright ownership and licensing.
 *
 * See the AUTHORS.txt file distributed with this work for a full listing of individual contributors.
 */
package org.teiid.designer.schema.tools.processing.internal;

import org.teiid.designer.schema.tools.model.schema.Relationship;
import org.teiid.designer.schema.tools.processing.RelationshipProcessor;
import org.teiid.designer.schema.tools.processing.RelationshipRules;

/**
 * @since 8.0
 */
public class DefaultRelationshipRules implements RelationshipRules {
	
	private RelationshipProcessor processor;
	
	public DefaultRelationshipRules(RelationshipProcessor processor) {
		this.processor = processor;
	}
	
	@Override
	public int calculateRelationship(int P_value, int C_value,
			boolean canBeRoot, int F_value) {
		boolean P_eq_0 = P_value == 0;
		boolean P_gt_threshold = P_value > processor.P_threshold();
		boolean P_eq_1 = !P_gt_threshold && P_value == 1;
		boolean P_le_threshold = P_value > 1 && P_value <= processor.P_threshold();

		boolean C_le_threshold = C_value > 1 && C_value <= processor.C_threshold();
		boolean C_gt_threshold = C_value > processor.C_threshold();
		boolean C_unbounded = C_value == -1;
		boolean C_mixed = C_value == -2;
		boolean C_eq_1 = !C_gt_threshold && C_value == 1;

		boolean F_gt_threshold = F_value > processor.F_threshold();

		int representation;

		if (P_eq_0) {
			// no parents to set so it doesn't matter
			representation = Relationship.KEY_IN_PARENT_SINGLE;
		} else if (P_eq_1 && C_eq_1) {
			if (F_gt_threshold || canBeRoot) {
				representation = Relationship.KEY_IN_PARENT_SINGLE;
			} else {
				representation = Relationship.MERGE_IN_PARENT_SINGLE;
			}
		} else if (P_eq_1 && C_le_threshold) {
			if (F_gt_threshold || canBeRoot) {
				representation = Relationship.KEY_IN_PARENT_MULTIPLE;
			} else {
				representation = Relationship.MERGE_IN_PARENT_MULTIPLE;
			}
		} else if (P_eq_1 && C_gt_threshold) {
			representation = Relationship.KEY_IN_CHILD;
		} else if (P_eq_1 && C_unbounded) {
			representation = Relationship.KEY_IN_CHILD;
		} else if (P_le_threshold && C_eq_1) {
			if (F_gt_threshold || canBeRoot) {
				representation = Relationship.KEY_IN_PARENT_SINGLE;
			} else {
				representation = Relationship.MERGE_IN_PARENT_SINGLE;
			}
		} else if (P_le_threshold && C_le_threshold) {
			if (F_gt_threshold || canBeRoot) {
				representation = Relationship.KEY_IN_PARENT_MULTIPLE;
			} else {
				representation = Relationship.MERGE_IN_PARENT_MULTIPLE;
			}
		} else if (P_le_threshold && C_gt_threshold) {
			representation = Relationship.RELATIONSHIP_TABLE;
		} else if (P_le_threshold && C_unbounded) {
			representation = Relationship.RELATIONSHIP_TABLE;
		} else if (P_le_threshold && C_mixed) {
			// TODO: We should give each parent relationship a different
			// representation. For now though, we'll just use relationship table
			representation = Relationship.RELATIONSHIP_TABLE;
		} else if (P_gt_threshold && C_eq_1) {
			representation = Relationship.KEY_IN_PARENT_SINGLE;
		} else if (P_gt_threshold && C_le_threshold) {
			representation = Relationship.KEY_IN_PARENT_MULTIPLE;
		} else if (P_gt_threshold && C_gt_threshold) {
			representation = Relationship.RELATIONSHIP_TABLE;
		} else if (P_gt_threshold && C_unbounded) {
			representation = Relationship.RELATIONSHIP_TABLE;
		} else if (P_gt_threshold && C_mixed) {
			// TODO: We should give each parent relationship a different
			// representation. For now though, we'll just use relationship table
			representation = Relationship.RELATIONSHIP_TABLE;
		} else {
			// We messed up and ended up in a choice that we thought wasn't
			// possible.
			// Rather than just dying, we'll use relationship table.
			representation = Relationship.RELATIONSHIP_TABLE;
		}
		return representation;
	}

}