Buggy code:
_intercept = ( intercept ) ? 1 : 0 ; tweedie_link_power = 1 - ( tweedie_variance_power ) ; if ( ( tweedie_link_power ) == 0 ) link = Link . log ; _glm = new GLMParams ( family , tweedie_variance_power , link , tweedie_link_power ) ; source2 = new Frame ( source ) ; assert sorted ( ignored_cols ) ; if ( ( offset ) != null ) { if ( offset . isEnum ( ) ) throw new IllegalArgumentException ( ( ( "Categorical<seq2seq4repair_space>offsets<seq2seq4repair_space>are<seq2seq4repair_space>not<seq2seq4repair_space>supported.<seq2seq4repair_space>Can<seq2seq4repair_space>not<seq2seq4repair_space>use<seq2seq4repair_space>column<seq2seq4repair_space>'" + ( source2 . names ( ) [ source2 . find ( offset ) ] ) ) + "'<seq2seq4repair_space>as<seq2seq4repair_space>offset" ) ) ; int id = source . find ( offset ) ; int idx = Arrays . binarySearch ( ignored_cols , id ) ; if ( idx >= 0 ) Utils . remove ( ignored_cols , idx ) ; String name = source2 . names ( ) [ id ] ; source2 . add ( name , source2 . remove ( id ) ) ; _noffsets = 1 ; } if ( ( nlambdas ) == ( - 1 ) ) nlambdas = 100 ; if ( ( lambda_search ) && ( ( lambda . length ) > 1 ) ) throw new IllegalArgumentException ( "Can<seq2seq4repair_space>not<seq2seq4repair_space>supply<seq2seq4repair_space>both<seq2seq4repair_space>lambda_search<seq2seq4repair_space>and<seq2seq4repair_space>multiple<seq2seq4repair_space>lambdas.<seq2seq4repair_space>If<seq2seq4repair_space>lambda_search<seq2seq4repair_space>is<seq2seq4repair_space>on,<seq2seq4repair_space>GLM<seq2seq4repair_space>expects<seq2seq4repair_space>only<seq2seq4repair_space>one<seq2seq4repair_space>value<seq2seq4repair_space>of<seq2seq4repair_space>lambda_value,<seq2seq4repair_space>representing<seq2seq4repair_space>the<seq2seq4repair_space>lambda_value<seq2seq4repair_space>min<seq2seq4repair_space>(smallest<seq2seq4repair_space>lambda_value<seq2seq4repair_space>in<seq2seq4repair_space>the<seq2seq4repair_space>lambda_value<seq2seq4repair_space>search)." ) ; if ( ( response . isEnum ( ) ) && ( ( family ) != ( Family . binomial ) ) ) throw new IllegalArgumentException ( "Invalid<seq2seq4repair_space>response<seq2seq4repair_space>variable,<seq2seq4repair_space>trying<seq2seq4repair_space>to<seq2seq4repair_space>run<seq2seq4repair_space>regression<seq2seq4repair_space>with<seq2seq4repair_space>categorical<seq2seq4repair_space>response!" ) ; switch ( family ) { case poisson : case tweedie : if ( ( response . min ( ) ) < 0 ) throw new IllegalArgumentException ( ( ( "Illegal<seq2seq4repair_space>response<seq2seq4repair_space>column<seq2seq4repair_space>for<seq2seq4repair_space>family='" + ( family ) ) + "',<seq2seq4repair_space>response<seq2seq4repair_space>must<seq2seq4repair_space>be<seq2seq4repair_space>>=<seq2seq4repair_space>0." ) ) ; break ; case gamma : if ( ( response . min ( ) ) <= 0 ) throw new IllegalArgumentException ( "Invalid<seq2seq4repair_space>response<seq2seq4repair_space>for<seq2seq4repair_space>family='Gamma',<seq2seq4repair_space>response<seq2seq4repair_space>must<seq2seq4repair_space>be<seq2seq4repair_space>><seq2seq4repair_space>0!" ) ; break ; case binomial : if ( ( ( response . min ( ) ) < 0 ) || ( ( response . max ( ) ) > 1 ) ) throw new IllegalArgumentException ( "Illegal<seq2seq4repair_space>response<seq2seq4repair_space>column<seq2seq4repair_space>for<seq2seq4repair_space>family='Binomial',<seq2seq4repair_space>response<seq2seq4repair_space>must<seq2seq4repair_space>in<seq2seq4repair_space><0,1><seq2seq4repair_space>range!" ) ; break ; default : } toEnum = ( ( family ) == ( Family . binomial ) ) && ( ( ! ( response . isEnum ( ) ) ) && ( ( ( response . min ( ) ) < 0 ) || ( ( response . max ( ) ) > 1 ) ) ) ; Frame fr = DataInfo . prepareFrame ( source2 , response , ignored_cols , toEnum , true , true ) ; TransformType dt = TransformType . NONE ; if ( standardize ) dt = ( intercept ) ? TransformType . STANDARDIZE : TransformType . DESCALE ; _srcDinfo = new DataInfo ( fr , 1 , intercept , ( ( use_all_factor_levels ) || ( lambda_search ) ) , dt , TransformType . NONE ) ; if ( ( ! ( intercept ) ) && ( ( _srcDinfo . _cats ) > 0 ) ) throw new IllegalArgumentException ( "Models<seq2seq4repair_space>with<seq2seq4repair_space>no<seq2seq4repair_space>intercept<seq2seq4repair_space>are<seq2seq4repair_space>only<seq2seq4repair_space>supported<seq2seq4repair_space>with<seq2seq4repair_space>all-numeric<seq2seq4repair_space>predictors." ) ; _activeData = _srcDinfo ; if ( higher_accuracy ) setHighAccuracy ( ) ; if ( ( beta_constraints ) != null ) { Vec v ; v = beta_constraints . vec ( "names" ) ; String [ ] dom = v . domain ( ) ; String [ ] names = Utils . append ( _srcDinfo . coefNames ( ) , "Intercept" ) ; int [ ] map = Utils . asInts ( v ) ; if ( ! ( Arrays . deepEquals ( dom , names ) ) ) { HashMap < String , Integer > m = new HashMap < String , Integer > ( ) ; for ( int i = 0 ; i < ( names . length ) ; ++ i ) m . put ( names [ i ] , i ) ; int [ ] newMap = MemoryManager . malloc4 ( dom . length ) ; <START_BUG> for ( int i = 0 ; i < ( dom . length ) ; ++ i ) { <END_BUG> Integer I = m . get ( dom [ map [ i ] ] ) ; newMap [ i ] = ( I == null ) ? - 1 : I ; } map = newMap ; } final int numoff = _srcDinfo . numStart ( ) ; if ( ( v = beta_constraints . vec ( "lower_bounds" ) ) != null ) { _lbs = ( map == null ) ? Utils . asDoubles ( v ) : mapVec ( Utils . asDoubles ( v ) , makeAry ( names . length , Double . NEGATIVE_INFINITY ) , map ) ; System . out . println ( ( "lower<seq2seq4repair_space>bounds<seq2seq4repair_space>=<seq2seq4repair_space>" + ( Arrays . toString ( _lbs ) ) ) ) ; if ( ( _srcDinfo . _normMul ) != null ) { for ( int i = numoff ; i < ( _srcDinfo . fullN ( ) ) ; ++ i ) { if ( Double . isInfinite ( _lbs [ i ] ) ) continue ; _lbs [ i ] //= _srcDinfo . _normMul [ ( i - numoff ) ] ; } } } if ( ( v = beta_constraints . vec ( "upper_bounds" ) ) != null ) { _ubs = ( map == null ) ? Utils . asDoubles ( v ) : mapVec ( Utils . asDoubles ( v ) , makeAry ( names . length , Double . POSITIVE_INFINITY ) , map ) ; System . out . println ( ( "upper<seq2seq4repair_space>bounds<seq2seq4repair_space>=<seq2seq4repair_space>" + ( Arrays . toString ( _ubs ) ) ) ) ; if ( ( _srcDinfo . _normMul ) != null ) for ( int i = numoff ; i < ( _srcDinfo . fullN ( ) ) ; ++ i ) { if ( Double . isInfinite ( _ubs [ i ] ) ) continue ; _ubs [ i ] //= _srcDinfo . _normMul [ ( i - numoff ) ] ;

Fix:
for ( int i = 0 ; i < ( map . length ) ; ++ i ) {