Mercurial > hg > truffle
comparison truffle/com.oracle.truffle.dsl.processor/src/com/oracle/truffle/dsl/processor/java/model/CodeTree.java @ 21951:9c8c0937da41
Moving all sources into truffle subdirectory
author | Jaroslav Tulach <jaroslav.tulach@oracle.com> |
---|---|
date | Wed, 17 Jun 2015 10:58:08 +0200 |
parents | graal/com.oracle.truffle.dsl.processor/src/com/oracle/truffle/dsl/processor/java/model/CodeTree.java@a665483c3881 |
children | dc83cc1f94f2 |
comparison
equal
deleted
inserted
replaced
21950:2a5011c7e641 | 21951:9c8c0937da41 |
---|---|
1 /* | |
2 * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. | |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | |
20 * or visit www.oracle.com if you need additional information or have any | |
21 * questions. | |
22 */ | |
23 package com.oracle.truffle.dsl.processor.java.model; | |
24 | |
25 import java.util.*; | |
26 | |
27 import javax.lang.model.type.*; | |
28 | |
29 public class CodeTree { | |
30 | |
31 private final CodeTreeKind kind; | |
32 | |
33 private CodeTree parent; | |
34 | |
35 private TypeMirror type; | |
36 private final String string; | |
37 | |
38 private List<CodeTree> children; | |
39 | |
40 CodeTree(CodeTree parent, CodeTreeKind kind, TypeMirror type, String string) { | |
41 this.parent = parent; | |
42 this.kind = kind; | |
43 this.type = type; | |
44 this.string = string; | |
45 } | |
46 | |
47 public void setParent(CodeTree parent) { | |
48 this.parent = parent; | |
49 } | |
50 | |
51 public CodeTree getParent() { | |
52 return parent; | |
53 } | |
54 | |
55 public TypeMirror getType() { | |
56 return type; | |
57 } | |
58 | |
59 public void add(CodeTree element) { | |
60 if (children == null) { | |
61 children = new ArrayList<>(); | |
62 } | |
63 element.setParent(this); | |
64 children.add(element); | |
65 } | |
66 | |
67 public final List<CodeTree> getEnclosedElements() { | |
68 return children; | |
69 } | |
70 | |
71 public final CodeTreeKind getCodeKind() { | |
72 return kind; | |
73 } | |
74 | |
75 public String getString() { | |
76 return string; | |
77 } | |
78 | |
79 public void setType(TypeMirror type) { | |
80 this.type = type; | |
81 } | |
82 | |
83 public boolean isEmpty() { | |
84 return children == null || children.isEmpty(); | |
85 } | |
86 | |
87 public boolean containsKind(CodeTreeKind k) { | |
88 if (this.kind == k) { | |
89 return true; | |
90 } | |
91 if (children != null) { | |
92 for (CodeTree child : children) { | |
93 if (child.containsKind(k)) { | |
94 return true; | |
95 } | |
96 } | |
97 } | |
98 return false; | |
99 } | |
100 | |
101 public boolean isSingleLine() { | |
102 return !containsKind(CodeTreeKind.NEW_LINE); | |
103 } | |
104 | |
105 } |