Package tree

Examples of tree.HaxeTree

80
81
82
83
84
85
86
87
88
89
90
      }
      if (isNodeValidForUsageAnalysis(supposedNode))
      {
        return supposedNode;
      }
      HaxeTree node = null;
      if (supposedNode instanceof Usage)
      {
          return ((Usage)supposedNode).getDeclarationNode();
      }
      // TODO getValidNodeForUsageAnalysis - what to do with DotIdents?
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
      {
        return supposedNode;
      }
      if (supposedNode instanceof Class)
      {
          HaxeTree node = ((Class)supposedNode).getConstructor();
            return getValidNodeForCallAnalysis(node);
      }
      if (supposedNode instanceof NewNode)
      {
        // TODO by our logic here we should return function - not the
        // class or type
        HaxeTree node = ((NewNode)supposedNode).getObjectWhichIsCreated();
        return getValidNodeForCallAnalysis(node);
      }
      if (supposedNode instanceof MethodCall)
      {
        HaxeTree node = ((MethodCall)supposedNode).getDeclarationNode();
        return getValidNodeForCallAnalysis(node);
      }
      return getValidNodeForCallAnalysis(supposedNode.getParent());
    }
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
    {
        if (currentAST == null)
        {
            return null;
        }
        HaxeTree result = null;
        for (HaxeTree child : currentAST.getChildren())
        {
            result = getNodeByOffset(offset, length, child);
            if (result != null)
            {
                return result;
            }
        }
        if (currentAST.getMostLeftPosition() <= offset &&
                currentAST.getMostRightPosition() >= offset + length)
        {
            HaxeTree parent = currentAST.getParent();
            if (parent != null
                    && ( parent instanceof MethodCall || parent instanceof Slice))
            {
                return parent;
            }
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
*/
public class OutlineLabelProvider extends AbstractLabelProvider
{
  public String getText(final Object element)
  {
    HaxeTree n = (element instanceof ModelTreeNode) ? (HaxeTree) ((ModelTreeNode) element)
        .getASTNode()
        : (HaxeTree) element;

    return getLabelForHaxeTreeNode(n);
  }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
                && nodeType != null
                && searchObject.getHaxeType().getShortTypeName().equals(nodeType.getShortTypeName()))
        {
            addToResults(node);
        }
        HaxeTree init = node.getInitializationNode();
        if (init == null)
        {
            return;
        }
        visit (init, data);
View Full Code Here
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
    }

    @Override
    protected void visit(final NewNode node, Object data)
    {
        HaxeTree declaration = node.getDeclarationNode();
        if (declaration != null
                && searchObject instanceof Class
                // TODO check parameter types and so
                && declaration.getText().equals(searchObject.getText()))
        {
            addToResults(node);
        }
       
        // now visit the params if there are any
View Full Code Here
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
    }

    @Override
    protected void visit(final MethodCall node, Object data)
    {
        HaxeTree parent = node.getParent();
        HaxeTree decl = node.getDeclarationNode();
        if ((searchObject instanceof Function
                || parent instanceof NewNode) // for constructors
                && decl != null
                && decl.equals(searchObject))
        {
            addToResults(node);
        }
       
        for (HaxeTree param : node.getParameters())
View Full Code Here
308
309
310
311
312
313
314
315
316
        {
            addToResults(node);
        }
        if (node.isFieldUse())
        {
            HaxeTree child = node.getChild(0).getChild(0);
            visit(child, data);
        }
    }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
244
    private void doParse(final String contents) {
        HaxeLexer lexer = new HaxeLexer(new ANTLRStringStream(contents));
        tokenStream = new CommonTokenStream(lexer);
        //this.tokenStream.getTokens();
        System.out.print("Parsing file...");
        currentAST = new HaxeTree();

        try
        {
            currentAST = WorkspaceUtils.parseFileContents(tokenStream);
            System.out.println("success!");
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
        return putWithCustomName(name, declaration);
    }
   
    public boolean putWithCustomName(String name, HaxeTree declaration)
    {
        HaxeTree decl = get(name);
        if (decl == null)
        {
            super.put(name, declaration);
            return true;
        }
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.