/*-
 * APT - Analysis of Petri Nets and labeled Transition systems
 * Copyright (C) 2016  Uli Schlachter
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

package uniol.apt.analysis.processmining.algebra;

/**
 * Operation that inverts a row in a matrix.
 * @author Uli Schlachter
 */
class MatrixOperationInvert implements MatrixOperation {
	private final int rowToChange;

	/**
	 * Constructor.
	 * @param rowToChange The row that should be inverted.
	 */
	public MatrixOperationInvert(int rowToChange) {
		this.rowToChange = rowToChange;
	}

	@Override
	public void applyTo(Matrix matrix) {
		for (int column = 0; column < matrix.getColumns(); column++) {
			matrix.set(rowToChange, column, -matrix.get(rowToChange, column));
		}
	}

	@Override
	public void reverseApplyTo(Matrix matrix) {
		applyTo(matrix);
	}
}

// vim: ft=java:noet:sw=8:sts=8:ts=8:tw=120
