public int getIndex ( ) { if ( parent != null ) { for ( int i = 0 ; i < parent . children . size ( ) ; i ++ ) { if ( parent . children . get ( i ) == this ) { return i ; } } } return - 1 ; }
Returns the position of this node among its siblings .