Commit 305d31a1 authored by Ahmed's avatar Ahmed
Browse files

Merge branch 'master' of git.rwth-aachen.de:monticore/EmbeddedMontiArc/generators/EMAM2Cpp

parents 0240f2a8 7e9c51f0
...@@ -26,7 +26,6 @@ import java.util.Set; ...@@ -26,7 +26,6 @@ import java.util.Set;
import java.util.stream.Collectors; import java.util.stream.Collectors;
/** /**
* @author Sascha Schneiders
* Handles code generation for a component and its "subsymbols" * Handles code generation for a component and its "subsymbols"
*/ */
public class ComponentConverter { public class ComponentConverter {
......
...@@ -23,7 +23,6 @@ import java.util.Collection; ...@@ -23,7 +23,6 @@ import java.util.Collection;
import java.util.List; import java.util.List;
/** /**
* @author Sascha Schneiders
*/ */
public class ComponentConverterMethodGeneration { public class ComponentConverterMethodGeneration {
public static int currentGenerationIndex = 0; public static int currentGenerationIndex = 0;
......
...@@ -10,7 +10,6 @@ import de.monticore.symboltable.ImportStatement; ...@@ -10,7 +10,6 @@ import de.monticore.symboltable.ImportStatement;
import de.se_rwth.commons.logging.Log; import de.se_rwth.commons.logging.Log;
/** /**
* @author Sascha Schneiders
*/ */
public class ComponentInstanceConverter { public class ComponentInstanceConverter {
......
...@@ -14,8 +14,6 @@ import java.util.List; ...@@ -14,8 +14,6 @@ import java.util.List;
* Generates a execute method for math symbols. * Generates a execute method for math symbols.
* Can be extended by setSuccessors() to handle unknown symbols. Implements chain-of-responsibility pattern. * Can be extended by setSuccessors() to handle unknown symbols. Implements chain-of-responsibility pattern.
* *
* @author Sascha Schneiders
* @author Christoph Richter implemented chain-of-responsibility pattern
*/ */
public class ExecuteMethodGenerator extends BaseExecuteMethodGeneratorHandler { public class ExecuteMethodGenerator extends BaseExecuteMethodGeneratorHandler {
......
...@@ -24,7 +24,6 @@ import java.util.List; ...@@ -24,7 +24,6 @@ import java.util.List;
import java.util.Optional; import java.util.Optional;
/** /**
* @author Sascha Schneiders
*/ */
public class ExecuteMethodGeneratorHandler { public class ExecuteMethodGeneratorHandler {
......
...@@ -7,7 +7,6 @@ import de.monticore.lang.math._symboltable.expression.MathExpressionSymbol; ...@@ -7,7 +7,6 @@ import de.monticore.lang.math._symboltable.expression.MathExpressionSymbol;
import java.util.List; import java.util.List;
/** /**
* @author Sascha Schneiders
*/ */
public class ExecuteMethodGeneratorHelper { public class ExecuteMethodGeneratorHelper {
public static String generateIfConditionCode(MathConditionalExpressionSymbol mathConditionalExpressionSymbol, List<String> includeStrings) { public static String generateIfConditionCode(MathConditionalExpressionSymbol mathConditionalExpressionSymbol, List<String> includeStrings) {
......
...@@ -13,7 +13,6 @@ import java.util.ArrayList; ...@@ -13,7 +13,6 @@ import java.util.ArrayList;
import java.util.List; import java.util.List;
/** /**
* @author Sascha Schneiders
*/ */
public class ExecuteMethodGeneratorMatrixExpressionHandler { public class ExecuteMethodGeneratorMatrixExpressionHandler {
......
...@@ -11,8 +11,6 @@ import java.util.List; ...@@ -11,8 +11,6 @@ import java.util.List;
import java.util.Optional; import java.util.Optional;
/** /**
* @author Sascha Schneiders
* @author Christoph Richter
*/ */
public class ForLoopHeadConverter { public class ForLoopHeadConverter {
public static String getForLoopHeadCode(MathForLoopHeadSymbol mathForLoopHeadSymbol, List<String> includeStrings) { public static String getForLoopHeadCode(MathForLoopHeadSymbol mathForLoopHeadSymbol, List<String> includeStrings) {
......
...@@ -18,7 +18,6 @@ import java.util.ArrayList; ...@@ -18,7 +18,6 @@ import java.util.ArrayList;
import java.util.Optional; import java.util.Optional;
/** /**
* @author Sascha Schneiders
*/ */
public class MathConverter { public class MathConverter {
......
...@@ -23,8 +23,6 @@ import java.util.List; ...@@ -23,8 +23,6 @@ import java.util.List;
/** /**
* Manages the conversion from a MathOptimizationSymbol to executable C++ code. * Manages the conversion from a MathOptimizationSymbol to executable C++ code.
* *
* @author Christoph Richter
* @since 09th March 2018
*/ */
public class OptimizationSolverConverter { public class OptimizationSolverConverter {
......
...@@ -17,7 +17,6 @@ import java.util.List; ...@@ -17,7 +17,6 @@ import java.util.List;
/** /**
* Handles code generation for optimization symbols * Handles code generation for optimization symbols
* *
* @author Christoph Richter
*/ */
public class OptimizationSymbolHandler extends BaseExecuteMethodGeneratorHandler { public class OptimizationSymbolHandler extends BaseExecuteMethodGeneratorHandler {
......
...@@ -19,7 +19,6 @@ import de.se_rwth.commons.logging.Log; ...@@ -19,7 +19,6 @@ import de.se_rwth.commons.logging.Log;
import java.util.Optional; import java.util.Optional;
/** /**
* @author Sascha Schneiders
*/ */
public class PortConverter { public class PortConverter {
public static int counterConstantPortsIn = 0; public static int counterConstantPortsIn = 0;
......
...@@ -2,8 +2,6 @@ ...@@ -2,8 +2,6 @@
package de.monticore.lang.monticar.generator.cpp.converter; package de.monticore.lang.monticar.generator.cpp.converter;
/** /**
* @author Sascha Schneiders
* @author Christoph Richter
*/ */
public class StringIndexHelper { public class StringIndexHelper {
......
...@@ -30,7 +30,6 @@ import java.util.stream.Collectors; ...@@ -30,7 +30,6 @@ import java.util.stream.Collectors;
/** /**
* This is used to convert port types to their cpp equivalent * This is used to convert port types to their cpp equivalent
* *
* @author Sascha Schneiders
*/ */
public class TypeConverter { public class TypeConverter {
private static List<VariableType> nonPrimitiveVariableTypes = new ArrayList<>(); private static List<VariableType> nonPrimitiveVariableTypes = new ArrayList<>();
......
...@@ -6,7 +6,6 @@ import de.monticore.lang.monticar.generator.Variable; ...@@ -6,7 +6,6 @@ import de.monticore.lang.monticar.generator.Variable;
import de.se_rwth.commons.logging.Log; import de.se_rwth.commons.logging.Log;
/** /**
* @author Sascha Schneiders
*/ */
public class ConnectInstructionCPP extends ConnectInstruction { public class ConnectInstructionCPP extends ConnectInstruction {
public ConnectInstructionCPP(Variable variable1, Variable variable2) { public ConnectInstructionCPP(Variable variable1, Variable variable2) {
......
...@@ -5,7 +5,6 @@ import de.monticore.lang.monticar.generator.ConnectInstruction; ...@@ -5,7 +5,6 @@ import de.monticore.lang.monticar.generator.ConnectInstruction;
import de.monticore.lang.monticar.generator.Variable; import de.monticore.lang.monticar.generator.Variable;
/** /**
* @author Sascha Schneiders
*/ */
public class ConstantConnectInstructionCPP extends ConnectInstruction { public class ConstantConnectInstructionCPP extends ConnectInstruction {
......
...@@ -4,7 +4,6 @@ package de.monticore.lang.monticar.generator.cpp.mathopt.optimizationSolver.prob ...@@ -4,7 +4,6 @@ package de.monticore.lang.monticar.generator.cpp.mathopt.optimizationSolver.prob
/** /**
* Represents a convex (possibly non linear) optimization problem * Represents a convex (possibly non linear) optimization problem
* *
* @author Christoph Richter
*/ */
public class ConvexProblem extends QPProblem { public class ConvexProblem extends QPProblem {
} }
...@@ -4,7 +4,6 @@ package de.monticore.lang.monticar.generator.cpp.mathopt.optimizationSolver.prob ...@@ -4,7 +4,6 @@ package de.monticore.lang.monticar.generator.cpp.mathopt.optimizationSolver.prob
/** /**
* Represents a linear optimization problem * Represents a linear optimization problem
* *
* @author Christoph Richter
*/ */
public class LPProblem extends Problem { public class LPProblem extends Problem {
} }
...@@ -12,7 +12,6 @@ package de.monticore.lang.monticar.generator.cpp.mathopt.optimizationSolver.prob ...@@ -12,7 +12,6 @@ package de.monticore.lang.monticar.generator.cpp.mathopt.optimizationSolver.prob
* m number of constraints * m number of constraints
* A. Wächter and L. T. Biegler, ​On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming, Mathematical Programming 106(1), pp. 25-57, 2006 * A. Wächter and L. T. Biegler, ​On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming, Mathematical Programming 106(1), pp. 25-57, 2006
* *
* @author Christoph Richter
*/ */
public class NLPProblem extends ConvexProblem { public class NLPProblem extends ConvexProblem {
......
...@@ -14,7 +14,6 @@ import java.util.List; ...@@ -14,7 +14,6 @@ import java.util.List;
/** /**
* Analyses a MathOptimizationStatementSymbol for its problem class. * Analyses a MathOptimizationStatementSymbol for its problem class.
* *
* @author Christoph Richter
*/ */
public class OptimizationProblemClassification { public class OptimizationProblemClassification {
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment