Java Code Examples for gnu.trove.TObjectHashingStrategy#computeHashCode()

The following examples show how to use gnu.trove.TObjectHashingStrategy#computeHashCode() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: ConcurrentSoftKeySoftValueHashMap.java    From consulo with Apache License 2.0 4 votes vote down vote up 
SoftKey(@Nonnull K k, @Nonnull ValueReference<K, V> valueReference, @Nonnull TObjectHashingStrategy<? super K> strategy, @Nonnull ReferenceQueue<? super K> queue) {
  super(k, queue);
  myValueReference = valueReference;
  myHash = strategy.computeHashCode(k);
  myStrategy = strategy;
}
Example 2
Source File: ConcurrentSoftHashMap.java    From consulo with Apache License 2.0 4 votes vote down vote up 
@Nonnull
@Override
protected KeyReference<K> createKeyReference(@Nonnull K key, @Nonnull TObjectHashingStrategy<? super K> hashingStrategy) {
  return new SoftKey<>(key, hashingStrategy.computeHashCode(key), hashingStrategy, myReferenceQueue);
}
Example 3
Source File: WeakHashMap.java    From consulo with Apache License 2.0 4 votes vote down vote up 
private WeakKey(@Nonnull T k, @Nonnull TObjectHashingStrategy<? super T> strategy, @Nonnull ReferenceQueue<? super T> q) {
  super(k, q);
  myStrategy = strategy;
  myHash = strategy.computeHashCode(k);
}
Example 4
Source File: ConcurrentWeakHashMap.java    From consulo with Apache License 2.0 4 votes vote down vote up 
@Nonnull
@Override
protected KeyReference<K> createKeyReference(@Nonnull K key, @Nonnull TObjectHashingStrategy<? super K> hashingStrategy) {
  return new WeakKey<>(key, hashingStrategy.computeHashCode(key), hashingStrategy, myReferenceQueue);
}
Example 5
Source File: SoftHashMap.java    From consulo with Apache License 2.0 4 votes vote down vote up 
private SoftKey(@Nonnull T k, @Nonnull TObjectHashingStrategy<? super T> strategy, @Nonnull ReferenceQueue<? super T> q) {
  super(k, q);
  myStrategy = strategy;
  myHash = strategy.computeHashCode(k);
}
Example 6
Source File: ConcurrentWeakKeySoftValueHashMap.java    From consulo with Apache License 2.0 4 votes vote down vote up 
WeakKey(@Nonnull K k, @Nonnull ValueReference<K, V> valueReference, @Nonnull TObjectHashingStrategy<? super K> strategy, @Nonnull ReferenceQueue<? super K> queue) {
  super(k, queue);
  myValueReference = valueReference;
  myHash = strategy.computeHashCode(k);
  myStrategy = strategy;
}