Package tree

Examples of tree.HaxeTree

114
115
116
117
118
119
120
121
122
123
124
        HaxeTree[] values = new HaxeTree[values().size()];
        values().toArray(values);
        int size = values.length;
        for (int i = size - 1; i >= 0; i--)
        {
            HaxeTree node = values[i];
            if (node instanceof Function)
            {
                return (Function)node;
            }
        }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
     * @param data - current environment or parent class
     * @return
     */
    private HaxeTree getDeclaration(final Object data, final String text)
    {
        HaxeTree decl = null;
        if (data instanceof Environment)
        {
            Environment env = (Environment)data;
            decl = env.get(text);
        }
View Full Code Here
166
167
168
169
170
171
172
173
174
175
176
177
178
179
        {
            return result;
        }
        // 4. types declared in imported files
        // TODO: What means - "if the searched package is empty"?
        HaxeTree node = imports.get(shortTypeName);
        if (node != null)
        {
            for (HaxeTree child : node.getChildren())
            {
                if (child instanceof HaxeType &&
                        child.getText().equals(shortTypeName))
                {
                    return (HaxeType)child;
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
    }
   
    @Override
    protected void visit(Assignment node, Object data)
    {
        HaxeTree leftOperand = node.getLeftOperand();
        HaxeTree rightOperand = node.getRightOperand();
       
        visit(leftOperand, data);
        visit(rightOperand, data);
       
        if (leftOperand.isUndefinedType())
        {
            leftOperand.setHaxeType(rightOperand.getHaxeType());
        }
       
        node.setHaxeType(leftOperand.getHaxeType(true));
    }
View Full Code Here
241
242
243
244
245
246
247
248
249
250
251
        // expected already marked as Error nodes - so there
        // is no variant that function will be null
        Function function = TreeUtils.getParentFunction(node);
        node.setFunction(function);
       
        HaxeTree expression = node.getExpression();
        if (expression == null)
        {
            return;
        }
        visit(expression, declarations);
View Full Code Here
264
265
266
267
268
269
270
271
272
273
274
275
    @Override
    protected void visit(Binary node, Object data)
    {
        Environment declarations = (Environment)data;
        HaxeTree leftNode = node.getLeftOperand();
        HaxeTree rightNode = node.getRightOperand();
       
        visit(leftNode, declarations);
        visit(rightNode, declarations);
       
        HaxeType definedType = node.defineResultType();
View Full Code Here
321
322
323
324
325
326
327
328
329
330
331
        if (project == null)
        {
            return;
        }
        CodeFile file = project.getFile(longName);
        HaxeTree ast = null;
        if (file == null && projectManager.getHaxeLib() != null)
        {
            file = projectManager.getHaxeLib().getFile(longName);
        }
        if (file != null)
View Full Code Here
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
        }
    }
   
    protected void visitMemberUse(Usage node, Object data)
    {
        HaxeTree decl = null;
        if (data instanceof Class)
        {
            Class parent = (Class)data;
            decl = parent.getDeclaration(node.getText());
        }
        node.setDeclarationNode(decl);

        if (!node.isFieldUse() && !(
                decl instanceof Class ||
                decl instanceof Enum)) //+ interface ??
        {
            return;
        }
       
        HaxeTree child = node.getChild(0).getChild(0);
        // slices and methcalls
        if (child instanceof MethodCall ||
                child instanceof Slice)
        {
            visit(child, decl);
View Full Code Here
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
                continue;
            }
            visit(child, data);
        }
       
        HaxeTree object = node.getObjectWhichIsCreated();
        String name = object.getText();
        HaxeTree declaration = null;
        for (String pack : imports.keySet())
        {
            // imports like a.b.c
            if (pack.equals(name))
            {
              HaxeTree pDeclaration = imports.get(pack);
              if (!(pDeclaration instanceof Class))
              {
                // TODO and what to do?
                return;
              }
View Full Code Here
455
456
457
458
459
460
461
462
463
464
465
        if (node.isFieldUse())
        {
            visit(node.getChild(node.getChildCount() - 1), data);
        }
       
        HaxeTree declaration = null;
        List<HaxeTree> params = node.getParameters();
       
        for (HaxeTree param : params)
        {
            visit(param, data);
View Full Code Here
TOP

Related Classes of tree.HaxeTree

  • imp.parser.antlr.HaxeParser
  • imp.parser.HaxeParseController
  • imp.utils.ContentProposer
  • imp.utils.HoverHelper
  • imp.utils.outline.AbstractLabelProvider
  • imp.utils.outline.OutlineBuilder
  • imp.utils.outline.OutlineLabelProvider
  • org.antlr.runtime.CommonToken
  • tests.AssignOperation
  • tests.BinaryOperationTests
    • 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.