| /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | TreeVisitor.java | 54 boolean isNil = adaptor.isNil(t); in visit()
55 if ( action!=null && !isNil ) { in visit()
66 if ( action!=null && !isNil ) t = action.post(t); in visit()
|
| D | BaseTree.java | 99 if ( childTree.isNil() ) { // t is an empty node possibly with children in addChild()
147 if ( t.isNil() ) { in setChild()
208 if ( newTree.isNil() ) { in replaceChildren()
261 public boolean isNil() { in isNil() method in BaseTree
370 if ( !isNil() ) { in toStringTree()
382 if ( !isNil() ) { in toStringTree()
|
| D | BaseTreeAdaptor.java | 72 public boolean isNil(Object tree) { in isNil() method in BaseTreeAdaptor
73 return ((Tree)tree).isNil(); in isNil()
151 if ( newRootTree.isNil() ) { in becomeRoot()
171 if ( r!=null && r.isNil() ) { in rulePostProcessing()
|
| D | CommonTree.java | 76 public boolean isNil() { in isNil() method in CommonTree
189 if ( isNil() ) { in toString()
|
| /external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| D | BaseTree.js | 55 if ( childTree.isNil() ) { // t is an empty node possibly with children
102 if ( t.isNil() ) {
140 if ( newTree.isNil() ) {
192 isNil: function() {
257 if ( !this.isNil() ) {
269 if ( !this.isNil() ) {
|
| D | BaseTreeAdaptor.js | 27 isNil: function(tree) { method
28 return tree.isNil();
106 if ( newRootTree.isNil() ) {
125 if ( r && r.isNil() ) {
|
| D | CommonTree.js | 43 isNil: function() { method
120 if ( this.isNil() ) {
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | TreeVisitor.cs | 61 bool isNil = adaptor.IsNil(t); in Visit()
62 if (action != null && !isNil) in Visit()
71 if (action != null && !isNil) in Visit()
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | TreeVisitor.cs | 63 bool isNil = adaptor.IsNil( t ); in Visit()
64 if ( action != null && !isNil ) in Visit()
73 if ( action != null && !isNil ) in Visit()
|
| /external/antlr/runtime/Python3/antlr3/ |
| D | tree.py | 200 def isNil(self): member in Tree
342 def isNil(self, tree): member in TreeAdaptor
739 if childTree.isNil():
769 if t.isNil():
804 if newTree.isNil():
834 def isNil(self): member in BaseTree
921 if not self.isNil():
931 if not self.isNil():
982 def isNil(self, tree): member in BaseTreeAdaptor
983 return tree.isNil()
[all …]
|
| /external/antlr/runtime/Python/antlr3/ |
| D | tree.py | 200 def isNil(self): member in Tree
342 def isNil(self, tree): member in TreeAdaptor
743 if childTree.isNil():
773 if t.isNil():
809 if newTree.isNil():
839 def isNil(self): member in BaseTree
928 if not self.isNil():
938 if not self.isNil():
989 def isNil(self, tree): member in BaseTreeAdaptor
990 return tree.isNil()
[all …]
|
| /external/antlr/runtime/ActionScript/project/test/org/antlr/runtime/test/ |
| D | TestBitSet.as | 15 assertTrue(bitSet.isNil);
22 assertFalse(bitSet.isNil);
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | TreeVisitor.m | 86 BOOL isNil = [adaptor isNil:t];
87 if ( action != nil && !isNil ) {
98 if ( action != nil && !isNil ) t = [action post:(id<BaseTree>)t];
|
| D | BaseTree.m | 161 * and child isNil then this routine moves children to t via
174 if ( [childTree isNil] ) { // t is an empty node possibly with children
223 if ( [t isNil] ) {
271 if ( [newTree isNil] ) {
324 - (BOOL) isNil
511 if ( ![self isNil] ) {
523 if ( ![self isNil] ) {
|
| D | BaseTreeAdaptor.m | 96 - (BOOL) isNil:(id) tree
98 return [(id)tree isNil];
134 * and child isNil then you can decide it is ok to move children to t via
158 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
181 if ( [newRootTree isNil] ) {
201 if ( r != nil && [r isNil] ) {
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | LookaheadSet.java | 82 public boolean isNil() { in isNil() method in LookaheadSet
83 return tokenTypeSet.isNil(); in isNil()
|
| D | Label.java | 251 return !getSet().and(set).isNil(); in matches()
374 !edgeLabel.getSet().and(label.getSet()).isNil() ) { in intersect()
|
| /external/syzkaller/vendor/github.com/golang/protobuf/proto/ |
| D | table_merge.go | 105 if dst.isNil() {
108 if src.isNil() {
123 if fi.isPointer && sfp.getPointer().isNil() { // Could be slice or string
543 if !sp.isNil() {
559 if !sp.isNil() {
561 if dp.isNil() {
|
| D | discard.go | 110 if src.isNil() {
182 if !sp.isNil() {
191 if !sp.isNil() {
|
| D | table_marshal.go | 118 if ptr.isNil() {
134 if ptr.isNil() {
178 if f.isPointer && ptr.offset(f.field).getPointer().isNil() {
256 if ptr.offset(f.field).getPointer().isNil() {
263 if f.isPointer && ptr.offset(f.field).getPointer().isNil() {
2131 if p.isNil() {
2138 if p.isNil() {
2156 if v.isNil() {
2167 if v.isNil() {
2197 if p.isNil() {
[all …]
|
| /external/golang-protobuf/proto/ |
| D | table_merge.go | 105 if dst.isNil() {
108 if src.isNil() {
123 if fi.isPointer && sfp.getPointer().isNil() { // Could be slice or string
543 if !sp.isNil() {
559 if !sp.isNil() {
561 if dp.isNil() {
|
| D | discard.go | 110 if src.isNil() {
182 if !sp.isNil() {
191 if !sp.isNil() {
|
| D | table_marshal.go | 119 if ptr.isNil() {
135 if ptr.isNil() {
179 if f.isPointer && ptr.offset(f.field).getPointer().isNil() {
257 if ptr.offset(f.field).getPointer().isNil() {
266 if f.isPointer && ptr.offset(f.field).getPointer().isNil() {
2161 if p.isNil() {
2168 if p.isNil() {
2186 if v.isNil() {
2198 if v.isNil() {
2220 if p.isNil() {
[all …]
|
| /external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| D | BaseTree.as | 79 * and child isNil then this routine moves children to t via
87 if ( childTree.isNil ) { // t is an empty node possibly with children
133 if ( t.isNil ) {
168 if ( newTree.isNil ) {
214 public function get isNil():Boolean {
300 if ( !isNil ) {
312 if ( !isNil ) {
|
| D | BaseTreeAdaptor.as | 40 public function isNil(tree:Object):Boolean {
41 return Tree(tree).isNil;
71 * and child isNil then you can decide it is ok to move children to t via
94 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
120 if ( newRootTree.isNil ) {
138 if ( r!=null && r.isNil ) {
|