IdentityHashingStrategy (Trove 3.0.3)

Skip navigation links

Prev Class
Next Class

All Classes

SEARCH:

Summary:
Nested |
Field |
Constr |
Method

Detail:
Field |
Constr |
Method

java.lang.Object
- gnu.trove.strategy.IdentityHashingStrategy<K>

All Implemented Interfaces:

HashingStrategy<K>, java.io.Serializable
```
public class IdentityHashingStrategy<K>
extends java.lang.Object
implements HashingStrategy<K>
```
A HashingStrategy that does identity comparisons (==) and uses System.identityHashCode(Object) for hashCode generation.

See Also:

Serialized Form

Field Summary

Fields
Modifier and Type Field Description

static IdentityHashingStrategy<java.lang.Object> INSTANCE
A single instance that can be shared with multiple collections.

Constructor Summary

Constructors
Constructor Description

IdentityHashingStrategy()

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`int`	`computeHashCode(K object)`	Computes a hash code for the specified object.
`boolean`	`equals(K o1, K o2)`	Compares o1 and o2 for equality.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - INSTANCE
```
public static final IdentityHashingStrategy<java.lang.Object> INSTANCE
```
    A single instance that can be shared with multiple collections. This instance is thread safe.
- Constructor Detail
  - IdentityHashingStrategy
```
public IdentityHashingStrategy()
```
- Method Detail
  - computeHashCode
```
public int computeHashCode(K object)
```
    Description copied from interface: HashingStrategy
    
    Computes a hash code for the specified object. Implementers can use the object's own hashCode method, the Java runtime's identityHashCode, or a custom scheme.
    
    Specified by:
    
    computeHashCode in interface HashingStrategy<K>
    
    Parameters:
    
    object - for which the hashcode is to be computed
    
    Returns:
    
    the hashCode
  - equals
```
public boolean equals(K o1,
                      K o2)
```
    Description copied from interface: HashingStrategy
    
    Compares o1 and o2 for equality. Strategy implementers may use the objects' own equals() methods, compare object references, or implement some custom scheme.
    
    Specified by:
    
    equals in interface HashingStrategy<K>
    
    Parameters:
    
    o1 - an Object value
    
    o2 - an Object value
    
    Returns:
    
    true if the objects are equal according to this strategy.

Skip navigation links

Prev Class
Next Class

All Classes

Summary:
Nested |
Field |
Constr |
Method

Detail:
Field |
Constr |
Method