Package tree.utils

Examples of tree.utils.Environment

267
268
269
270
271
272
273
274
275
276
        { {
            one(mockClass).getStandartTypeByName("Int");
            will(returnValue(intType));
        } });
        HaxeTree tree = parseFunction("function main() { var x; x=123 + 1; }");
        linker.visit(tree, new Environment());
        Binary node = TestHelper.getBinaryExpression(tree);
       
        assertTrue(node.getHaxeType() == TypeUtils.getInt());
    }
View Full Code Here
277
278
279
280
281
282
283
284
285
286
   
    @Test
    public void testFloatAfterAdditionExpectiong() throws RecognitionException
    {
        HaxeTree tree = parseFunction("function main() { var x; x=123.1 + 1; }");
        linker.visit(tree, new Environment());
        Binary node = TestHelper.getBinaryExpression(tree);
       
        assertTrue(node.getHaxeType() == TypeUtils.getFloat());
    }
View Full Code Here
287
288
289
290
291
292
293
294
295
296
   
    @Test
    public void testStringAfterAdditionExpectiong() throws RecognitionException
    {
        HaxeTree tree = parseFunction("function main() { var x; x=123 + \" monkeys\"; }");
        linker.visit(tree, new Environment());
        Binary node = TestHelper.getBinaryExpression(tree);
       
        assertTrue(node.getHaxeType() == TypeUtils.getString());
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
   
    @Test
    public void testIntToFloatInReturnNode() throws RecognitionException
    {
        HaxeTree tree = parseModule("class A { function main():Int { return 123.1;}}");
        linker.visit(tree, new Environment());
       
        Return returnNode = getReturnNode(tree);
        HaxeType type = returnNode.getHaxeType();
        Function function = returnNode.getFunction();   
        HaxeType funType = function.getHaxeType();
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
   
    @Test
    public void testFloatToIntInReturnNode() throws RecognitionException
    {
        HaxeTree tree = parseModule("class A { function main():Float { return 123;}}");
        linker.visit(tree, new Environment());
       
        Return returnNode = getReturnNode(tree);
        HaxeType type = returnNode.getHaxeType();
        Function function = returnNode.getFunction();
        HaxeType funType = function.getHaxeType();
View Full Code Here
72
73
74
75
76
77
78
79
      if (shiftedOffset == 0) {
        return null;
      }
    }
    //TODO look in the Environment
    Environment availableProposals = filterVars(sourceNode, sourceString);
    return createSourceProposals(availableProposals, sourceString, offset);
  }
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
   * @return the array list
   */
  private Environment filterVars(
      final HaxeTree nodeToStart, final String prefix)
  {
      Environment result = new Environment();
    HaxeTree parent = nodeToStart.getParent();
    if (parent == null)
    {
        return result;
    }
    result.putAll(filterVars(parent, prefix));
    for (HaxeTree commonTree : parent.getAllChildren())
    {
      if (commonTree.getText().startsWith(prefix)
              && (commonTree instanceof Declaration
              || commonTree instanceof Class
              || commonTree instanceof Function))
      {
        result.put(commonTree);
      }
    }
    return result;
  }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
    @Test
    public void testIntToFloat() throws RecognitionException
    {
        HaxeTree tree = parseFunction("function main() { var x:Int; x=123.1;}");
        linker.visit(tree, new Environment());
        Assignment node = TestHelper.getAssignment(tree);
       
        HaxeType firstType = node.getLeftOperand().getHaxeType();
        HaxeType secondType = node.getRightOperand().getHaxeType();
        assertTrue(!TypeUtils.isAvailableAssignement(firstType, secondType));
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
   
    @Test
    public void testFloatToInt() throws RecognitionException
    {
        HaxeTree tree = parseFunction("function main() { var x:Int; x=123;}");
        linker.visit(tree, new Environment());
        Assignment node = TestHelper.getAssignment(tree);

        HaxeType firstType = node.getLeftOperand().getHaxeType();
        HaxeType secondType = node.getRightOperand().getHaxeType();
        assertTrue(TypeUtils.isAvailableAssignement(secondType, firstType));
View Full Code Here
TOP

Related Classes of tree.utils.Environment

  • imp.utils.ContentProposer
  • tests.AssignOperation
  • tests.BinaryOperationTests
  • tests.ReturnNode
  • tree.expression.Declaration.DeclarationType
  • tree.HaxeTree
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.