Package tree.type

Examples of tree.type.HaxeType

46
47
48
49
50
51
52
53
54
55
56
    {
        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();
       
        assertTrue(!TypeUtils.isAvailableAssignement(funType, type));
    }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
    {
        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();
       
        assertTrue(TypeUtils.isAvailableAssignement(funType, type));
    }
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
        HaxeTree initialization = node.getInitializationNode();
        if (initialization == null)
        {
            return;
        }
        HaxeType type = node.getHaxeType();
        HaxeType initType = initialization.getHaxeType(true);
        if (type == null || initType == null)
        {
            return;
        }
        if (!TypeUtils.isAvailableAssignement(type, initType))
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
        }
       
        for (HaxeTree child : node.getParameters())
        {
            visit(child, data);
            HaxeType ctype = child.getHaxeType(true);
            if (!ctype.equals(TypeUtils.getInt()))
            {
                ErrorPublisher.commitCastError(child, TypeUtils.getInt());
            }
        }
       
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
248
249
250
            // some member's type was undefined
            return;
        }
        // here we have...member's types are not from the same
        // hierarchy!
        HaxeType type = TypeUtils.getUnknown();
        for (HaxeTree child : node.getChildren())
        {
            HaxeType ctype = child.getHaxeType(true);
            if (child.getChildIndex() == 0)
            {
                type = ctype;
                continue;
            }
View Full Code Here
268
269
270
271
272
273
274
275
276
277
278
279
280
281
    }

    @Override
    protected void visit(final Return node, Object data)
    {
        HaxeType type = node.getHaxeType();
        Function function = node.getFunction();
       
        HaxeType funType = function == null
                ? TypeUtils.getVoid() : function.getHaxeType();
        if (!TypeUtils.isAvailableAssignement(funType, type))
        {
            ErrorPublisher.commitCastError(node, funType);
        }
View Full Code Here
391
392
393
394
395
396
397
398
399
400
401
        {
            visit(condition, data);
            return;
        }

        HaxeType bool = TypeUtils.getBool();
        if (!condition.getHaxeType().equals(bool))
        {
            ErrorPublisher.commitCastError(condition, bool);
        }
    }
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
        {
            return type1;
        }
       
        // we have to look their hierarchies deeper
        HaxeType typeFromHierarhy = null;
        for (HaxeType type : type1Hierarchy)
        {
            typeFromHierarhy = getCommonPrimaryType(type, type2);
        }
       
View Full Code Here
257
258
259
260
261
262
263
264
265
266
267
    }
   
    public static boolean areBothNumbers(
            final HaxeType type,final HaxeType type2)
    {
        HaxeType floatType = getFloat();
       
        // Int have Float in its type hierarchy so if we check
        // just for float it will mean that type can have int
        // as a parent, not just float
        return isAvailableAssignement(floatType, type) &&
View Full Code Here
221
222
223
224
225
226
227
228
229
230
231
232
233
234
    }

    @Override
    protected void visit(final Declaration node, Object data)
    {
        HaxeType nodeType = node.getHaxeType();
        if ((searchObject instanceof Class || searchObject instanceof Enum)
                && nodeType != null
                && searchObject.getHaxeType().getShortTypeName().equals(nodeType.getShortTypeName()))
        {
            addToResults(node);
        }
        HaxeTree init = node.getInitializationNode();
        if (init == null)
View Full Code Here
TOP

Related Classes of tree.type.HaxeType

  • imp.utils.HoverHelper
  • tests.AssignOperation
  • tests.ReturnNode
  • tests.VarDeclaration
  • tree.expression.Array
  • tree.expression.Assignment
  • tree.expression.Binary
  • tree.expression.BinaryOperaionContainer
  • tree.expression.Constant
  • tree.expression.Unary
    • 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.