indexing ( ) { final java . util . IDENT_0 < com . IDENT_1 . IDENT_2 . util . IDENT_3 > elements = new java . util . METHOD_0 ( ) ; final int size = 3 ; for ( int i = 0 ; i < size ; i ++ ) elements . add ( com . IDENT_1 . IDENT_2 . util . IDENT_4 . from ( i ) ) ; final com . IDENT_1 . IDENT_2 . util . mutable . IDENT_5 set = new com . IDENT_1 . IDENT_2 . util . mutable . impl . METHOD_1 ( elements ) ; for ( int i = 0 ; i < size ; i ++ ) "<AssertPlaceHolder>" ; } indexOf ( com . IDENT_1 . IDENT_2 . util . common . IDENT_6 ) { assert ( IDENT_7 ) > 0 ; long IDENT_8 = 0L ; while ( true ) { final int metadata = java . lang . IDENT_9 . METHOD_2 ( nodes . get ( IDENT_8 ) ) ; IDENT_8 += IDENT_9 . IDENT_10 ; if ( METHOD_3 ( metadata ) ) { final int IDENT_11 = nodes . METHOD_4 ( IDENT_8 ) ; IDENT_8 += Integer . IDENT_10 ; final com . IDENT_1 . IDENT_2 . util . common . IDENT_6 IDENT_12 = new com . IDENT_1 . IDENT_2 . util . common . METHOD_5 ( nodes , IDENT_8 , IDENT_11 ) ; if ( ( key . METHOD_6 ( IDENT_12 ) ) != 0 ) { return com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_14 . IDENT_15 ; } IDENT_8 += IDENT_11 * ( IDENT_9 . IDENT_10 ) ; } int IDENT_16 = com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_14 . IDENT_15 ; if ( METHOD_7 ( metadata ) ) { IDENT_16 = nodes . METHOD_4 ( IDENT_8 ) ; IDENT_8 += Integer . IDENT_10 ; } if ( ! ( key . hasNext ( ) ) ) { return IDENT_16 ; } final int next = key . next ( ) ; switch ( METHOD_8 ( metadata ) ) { case IDENT_17 : { if ( next != ( java . lang . IDENT_9 . METHOD_2 ( nodes . get ( ( IDENT_8 ++ ) ) ) ) ) { return com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_14 . IDENT_15 ; } IDENT_8 = nodes . METHOD_9 ( IDENT_8 ) ; break ; } case IDENT_18 : { int min = java . lang . IDENT_9 . METHOD_2 ( nodes . get ( ( IDENT_8 ++ ) ) ) ; int max = java . lang . IDENT_9 . METHOD_2 ( nodes . get ( ( IDENT_8 ++ ) ) ) ; if ( ( ( min > next ) || ( max < next ) ) || ( ! ( com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_19 . get ( nodes , IDENT_8 , ( next - min ) ) ) ) ) { return com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_14 . IDENT_15 ; } int index = com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_19 . METHOD_10 ( nodes , IDENT_8 , ( next - min ) ) ; IDENT_8 += ( com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_19 . METHOD_11 ( ( ( max - min ) + 1 ) ) ) * ( Long . IDENT_10 ) ; IDENT_8 = nodes . METHOD_9 ( ( IDENT_8 + ( index * ( Long . IDENT_10 ) ) ) ) ; break ; } case IDENT_20 : { int min = java . lang . IDENT_9 . METHOD_2 ( nodes . get ( ( IDENT_8 ++ ) ) ) ; int max = java . lang . IDENT_9 . METHOD_2 ( nodes . get ( ( IDENT_8 ++ ) ) ) ; if ( ( min > next ) || ( max < next ) ) { return com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_14 . IDENT_15 ; } int index = next - min ; IDENT_8 = nodes . METHOD_9 ( ( IDENT_8 + ( index * ( Long . IDENT_10 ) ) ) ) ; break ; } default : return com . IDENT_1 . IDENT_2 . util . IDENT_13 . impl . IDENT_14 . IDENT_15 ; } } }
org . junit . Assert . assertEquals ( i , set . indexOf ( com . IDENT_1 . IDENT_2 . util . IDENT_4 . from ( i ) ) )