public DapGroup getGroup ( ) { if ( this . sort == DapSort . DATASET ) return null ; // Walk the parent node until we find a group DapNode group = parent ; while ( group != null ) { switch ( group . getSort ( ) ) { case DATASET : case GROUP : return ( DapGroup ) group ; default : group = group . getParent ( ) ; break ; } } return ( DapGroup ) group ; }
Closest containing group