Lines Matching refs:nil

37 TreeNavigationNodeDown *navigationNodeDown = nil;
38 TreeNavigationNodeUp *navigationNodeUp = nil;
39 TreeNavigationNodeEOF *navigationNodeEOF = nil;
44 static id<BaseTree> invalidNode = nil;
50 	if ( invalidNode == nil ) {
58 	if ( invalidNode == nil ) {
81     if ( self != nil ) {
82         children = nil;
85     return nil;
91     if ( self != nil ) {
97     return nil;
116     if ( children == nil || i >= [children count] ) {
117         return nil;
141     for (NSUInteger i = 0; children != nil && i < [children count]; i++) {
147     return nil;
152     if ( children == nil ) {
168     if ( t == nil ) {
169         return; // do nothing upon addChild(nil)
175         if ( children != nil && children == childTree.children ) {
179         if ( childTree.children != nil ) {
180             if ( children != nil ) { // must copy, this has children already
185                     // handle double-link stuff for each child of nil root
198     else { // child is not nil (don't care about children)
199         if ( children == nil ) {
220     if ( t == nil ) {
226     if ( children == nil ) {
241     if ( children == nil ) {
242         return nil;
252  *  a list (nil-root Tree).  num of children can increase or decrease.
263     if ( children == nil ) {
269     AMutableArray *newChildren = nil;
347     [self sanityCheckParentAndChildIndexes:nil At:-1];
391     return nil;
408     return nil;
418     return([self getAncestor:ttype] != nil);
426     while ( t != nil ) {
431     return nil;
439     if ( [self getParent] == nil )
440         return nil;
444     while ( t != nil ) {
458     return nil;
507     if ( children == nil || [children count] == 0 ) {
516     for (int i = 0; children != nil && i < [children count]; i++) {
537     return nil;
543     return nil;
562 	return nil;
569     if ( navigationNodeDown == nil )
587     if ( navigationNodeUp == nil )
606     if ( navigationNodeEOF == nil )