question: public double minDataDLIfExists ( int index , double expFPRate , boolean checkErr ) { double [ ] rulesetStat = new double [ 6 ] ; for ( int j = 0 ; j < m_SimpleStats . size ( ) ; j ++ ) { rulesetStat [ 0 ] += m_SimpleStats . get ( j ) [ 0 ] ; rulesetStat [ 2 ] += m_SimpleStats . get ( j ) [ 2 ] ; rulesetStat [ 4 ] += m_SimpleStats . get ( j ) [ 4 ] ; if ( j == m_SimpleStats . size ( ) - 1 ) { rulesetStat [ 1 ] = m_SimpleStats . get ( j ) [ 1 ] ; rulesetStat [ 3 ] = m_SimpleStats . get ( j ) [ 3 ] ; rulesetStat [ 5 ] = m_SimpleStats . get ( j ) [ 5 ] ; } } double potential = 0 ; for ( int k = index + 1 ; k < m_SimpleStats . size ( ) ; k ++ ) { double [ ] ruleStat = getSimpleStats ( k ) ; double ifDeleted = potential ( k , expFPRate , rulesetStat , ruleStat , checkErr ) ; if ( ! Double . isNaN ( ifDeleted ) ) { potential += ifDeleted ; } } double dataDLWith = dataDL ( expFPRate , rulesetStat [ 0 ] , rulesetStat [ 1 ] , rulesetStat [ 4 ] , rulesetStat [ 5 ] ) ; return ( dataDLWith - potential ) ; }
target:  Compute the minimal data description length of the ruleset if the rule in the given position is NOT deleted.<br> The min_data_DL_if_n_deleted = data_DL_if_n_deleted - potential