OoasTools

/**

  *

  *                      OOAS Compiler

  *

  *       Copyright 2015, AIT Austrian Institute of Technology.

  * This code is based on the C# Version of the OOAS Compiler, which is

  * copyright 2015 by the Institute of Software Technology, Graz University

  * of Technology with portions copyright by the AIT Austrian Institute of

  * Technology. All rights reserved.

  *

  * SEE THE "LICENSE" FILE FOR THE TERMS UNDER WHICH THIS FILE IS PROVIDED.

  *

  * If you modify the file please update the list of contributors below to in-

  * clude your name. Please also stick to the coding convention of using TABs

  * to do the basic (block-level) indentation and spaces for anything after

  * that. (Enable the display of special chars and it should be pretty obvious

  * what this means.) Also, remove all trailing whitespace.

  *

  * Contributors:

  *               Willibald Krenn (AIT)

  *               Stephan Zimmerer (AIT)

  *               Markus Demetz (AIT)

  *               Christoph Czurda (AIT)

  *

  */

package org.momut.ooas.ast.statements;

///////////////////////////////////////////////

///  Qualitative Constraints

///

public final class QualitativeConstraintStatement extends Statement

{

	public enum QualitativeConstraintOperation { Equal, Deriv, Sum, Prod, Diff }

	private Identifier m_variable0;

	private Identifier m_variable1;

	private Identifier m_variable2;

	private final QualitativeConstraintOperation m_operation;

	public boolean tag = false; // says that this is an obs assignment (important for prolog code target)

	public Identifier variable0() { return m_variable0; }

	public Identifier variable1() { return m_variable1; }

	public Identifier variable2() { return m_variable2; }

	public QualitativeConstraintOperation operation() { return m_operation; }

	public QualitativeConstraintStatement(Identifier var0, Identifier var1, QualitativeConstraintOperation op, int aline, int apos)

	{

		super (StatementKind.QualConstraint, aline, apos);

		if (op == QualitativeConstraintOperation.Diff

				|| op == QualitativeConstraintOperation.Prod

				|| op == QualitativeConstraintOperation.Sum)

			throw new ArgumentException();

		m_variable0 = var0;

		m_variable1 = var1;

		m_variable2 = null;

		m_operation = op;

	}

	public QualitativeConstraintStatement(QualitativeConstraintStatement toCopy)

	{

		super (toCopy);

		m_variable0 = toCopy.m_variable0;

		m_variable1 = toCopy.m_variable1;

		m_variable2 = toCopy.m_variable2;

		m_operation = toCopy.m_operation;

		tag = toCopy.tag;

	}

	public QualitativeConstraintStatement(Identifier var0, Identifier var1, Identifier var2, QualitativeConstraintOperation op, int aline, int apos)

	{

		super (StatementKind.QualConstraint, aline, apos);

		if (op == QualitativeConstraintOperation.Deriv

				|| op == QualitativeConstraintOperation.Equal)

			throw new ArgumentException();

		m_variable0 = var0;

		m_variable1 = var1;

		m_variable2 = var2;

		m_operation = op;

	}

	@Override

	public /*override*/ void Accept(IAstVisitor visitor)

	{

		visitor.visit(this);

	}

	@Override

	public /*override*/ Statement Clone()

	{

		return new QualitativeConstraintStatement(this);

	}

	public void SetVariable0(Identifier newVal)

	{

		m_variable0 = newVal;

	}

	public void SetVariable1(Identifier newVal)

	{

		m_variable1 = newVal;

	}

	public void SetVariable2(Identifier newVal)

	{

		m_variable2 = newVal;

	}

}