]> gerrit.simantics Code Review - simantics/platform.git/blobdiff - bundles/org.simantics.scl.compiler/src/org/simantics/scl/compiler/elaboration/query/compilation/ExpressionConstraint.java
Fixed all line endings of the repository
[simantics/platform.git] / bundles / org.simantics.scl.compiler / src / org / simantics / scl / compiler / elaboration / query / compilation / ExpressionConstraint.java
index c80d59f37f1f0f8191f230b343dc1644c3197fed..f8a483776488ac01f6dbd01eeea7c9c64c06e35c 100644 (file)
-package org.simantics.scl.compiler.elaboration.query.compilation;\r
-\r
-import java.util.ArrayList;\r
-\r
-import org.simantics.scl.compiler.common.exceptions.InternalCompilerError;\r
-import org.simantics.scl.compiler.elaboration.contexts.ReplaceContext;\r
-import org.simantics.scl.compiler.elaboration.expressions.EVariable;\r
-import org.simantics.scl.compiler.elaboration.expressions.Expression;\r
-import org.simantics.scl.compiler.elaboration.expressions.Variable;\r
-import org.simantics.scl.compiler.errors.Locations;\r
-import org.simantics.scl.compiler.types.TVar;\r
-import org.simantics.scl.compiler.types.Type;\r
-\r
-import gnu.trove.map.hash.THashMap;\r
-import gnu.trove.procedure.TObjectObjectProcedure;\r
-import gnu.trove.set.hash.TIntHashSet;\r
-\r
-public class ExpressionConstraint extends QueryConstraint {\r
-    Variable variable;\r
-    Expression expression;\r
-    boolean isPattern;\r
-    \r
-    long forwardVariableMask;\r
-    long backwardVariableMask;\r
-    \r
-    ArrayList<Variable> globalVariables;\r
-    \r
-    public ExpressionConstraint(final ConstraintCollectionContext context, Variable variable,\r
-            Expression expression, boolean isPattern) {\r
-        this.variable = variable;\r
-        this.expression = expression;\r
-        this.isPattern = isPattern;\r
-        \r
-        final TIntHashSet vars = new TIntHashSet();\r
-        expression.collectVars(context.getVariableMap(), vars);\r
-        \r
-        int var1 = context.variableMap.get(variable);\r
-        vars.add(var1);\r
-        backwardVariableMask = 1L << var1;\r
-        \r
-        variables = vars.toArray();\r
-        \r
-        for(int v : variables)\r
-            forwardVariableMask |= 1L << v;\r
-        forwardVariableMask ^= backwardVariableMask;\r
-        \r
-        this.globalVariables = context.variables;\r
-    }\r
-    \r
-    private boolean canBeSolvedForwards(long boundVariables) {\r
-        return (forwardVariableMask & boundVariables) == forwardVariableMask;\r
-    }\r
-    \r
-    private boolean canBeSolvedBackwards(long boundVariables) {\r
-        return (backwardVariableMask & boundVariables) == backwardVariableMask;\r
-    }\r
-    \r
-    @Override\r
-    public boolean canBeSolvedFrom(long boundVariables) {\r
-        return canBeSolvedForwards(boundVariables) || (isPattern && canBeSolvedBackwards(boundVariables));  \r
-    }\r
-    \r
-    @Override\r
-    public double getSolutionCost(long boundVariables) {\r
-        return 1.0;\r
-    }\r
-    \r
-    @Override\r
-    public double getSolutionBranching(long boundVariables) {\r
-        if(canBeSolvedForwards(boundVariables))\r
-            return (boundVariables&1)==0 ? 1.0 : 0.95;\r
-        else if(isPattern && canBeSolvedBackwards(boundVariables))\r
-            return 0.95;\r
-        else\r
-            return Double.POSITIVE_INFINITY;\r
-    }\r
-    \r
-    @Override\r
-    public void generate(final QueryCompilationContext context) {\r
-        if(canBeSolvedForwards(finalBoundVariables)) {\r
-            if(canBeSolvedBackwards(finalBoundVariables))\r
-                context.equalityCondition(expression.location, new EVariable(variable), expression);\r
-            else\r
-                context.let(variable, expression);\r
-        }\r
-        else if(canBeSolvedBackwards(finalBoundVariables)) {\r
-            Expression pattern = expression;\r
-            \r
-            long mask = forwardVariableMask & finalBoundVariables;\r
-            THashMap<Variable, Expression> map = new THashMap<Variable, Expression>();\r
-            if(mask != 0L) {\r
-                for(int variableId : variables)\r
-                    if( ((mask >> variableId)&1L) == 1L ) {\r
-                        Variable original = globalVariables.get(variableId);\r
-                        Variable newVariable = new Variable(original.getName() + "_temp", original.getType());\r
-                        map.put(original, new EVariable(newVariable));\r
-                    }\r
-                \r
-                ReplaceContext replaceContext = new ReplaceContext(new THashMap<TVar,Type>(0), map, context.getTypingContext());\r
-                pattern = pattern.replace(replaceContext);\r
-            }\r
-            context.match(pattern, new EVariable(variable), true);\r
-            map.forEachEntry(new TObjectObjectProcedure<Variable, Expression>() {\r
-                @Override\r
-                public boolean execute(Variable a, Expression b) {\r
-                    context.equalityCondition(Locations.NO_LOCATION, new EVariable(a), b);\r
-                    return true;\r
-                }\r
-            });\r
-        }\r
-        else\r
-            throw new InternalCompilerError(expression.location, "Error happened when tried to solve the query.");\r
-    }\r
-}\r
+package org.simantics.scl.compiler.elaboration.query.compilation;
+
+import java.util.ArrayList;
+
+import org.simantics.scl.compiler.common.exceptions.InternalCompilerError;
+import org.simantics.scl.compiler.elaboration.contexts.ReplaceContext;
+import org.simantics.scl.compiler.elaboration.expressions.EVariable;
+import org.simantics.scl.compiler.elaboration.expressions.Expression;
+import org.simantics.scl.compiler.elaboration.expressions.Variable;
+import org.simantics.scl.compiler.errors.Locations;
+import org.simantics.scl.compiler.types.TVar;
+import org.simantics.scl.compiler.types.Type;
+
+import gnu.trove.map.hash.THashMap;
+import gnu.trove.procedure.TObjectObjectProcedure;
+import gnu.trove.set.hash.TIntHashSet;
+
+public class ExpressionConstraint extends QueryConstraint {
+    Variable variable;
+    Expression expression;
+    boolean isPattern;
+    
+    long forwardVariableMask;
+    long backwardVariableMask;
+    
+    ArrayList<Variable> globalVariables;
+    
+    public ExpressionConstraint(final ConstraintCollectionContext context, Variable variable,
+            Expression expression, boolean isPattern) {
+        this.variable = variable;
+        this.expression = expression;
+        this.isPattern = isPattern;
+        
+        final TIntHashSet vars = new TIntHashSet();
+        expression.collectVars(context.getVariableMap(), vars);
+        
+        int var1 = context.variableMap.get(variable);
+        vars.add(var1);
+        backwardVariableMask = 1L << var1;
+        
+        variables = vars.toArray();
+        
+        for(int v : variables)
+            forwardVariableMask |= 1L << v;
+        forwardVariableMask ^= backwardVariableMask;
+        
+        this.globalVariables = context.variables;
+    }
+    
+    private boolean canBeSolvedForwards(long boundVariables) {
+        return (forwardVariableMask & boundVariables) == forwardVariableMask;
+    }
+    
+    private boolean canBeSolvedBackwards(long boundVariables) {
+        return (backwardVariableMask & boundVariables) == backwardVariableMask;
+    }
+    
+    @Override
+    public boolean canBeSolvedFrom(long boundVariables) {
+        return canBeSolvedForwards(boundVariables) || (isPattern && canBeSolvedBackwards(boundVariables));  
+    }
+    
+    @Override
+    public double getSolutionCost(long boundVariables) {
+        return 1.0;
+    }
+    
+    @Override
+    public double getSolutionBranching(long boundVariables) {
+        if(canBeSolvedForwards(boundVariables))
+            return (boundVariables&1)==0 ? 1.0 : 0.95;
+        else if(isPattern && canBeSolvedBackwards(boundVariables))
+            return 0.95;
+        else
+            return Double.POSITIVE_INFINITY;
+    }
+    
+    @Override
+    public void generate(final QueryCompilationContext context) {
+        if(canBeSolvedForwards(finalBoundVariables)) {
+            if(canBeSolvedBackwards(finalBoundVariables))
+                context.equalityCondition(expression.location, new EVariable(variable), expression);
+            else
+                context.let(variable, expression);
+        }
+        else if(canBeSolvedBackwards(finalBoundVariables)) {
+            Expression pattern = expression;
+            
+            long mask = forwardVariableMask & finalBoundVariables;
+            THashMap<Variable, Expression> map = new THashMap<Variable, Expression>();
+            if(mask != 0L) {
+                for(int variableId : variables)
+                    if( ((mask >> variableId)&1L) == 1L ) {
+                        Variable original = globalVariables.get(variableId);
+                        Variable newVariable = new Variable(original.getName() + "_temp", original.getType());
+                        map.put(original, new EVariable(newVariable));
+                    }
+                
+                ReplaceContext replaceContext = new ReplaceContext(new THashMap<TVar,Type>(0), map, context.getTypingContext());
+                pattern = pattern.replace(replaceContext);
+            }
+            context.match(pattern, new EVariable(variable), true);
+            map.forEachEntry(new TObjectObjectProcedure<Variable, Expression>() {
+                @Override
+                public boolean execute(Variable a, Expression b) {
+                    context.equalityCondition(Locations.NO_LOCATION, new EVariable(a), b);
+                    return true;
+                }
+            });
+        }
+        else
+            throw new InternalCompilerError(expression.location, "Error happened when tried to solve the query.");
+    }
+}