@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((destinationField == null) ? 0 : destinationField.hashCode());
return result;
}
@Override
public int hashCode() {
int hashCode = 23;
hashCode = (hashCode * 37) + getClass().hashCode();
hashCode = (hashCode * 37) + (config == null ? 1 : config.hashCode());
return hashCode;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((textureCoordLookup == null) ? 0 : textureCoordLookup.hashCode());
return result;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((command == null) ? 0 : command.hashCode());
result = prime * result + ((data == null) ? 0 : data.hashCode());
return result;
}
/* (non-Javadoc)
* @see java.lang.Object#hashCode()
*/
@Override
public int hashCode() {
int hc =
service.getUrl().hashCode()
^ triples.hashCode()
^ filters.hashCode()
^ scTriples.hashCode()
^ subjectRules.hashCode()
^ predicateRules.hashCode()
^ objectRules.hashCode()
^ concat.hashCode()
^ tripleInHead.hashCode()
^ variablesOrderedByRule.hashCode();
if (service.getGraph() != null) {
hc = hc ^ service.getGraph().hashCode();
}
return hc;
}
@Override
public int hashCode() {
int result = rand != null ? rand.hashCode() : 0;
result = 31 * result + hitpoints;
result = 31 * result + goldpieces;
result = 31 * result + (allAttributes != null ? allAttributes.hashCode() : 0);
result = 31 * rand.nextInt();
return result;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((host == null) ? 0 : host.hashCode());
result = prime * result + ((parameters == null) ? 0 : parameters.hashCode());
result = prime * result + port;
result = prime * result + ((protocol == null) ? 0 : protocol.hashCode());
return result;
}
/**
* This operation returns the hash value of the Polygon.
*
* @return
* <p>The hash of the Object.
*/
@Override
public int hashCode() {
// Hash based on super's hashCode.
int hash = super.hashCode();
// Add local hashes.
hash = 31 * hash + vertices.hashCode();
hash = 31 * hash + edges.hashCode();
hash = 31 * hash + edgeProperties.hashCode();
hash = 31 * hash + polygonProperties.hashCode();
return hash;
}
@Override
public int hashCode() { // see contract for Map.hashCode
if (singleton_key != null)
return singleton_key.hashCode() ^ (singleton_value == null ? 0 : singleton_value.hashCode());
if (array_keys != null) {
int h = 0;
for (int i = 0; i < ARRAY_SIZE; i++) {
if (array_keys[i] != null)
h +=
array_keys[i].hashCode() ^ (array_values[i] == null ? 0 : array_values[i].hashCode());
}
return h;
}
if (hashmap != null) return hashmap.hashCode();
return 0;
}
/**
* Hash Code
*
* @return
*/
@Override
public int hashCode() {
final int primeNum = 2521;
int result = super.hashCode();
result = primeNum * result + priority;
result = primeNum * result + pollingTime;
result = primeNum * result + (int) nextCheckTime;
result = primeNum * result + (active ? 1 : 0);
result = primeNum * result + checkLimit;
result = primeNum * result + currentCheck;
result = primeNum * result + (int) hostAssoc;
result = primeNum * result + metrics.hashCode();
result = primeNum * result + fRule.hashCode();
result = primeNum * result + qos.hashCode();
result = primeNum * result + staticFlow.hashCode();
result = primeNum * result + action.hashCode();
return result;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((concurrentHashMap == null) ? 0 : concurrentHashMap.hashCode());
result = prime * result + ((concurrentMap == null) ? 0 : concurrentMap.hashCode());
result =
prime * result
+ ((concurrentNavigableMap == null) ? 0 : concurrentNavigableMap.hashCode());
result =
prime * result + ((concurrentSkipListMap == null) ? 0 : concurrentSkipListMap.hashCode());
result = prime * result + ((hashMap == null) ? 0 : hashMap.hashCode());
result = prime * result + ((hashtable == null) ? 0 : hashtable.hashCode());
result = prime * result + ((identityHashMap == null) ? 0 : identityHashMap.hashCode());
result = prime * result + ((linkedHashMap == null) ? 0 : linkedHashMap.hashCode());
result = prime * result + ((map == null) ? 0 : map.hashCode());
result = prime * result + ((navigableMap == null) ? 0 : navigableMap.hashCode());
result = prime * result + ((sortedMap == null) ? 0 : sortedMap.hashCode());
result = prime * result + ((treeMap == null) ? 0 : treeMap.hashCode());
result = prime * result + ((weakHashMap == null) ? 0 : weakHashMap.hashCode());
return result;
}
@Override
public int hashCode() {
return m_values.hashCode();
}
/**
* Method to generate a hashcode for this Map.
*
* @return The hashcode.
*/
public synchronized int hashCode() {
return delegate.hashCode();
}
// Javadoc inherited.
public int hashCode() {
return fieldValues.hashCode();
}
@Override
public int hashCode() {
return (myHashMap != null ? myHashMap.hashCode() : 0);
}
@Override
public int hashCode() {
return type.hashCode() * 31 + fields.hashCode();
}