METHOD_0 ( ) { double [ ] output = IDENT_0 . METHOD_1 ( new double [ INT_0 ] , com . IDENT_1 . IDENT_2 . IDENT_0 . IDENT_3 . IDENT_4 ) ; "<AssertPlaceHolder>" ; } METHOD_1 ( double [ ] , float ) { int IDENT_5 = ( ( int ) ( IDENT_6 ) ) / 1000 ; int length = IDENT_7 . length ; int IDENT_8 = ( com . IDENT_1 . IDENT_2 . IDENT_0 . IDENT_9 . IDENT_10 ) * IDENT_5 ; int IDENT_11 = METHOD_2 ( IDENT_6 ) ; boolean [ ] result = new boolean [ length ] ; if ( length < IDENT_11 ) { return IDENT_7 ; } int IDENT_12 = ( com . IDENT_1 . IDENT_2 . IDENT_0 . IDENT_9 . IDENT_13 ) * IDENT_5 ; double [ ] IDENT_14 = new double [ IDENT_12 ] ; double [ ] IDENT_15 = new double [ IDENT_12 ] ; for ( int position = 0 ; ( position + IDENT_12 ) < length ; position += IDENT_12 ) { java . lang . System . METHOD_3 ( IDENT_7 , position , IDENT_15 , 0 , IDENT_12 ) ; double IDENT_16 = METHOD_4 ( IDENT_15 , IDENT_14 ) ; java . util . Arrays . METHOD_5 ( result , position , ( position + IDENT_12 ) , ( IDENT_16 > ( IDENT_17 ) ) ) ; } METHOD_6 ( result , IDENT_8 ) ; int IDENT_18 = METHOD_7 ( result , IDENT_11 ) ; if ( IDENT_18 > 0 ) { int IDENT_19 = ( com . IDENT_1 . IDENT_2 . IDENT_0 . IDENT_9 . IDENT_20 ) * IDENT_5 ; METHOD_8 ( IDENT_19 ) ; double [ ] IDENT_21 = new double [ ( IDENT_7 . length ) - IDENT_18 ] ; int IDENT_22 = 0 ; for ( int i = 0 ; i < ( result . length ) ; i ++ ) { if ( result [ i ] ) { int IDENT_23 = i ; int IDENT_24 = 0 ; while ( ( i < ( result . length ) ) && ( result [ ( i ++ ) ] ) ) { IDENT_24 ++ ; } int IDENT_25 = IDENT_23 + IDENT_24 ; METHOD_9 ( IDENT_7 , IDENT_19 , IDENT_23 , IDENT_25 ) ; java . lang . System . METHOD_3 ( IDENT_7 , IDENT_23 , IDENT_21 , IDENT_22 , IDENT_24 ) ; IDENT_22 += IDENT_24 ; } } return IDENT_21 ; } else { return IDENT_7 ; } }
org . junit . Assert . assertThat ( output . length , org . hamcrest . Matchers . is ( org . hamcrest . Matchers . equalTo ( 0 ) ) )