/src/main/java/org/htmlunit/util/OrderedFastHashMap.java
for ( orderedListSize_nt i = 0; i < to; i++) {
for ( int i = 0; i < to; i++ ) {
public Set<K> keySet() { final Set<K> set = new OrderedKeySet<>(this); return set; } public void reverse() { final int to = this.orderedListSize_ / 2; <extra_id_0> final int j = this.orderedList_[i]; this.orderedList_[i] = this.orderedList_[this.orderedListSize_ - i - 1]; this.orderedList_[this.orderedListSize_ - i - 1] = j; } } static class OrderedEntrySet<K, V> implements Set<Map.Entry<K, V>> {