public void reverse() { synchronized( mutex ) { list.reverse(); } } public void reverse( int from, int to ) {
public void reverse( int from, int to ) { synchronized( mutex ) { list.reverse( from, to ); } }
removeIndexes.reverse(); for (int index : removeIndexes.toArray()) { tryBlocks.remove(index);
public static <T> void shiftIntegerMapKeys(int startKey, int shift, TIntObjectMap<T> intToObject) { if (shift == 0) { return; } TIntList keysToShift = new TIntArrayList(intToObject.keys()); // Exclude anything before and including startKey for (int currentKey : keysToShift.toArray()) { if (currentKey <= startKey) { keysToShift.remove(currentKey); } } keysToShift.sort(); if (shift > 0) { // Shifting keys up, so start at the end to avoid overwriting keys. keysToShift.reverse(); } for (int currentKey : keysToShift.toArray()) { T obj = intToObject.get(currentKey); intToObject.remove(currentKey); intToObject.put(currentKey + shift, obj); } } }
public void reverse() { synchronized( mutex ) { list.reverse(); } } public void reverse( int from, int to ) {
@Override public void reverse() { synchronized( mutex ) { list.reverse(); } } @Override
public void reverse( int from, int to ) { synchronized( mutex ) { list.reverse( from, to ); } }
@Override public void reverse( int from, int to ) { synchronized( mutex ) { list.reverse( from, to ); } }
public void reverse() { synchronized( mutex ) { list.reverse(); } } public void reverse( int from, int to ) {
public void reverse() { synchronized( mutex ) { list.reverse(); } } public void reverse( int from, int to ) {
public void reverse( int from, int to ) { synchronized( mutex ) { list.reverse( from, to ); } }
public void reverse( int from, int to ) { synchronized( mutex ) { list.reverse( from, to ); } }
void reverseOrder() { if (!reverseOrder) throw new IllegalStateException("Switching order multiple times is not supported"); reverseOrder = false; edgeIds.reverse(); }
patterns.reverse();
patterns.reverse();
patterns.reverse();
patterns.reverse();