String [ ] function ( ) { assert ( _taxa != null && _taxa . length > 0 ) ; String loc0 [ ] = new String [ _left . cardinality ( ) ] ; int loc1 = 0 ; for ( int loc2 = 0 ; loc2 < _left . length ( ) ; loc2 ++ ) { if ( _left . get ( loc2 ) ) { loc0 [ loc1 ++ ] = _taxa [ loc2 ] ; } } return loc0 ; }
get the leaves in the left half of the bipartition left | right . concode_field_sep String _taxa[] concode_elem_sep BitSet _right concode_elem_sep BitSet _left concode_field_sep void setBipartition concode_elem_sep String[] getRightLeaves concode_elem_sep void addLeafToLeft concode_elem_sep BitSet getRight concode_elem_sep boolean isEqual concode_elem_sep String[] getTaxa concode_elem_sep void addLeafToRight concode_elem_sep String toString concode_elem_sep BitSet getLeft concode_elem_sep boolean isCompatible