mirror of
https://github.com/vanitasvitae/Smack.git
synced 2025-09-09 09:09:38 +02:00
Introduce EqualsUtil and HashCode.(Builder|Cache)
This commit is contained in:
Florian Schmaus
parent
92b02afbff
commit
fa0c16d75c
8 changed files with 551 additions and 167 deletions
|
|
@ -24,6 +24,8 @@ import java.util.List;
|
|||
import java.util.Locale;
|
||||
import java.util.Set;
|
||||
|
||||
import org.jivesoftware.smack.util.EqualsUtil;
|
||||
import org.jivesoftware.smack.util.HashCode;
|
||||
import org.jivesoftware.smack.util.Objects;
|
||||
import org.jivesoftware.smack.util.TypedCloneable;
|
||||
import org.jivesoftware.smack.util.XmlStringBuilder;
|
||||
|
|
@ -561,32 +563,22 @@ public final class Message extends Stanza implements TypedCloneable<Message> {
|
|||
return subject;
|
||||
}
|
||||
|
||||
private final HashCode.Cache hashCodeCache = new HashCode.Cache();
|
||||
|
||||
@Override
|
||||
public int hashCode() {
|
||||
final int prime = 31;
|
||||
int result = 1;
|
||||
if (language != null) {
|
||||
result = prime * result + this.language.hashCode();
|
||||
}
|
||||
result = prime * result + this.subject.hashCode();
|
||||
return result;
|
||||
return hashCodeCache.getHashCode(c ->
|
||||
c.append(language)
|
||||
.append(subject)
|
||||
);
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean equals(Object obj) {
|
||||
if (this == obj) {
|
||||
return true;
|
||||
}
|
||||
if (obj == null) {
|
||||
return false;
|
||||
}
|
||||
if (getClass() != obj.getClass()) {
|
||||
return false;
|
||||
}
|
||||
Subject other = (Subject) obj;
|
||||
// simplified comparison because language and subject are always set
|
||||
return this.language.equals(other.language) && this.subject.equals(other.subject);
|
||||
return EqualsUtil.equals(this, obj, (e, o) ->
|
||||
e.append(language, o.language)
|
||||
.append(subject, o.subject)
|
||||
);
|
||||
}
|
||||
|
||||
@Override
|
||||
|
|
@ -670,31 +662,22 @@ public final class Message extends Stanza implements TypedCloneable<Message> {
|
|||
return message;
|
||||
}
|
||||
|
||||
private final HashCode.Cache hashCodeCache = new HashCode.Cache();
|
||||
|
||||
@Override
|
||||
public int hashCode() {
|
||||
final int prime = 31;
|
||||
int result = 1;
|
||||
if (language != null) {
|
||||
result = prime * result + this.language.hashCode();
|
||||
}
|
||||
result = prime * result + this.message.hashCode();
|
||||
return result;
|
||||
return hashCodeCache.getHashCode(c ->
|
||||
c.append(language)
|
||||
.append(message)
|
||||
);
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean equals(Object obj) {
|
||||
if (this == obj) {
|
||||
return true;
|
||||
}
|
||||
if (obj == null) {
|
||||
return false;
|
||||
}
|
||||
if (getClass() != obj.getClass()) {
|
||||
return false;
|
||||
}
|
||||
Body other = (Body) obj;
|
||||
// simplified comparison because language and message are always set
|
||||
return Objects.equals(this.language, other.language) && this.message.equals(other.message);
|
||||
return EqualsUtil.equals(this, obj, (e, o) ->
|
||||
e.append(language, o.language)
|
||||
.append(message, o.message)
|
||||
);
|
||||
}
|
||||
|
||||
@Override
|
||||
|
|
|
|||
|
|
@ -0,0 +1,243 @@
|
|||
/**
|
||||
*
|
||||
* Copyright 2019 Florian Schmaus.
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
package org.jivesoftware.smack.util;
|
||||
|
||||
public final class EqualsUtil {
|
||||
|
||||
private EqualsUtil() {
|
||||
}
|
||||
|
||||
public static <T> boolean equals(T thisObject, Object other, EqualsComperator<T> equalsComperator) {
|
||||
if (other == null) {
|
||||
return false;
|
||||
}
|
||||
if (thisObject == other) {
|
||||
return true;
|
||||
}
|
||||
@SuppressWarnings("unchecked")
|
||||
Class<T> thisObjectClass = (Class<T>) thisObject.getClass();
|
||||
if (thisObjectClass != other.getClass()) {
|
||||
return false;
|
||||
}
|
||||
|
||||
EqualsUtil.Builder equalsBuilder = new EqualsUtil.Builder();
|
||||
|
||||
equalsComperator.compare(equalsBuilder, thisObjectClass.cast(other));
|
||||
|
||||
return equalsBuilder.isEquals;
|
||||
}
|
||||
|
||||
@FunctionalInterface
|
||||
public interface EqualsComperator<T> {
|
||||
void compare(EqualsUtil.Builder equalsBuilder, T other);
|
||||
}
|
||||
|
||||
public static final class Builder {
|
||||
private boolean isEquals = true;
|
||||
|
||||
private Builder() {
|
||||
}
|
||||
|
||||
private void nullSafeCompare(Object left, Object right, Runnable runnable) {
|
||||
if (!isEquals) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (left == right) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (left == null || right == null) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
|
||||
runnable.run();
|
||||
}
|
||||
|
||||
public <O> Builder append(O left, O right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
if (left == right) {
|
||||
return this;
|
||||
}
|
||||
|
||||
if (left == null || right == null) {
|
||||
isEquals = false;
|
||||
return this;
|
||||
}
|
||||
|
||||
isEquals = left.equals(right);
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(boolean left, boolean right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
isEquals = left == right;
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(boolean[] left, boolean[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(byte left, byte right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
isEquals = left == right;
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(byte[] left, byte[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(char left, char right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
isEquals = left == right;
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(char[] left, char[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(double left, double right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
return append(Double.doubleToLongBits(left), Double.doubleToLongBits(right));
|
||||
}
|
||||
|
||||
public Builder append(double[] left, double[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(float left, float right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
return append(Float.floatToIntBits(left), Float.floatToIntBits(right));
|
||||
}
|
||||
|
||||
public Builder append(float[] left, float[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(int left, int right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
isEquals = left == right;
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(int[] left, int[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(long left, long right) {
|
||||
if (!isEquals) {
|
||||
return this;
|
||||
}
|
||||
|
||||
isEquals = left == right;
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(long[] left, long[] right) {
|
||||
nullSafeCompare(left, right, () -> {
|
||||
if (left.length != right.length) {
|
||||
isEquals = false;
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < left.length && isEquals; i++) {
|
||||
append(left[i], right[i]);
|
||||
}
|
||||
});
|
||||
return this;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
|
@ -0,0 +1,211 @@
|
|||
/**
|
||||
*
|
||||
* Copyright 2019 Florian Schmaus.
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
package org.jivesoftware.smack.util;
|
||||
|
||||
public class HashCode {
|
||||
|
||||
private static final int MULTIPLIER_VALUE = 37;
|
||||
|
||||
public static class Cache {
|
||||
private boolean calculated;
|
||||
private int hashcode;
|
||||
|
||||
public int getHashCode(Calculator hashCodeCalculator) {
|
||||
if (calculated) {
|
||||
return hashcode;
|
||||
}
|
||||
|
||||
HashCode.Builder hashCodeBuilder = new HashCode.Builder();
|
||||
hashCodeCalculator.calculateHash(hashCodeBuilder);
|
||||
|
||||
calculated = true;
|
||||
hashcode = hashCodeBuilder.hashcode;
|
||||
|
||||
return hashcode;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
@FunctionalInterface
|
||||
public interface Calculator {
|
||||
void calculateHash(HashCode.Builder hashCodeBuilder);
|
||||
}
|
||||
|
||||
public static Builder builder() {
|
||||
return new Builder();
|
||||
}
|
||||
|
||||
public static class Builder {
|
||||
private int hashcode = 17;
|
||||
|
||||
private void applyHash() {
|
||||
applyHash(0);
|
||||
}
|
||||
|
||||
private void applyHash(int hash) {
|
||||
hashcode = MULTIPLIER_VALUE * hashcode + hash;
|
||||
}
|
||||
|
||||
public Builder append(Object object) {
|
||||
if (object == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
if (object.getClass().isArray()) {
|
||||
if (object instanceof int[]) {
|
||||
append((int[]) object);
|
||||
} else if (object instanceof long[]) {
|
||||
append((long[]) object);
|
||||
} else if (object instanceof boolean[]) {
|
||||
append((boolean[]) object);
|
||||
} else if (object instanceof double[]) {
|
||||
append((double[]) object);
|
||||
} else if (object instanceof float[]) {
|
||||
append((float[]) object);
|
||||
} else if (object instanceof short[]) {
|
||||
append((short[]) object);
|
||||
} else if (object instanceof char[]) {
|
||||
append((char[]) object);
|
||||
} else if (object instanceof byte[]) {
|
||||
append((byte[]) object);
|
||||
} else {
|
||||
append((Object[]) object);
|
||||
}
|
||||
}
|
||||
applyHash(object.hashCode());
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(boolean value) {
|
||||
applyHash(value ? 0 : 1);
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(boolean[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (boolean bool : array) {
|
||||
append(bool);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(byte value) {
|
||||
applyHash(value);
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(byte[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (byte b : array) {
|
||||
append(b);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(char value) {
|
||||
applyHash(value);
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(char[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (char c : array) {
|
||||
append(c);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(double value) {
|
||||
return append(Double.doubleToLongBits(value));
|
||||
}
|
||||
|
||||
public Builder append(double[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (double d : array) {
|
||||
append(d);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(float value) {
|
||||
return append(Float.floatToIntBits(value));
|
||||
}
|
||||
|
||||
public Builder append(float[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (float f : array) {
|
||||
append(f);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(long value) {
|
||||
applyHash((int) (value ^ (value >>> 32)));
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(long[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (long l : array) {
|
||||
append(l);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public Builder append(Object[] array) {
|
||||
if (array == null) {
|
||||
applyHash();
|
||||
return this;
|
||||
}
|
||||
|
||||
for (Object element : array) {
|
||||
append(element);
|
||||
}
|
||||
return this;
|
||||
}
|
||||
|
||||
public int build() {
|
||||
return hashcode;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue