@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() {
   final int prime = 31;
   int result = 1;
   result = prime * result + candidatesAndInitialisers.hashCode();
   return result;
 }
 @Override
 public int hashCode() {
   readLock.lock();
   try {
     return delegate.hashCode();
   } finally {
     readLock.unlock();
   }
 }
예제 #4
0
 @Override
 public int hashCode() {
   return map.hashCode();
 }