METHOD_0 ( ) { resolver . METHOD_1 ( IDENT_0 , IDENT_1 ) ; "<AssertPlaceHolder>" ; } resolve ( ) { java . util . Map < T , java . util . Set < T > > graph = new java . util . HashMap < T , java . util . Set < T > > ( ) ; java . util . IDENT_2 < T > IDENT_3 = new java . util . IDENT_4 < T > ( ) ; IDENT_3 . addAll ( IDENT_5 ) ; IDENT_3 . METHOD_2 ( IDENT_6 ) ; for ( com . IDENT_7 . IDENT_8 . util . IDENT_9 . IDENT_10 < T > IDENT_11 : IDENT_12 ) { T object = IDENT_11 . object ; java . util . Set < T > IDENT_13 = new java . util . METHOD_3 ( ) ; graph . put ( object , IDENT_13 ) ; for ( T IDENT_14 : IDENT_11 . IDENT_15 ) { IDENT_13 . add ( IDENT_14 ) ; } if ( IDENT_13 . isEmpty ( ) ) { IDENT_3 . add ( object ) ; } } java . util . List < T > IDENT_16 = new java . util . ArrayList < T > ( ) ; for ( T item ; ( item = IDENT_3 . METHOD_4 ( ) ) != null ; ) { IDENT_16 . add ( item ) ; for ( Map . Entry < T , java . util . Set < T > > e : graph . entrySet ( ) ) { T object = e . getKey ( ) ; java . util . Set < T > IDENT_13 = e . getValue ( ) ; if ( ! ( IDENT_13 . isEmpty ( ) ) ) { IDENT_13 . remove ( item ) ; if ( IDENT_13 . isEmpty ( ) ) { IDENT_3 . add ( object ) ; } } } } if ( ( IDENT_16 . size ( ) ) < ( IDENT_12 . size ( ) ) ) { throw new java . lang . IllegalStateException ( STRING_0 ) ; } else { return IDENT_16 ; } }
org . junit . Assert . assertEquals ( com . IDENT_7 . IDENT_8 . util . Arrays . asList ( IDENT_1 , IDENT_0 ) , resolver . resolve ( ) )