Apache
/
commons-collections
mirror of https://github.com/apache/commons-collections.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Use if-else

This commit is contained in:
Gary Gregory 2024-06-23 14:21:16 -04:00
parent f5e0f2c099
commit f55d552c90
1 changed files with 113 additions and 121 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

234
src/main/java/org/apache/commons/collections4/map/Flat3Map.java
View File

@ -614,22 +614,20 @@ public class Flat3Map<K, V> implements IterableMap<K, V>, Serializable, Cloneabl
return true; return true;
} }
} }
} else { } else if (size > 0) {
if (size > 0) { final int hashCode = key.hashCode();
final int hashCode = key.hashCode(); switch (size) { // drop through
switch (size) { // drop through case 3:
case 3: if (hash3 == hashCode && key.equals(key3)) {
if (hash3 == hashCode && key.equals(key3)) { return true;
return true; }
} case 2:
case 2: if (hash2 == hashCode && key.equals(key2)) {
if (hash2 == hashCode && key.equals(key2)) { return true;
return true; }
} case 1:
case 1: if (hash1 == hashCode && key.equals(key1)) {
if (hash1 == hashCode && key.equals(key1)) { return true;
return true;
}
} }
} }
} }
@ -817,23 +815,21 @@ public class Flat3Map<K, V> implements IterableMap<K, V>, Serializable, Cloneabl
return value1; return value1;
} }
} }
} else { } else if (size > 0) {
if (size > 0) { final int hashCode = key.hashCode();
final int hashCode = key.hashCode(); switch (size) {
switch (size) { // drop through
// drop through case 3:
case 3: if (hash3 == hashCode && key.equals(key3)) {
if (hash3 == hashCode && key.equals(key3)) { return value3;
return value3; }
} case 2:
case 2: if (hash2 == hashCode && key.equals(key2)) {
if (hash2 == hashCode && key.equals(key2)) { return value2;
return value2; }
} case 1:
case 1: if (hash1 == hashCode && key.equals(key1)) {
if (hash1 == hashCode && key.equals(key1)) { return value1;
return value1;
}
} }
} }
} }
@ -947,28 +943,26 @@ public class Flat3Map<K, V> implements IterableMap<K, V>, Serializable, Cloneabl
return old; return old;
} }
} }
} else { } else if (size > 0) {
if (size > 0) { final int hashCode = key.hashCode();
final int hashCode = key.hashCode(); switch (size) { // drop through
switch (size) { // drop through case 3:
case 3: if (hash3 == hashCode && key.equals(key3)) {
if (hash3 == hashCode && key.equals(key3)) { final V old = value3;
final V old = value3; value3 = value;
value3 = value; return old;
return old; }
} case 2:
case 2: if (hash2 == hashCode && key.equals(key2)) {
if (hash2 == hashCode && key.equals(key2)) { final V old = value2;
final V old = value2; value2 = value;
value2 = value; return old;
return old; }
} case 1:
case 1: if (hash1 == hashCode && key.equals(key1)) {
if (hash1 == hashCode && key.equals(key1)) { final V old = value1;
final V old = value1; value1 = value;
value1 = value; return old;
return old;
}
} }
} }
} }
@ -1123,72 +1117,70 @@ public class Flat3Map<K, V> implements IterableMap<K, V>, Serializable, Cloneabl
return old; return old;
} }
} }
} else { } else if (size > 0) {
if (size > 0) { final int hashCode = key.hashCode();
final int hashCode = key.hashCode(); switch (size) { // drop through
switch (size) { // drop through case 3:
case 3: if (hash3 == hashCode && key.equals(key3)) {
if (hash3 == hashCode && key.equals(key3)) { final V old = value3;
final V old = value3; hash3 = 0;
hash3 = 0; key3 = null;
key3 = null; value3 = null;
value3 = null; size = 2;
size = 2; return old;
return old; }
} if (hash2 == hashCode && key.equals(key2)) {
if (hash2 == hashCode && key.equals(key2)) { final V old = value2;
final V old = value2; hash2 = hash3;
hash2 = hash3; key2 = key3;
key2 = key3; value2 = value3;
value2 = value3; hash3 = 0;
hash3 = 0; key3 = null;
key3 = null; value3 = null;
value3 = null; size = 2;
size = 2; return old;
return old; }
} if (hash1 == hashCode && key.equals(key1)) {
if (hash1 == hashCode && key.equals(key1)) { final V old = value1;
final V old = value1; hash1 = hash3;
hash1 = hash3; key1 = key3;
key1 = key3; value1 = value3;
value1 = value3; hash3 = 0;
hash3 = 0; key3 = null;
key3 = null; value3 = null;
value3 = null; size = 2;
size = 2; return old;
return old; }
} return null;
return null; case 2:
case 2: if (hash2 == hashCode && key.equals(key2)) {
if (hash2 == hashCode && key.equals(key2)) { final V old = value2;
final V old = value2; hash2 = 0;
hash2 = 0; key2 = null;
key2 = null; value2 = null;
value2 = null; size = 1;
size = 1; return old;
return old; }
} if (hash1 == hashCode && key.equals(key1)) {
if (hash1 == hashCode && key.equals(key1)) { final V old = value1;
final V old = value1; hash1 = hash2;
hash1 = hash2; key1 = key2;
key1 = key2; value1 = value2;
value1 = value2; hash2 = 0;
hash2 = 0; key2 = null;
key2 = null; value2 = null;
value2 = null; size = 1;
size = 1; return old;
return old; }
} return null;
return null; case 1:
case 1: if (hash1 == hashCode && key.equals(key1)) {
if (hash1 == hashCode && key.equals(key1)) { final V old = value1;
final V old = value1; hash1 = 0;
hash1 = 0; key1 = null;
key1 = null; value1 = null;
value1 = null; size = 0;
size = 0; return old;
return old;
}
} }
} }
} }