Package org.apache.flex.compiler.tree.as

Examples of org.apache.flex.compiler.tree.as.IASNode

290
291
292
293
294
295
296
297
298
299
300
    @Override
    protected IABCBytesRequestResult handleABCBytesRequest() throws InterruptedException
    {
        ISyntaxTreeRequestResult syntaxTreeResult = getSyntaxTreeRequest().get();
        final IASNode rootNode = syntaxTreeResult.getAST();

        startProfile(Operation.GET_ABC_BYTES);
        try
        {
            final Collection<ICompilerProblem> problems = new LinkedList<ICompilerProblem>();
View Full Code Here
626
627
628
629
630
631
632
633
634
635
636
        //Create key value pair entries "key":"value"
        int entryCount = 0;
        for (int i = 0; i < fileNode.getChildCount(); i++)
        {
            IASNode node = fileNode.getChild(i);
            if (node instanceof ResourceBundleEntryNode)
            {
                entryCount++;
                ResourceBundleEntryNode entryNode = (ResourceBundleEntryNode)node;
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
    {
        StringBuilder builder = new StringBuilder();
        int length = getContentsNode().getChildCount();
        for (int i = 0; i < length; i++)
        {
            IASNode child = getContentsNode().getChild(i);
            if (child instanceof ILiteralNode)
            {
                builder.append(((ILiteralNode) child).getValue(rawValue));
            }
        }
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
173
        final ContainerNode contents = getContentsNode();
        final int size = contents.getChildCount();

        if (size > 0)
        {
            final IASNode lastLiteralNode = contents.getChild(size - 1);
            if (lastLiteralNode.getNodeID() == ASTNodeID.LiteralXMLID)
            {
                final LiteralNode appendTarget = (LiteralNode) lastLiteralNode;
                if (!appendTarget.value.equals("<>"))
                {
                    appendTarget.value = appendTarget.value.concat(token
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
        }
        else
        {

            ISyntaxTreeRequestResult syntaxTreeResult = getSyntaxTreeRequest().get();
            IASNode rootNode = syntaxTreeResult.getAST();
            if (rootNode == null)
            {
                return new ABCBytesRequestResult(syntaxTreeResult.getProblems());
            }
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
    @Override
    public VariableClassification getVariableClassification()
    {
        IScopedNode scopedNode = getScopeNode();
       
        IASNode node = scopedNode;
       
        if (node instanceof ICommonClassNode || node.getParent() instanceof ICommonClassNode)
            return VariableClassification.CLASS_MEMBER;
       
        if (node.getParent() instanceof IInterfaceNode)
            return VariableClassification.INTERFACE_MEMBER;
       
        if (node.getParent() instanceof PackageNode)
            return VariableClassification.PACKAGE_MEMBER;
       
        return VariableClassification.LOCAL;
    }
View Full Code Here
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
        {
            checker.checkClassField(var, is_static);
            //  Massive kludge -- grovel over chained variable decls and add them one by one
            for ( int i = 0; i < var.getChildCount(); i++ )
            {
                IASNode candidate = var.getChild(i);

                if ( candidate instanceof VariableNode )
                {
                    declareVariable((VariableNode)candidate);
                }
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
        int childCount = baseInterfacesNode.getChildCount();
        if (baseInterfacesNode != null && childCount > 0)
        {
            for (int i = 0; i < childCount; i++)
            {
                IASNode child = baseInterfacesNode.getChild(i);
                if (child instanceof IIdentifierNode)
                {
                    interfaceNodeList.add(((IIdentifierNode)child));
                }
            }
View Full Code Here
258
259
260
261
262
263
264
265
266
267
268
        int childCount = baseInterfacesNode.getChildCount();
        if (baseInterfacesNode != null && childCount > 0)
        {
            for (int i = 0; i < childCount; i++)
            {
                IASNode child = baseInterfacesNode.getChild(i);
                if (child instanceof IIdentifierNode)
                {
                    interfaceNodeList.add(((IIdentifierNode)child).getName());
                }
            }
View Full Code Here
374
375
376
377
378
379
380
381
382
383
384
        {
            int n = baseInterfacesNode.getChildCount();
            IReference[] baseInterfaces = new IReference[n];
            for (int i = 0; i < n; i++)
            {
                IASNode child = baseInterfacesNode.getChild(i);
                if (child instanceof ExpressionNodeBase)
                    baseInterfaces[i] = ((ExpressionNodeBase)child).computeTypeReference();
            }
            definition.setExtendedInterfaceReferences(baseInterfaces);
        }
View Full Code Here
TOP

Related Classes of org.apache.flex.compiler.tree.as.IASNode

  • org.apache.flex.compiler.clients.ASC
  • org.apache.flex.compiler.clients.MXMLC
  • org.apache.flex.compiler.common.NodeReference
  • org.apache.flex.compiler.internal.as.codegen.ABCGeneratingReducer
  • org.apache.flex.compiler.internal.as.codegen.ASBeforeNodeStrategy
  • org.apache.flex.compiler.internal.as.codegen.ASBlockWalker
  • org.apache.flex.compiler.internal.as.codegen.ASEmitter
  • org.apache.flex.compiler.internal.as.codegen.ClassDirectiveProcessor
  • org.apache.flex.compiler.internal.as.codegen.ControlFlowContextManager
  • org.apache.flex.compiler.internal.as.codegen.LabelScopeControlFlowContext
    • 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.