joern/src/tools/data_flow/Find_control_flow_paths.java
// To that end, the indices are sorted and elements are removed from the end.
To that end, the indices are sorted and elements are removed from the end.
To that end the indices are sorted and elements are removed from the end .
public static <T extends Comparable<T>> List<T> remove_indices(List<T> the_list, List<Long> indices)
     {
     List<T> ret = new ArrayList(the_list);
      Collections.sort(indices);
       for(int i=indices.size()-1; i>=0; --i)
        {
         ret.remove(indices.get(i).intValue());
        }
      return ret;
     }
public static < T extends Comparable < T > > List < T > remove_indices ( List < T > the_list , List < Long > indices ) { List < T > ret = new ArrayList ( the_list ) ; Collections . sort ( indices ) ; for ( int i = indices . size ( ) - 1 ; i >= 0 ; -- i ) { ret . remove ( indices . get ( i ) . intValue ( ) ) ; } return ret ; }
To that end, the indices are sorted and elements are removed from the end.
To that end the indices are sorted and elements are removed from the end .