Inheritance diagram for javolution.util.internal.comparator.IdentityComparatorImpl< E >:

Collaboration diagram for javolution.util.internal.comparator.IdentityComparatorImpl< E >:

Public Member Functions
int	hashCodeOf (E obj)

boolean	areEqual (E e1, E e2)

int	compare (E left, E right)

int	hashCodeOf (T object)

boolean	areEqual (T left, T right)

int	compare (T left, T right)

Static Private Attributes
static final long	serialVersionUID = 6576306094743751922L

Detailed Description

The identity comparator implementation.

Definition at line 18 of file IdentityComparatorImpl.java.

Member Function Documentation

◆ areEqual() [1/2]

boolean javolution.util.internal.comparator.IdentityComparatorImpl< E >.areEqual	(	E	e1,
		E	e2
	)

Definition at line 29 of file IdentityComparatorImpl.java.

                                         {
         return e1 == e2;
     }

◆ areEqual() [2/2]

boolean javolution.util.function.Equality< T >.areEqual	(	T	left,
		T	right
	)

inherited

Indicates if the specified objects can be considered equal. This methods is equivalent to

(compare(o1, o2) == 0)

but usually faster.

Parameters

left	the first object (or `null`).
right	the second object (or `null`).

Returns: true if both objects are considered equal; false otherwise.

Here is the caller graph for this function:

◆ compare() [1/2]

int javolution.util.internal.comparator.IdentityComparatorImpl< E >.compare	(	E	left,
		E	right
	)

Definition at line 34 of file IdentityComparatorImpl.java.

                                         {
         if (left == right)
             return 0;
         if (left == null)
             return -1;
         if (right == null)
             return 1;
  
         // Empirical comparison.
         return (hashCodeOf(left) < hashCodeOf(right)) ? -1 : 1;
     }

References javolution.util.internal.comparator.IdentityComparatorImpl< E >.hashCodeOf().

Here is the call graph for this function:

◆ compare() [2/2]

int javolution.util.function.Equality< T >.compare	(	T	left,
		T	right
	)

inherited

Compares the specified objects for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, possibly equal to, or greater than the second. Implementation classes should ensure that comparisons with

null

is supported.

Parameters

left	the first object.
right	the second object.

Returns: a negative integer, zero, or a positive integer as the first argument is less than, possibly equal to, or greater than the second.

Referenced by javolution.util.internal.set.sorted.SubSortedSetImpl< E >.add(), javolution.util.internal.map.MapView< K, V >.EntryComparator.compare(), javolution.text.CharArray.compareTo(), javolution.text.Text.compareTo(), javolution.util.internal.set.sorted.SubSortedSetImpl< E >.contains(), javolution.util.internal.map.sorted.SubSortedMapImpl< K, V >.containsKey(), javolution.util.internal.map.sorted.SubSortedMapImpl< K, V >.get(), javolution.util.internal.set.sorted.SubSortedSetImpl< E >.IteratorImpl.hasNext(), javolution.util.internal.map.sorted.SubSortedMapImpl< K, V >.IteratorImpl.hasNext(), javolution.util.internal.map.sorted.SubSortedMapImpl< K, V >.put(), javolution.util.internal.set.sorted.SubSortedSetImpl< E >.remove(), and javolution.util.internal.map.sorted.SubSortedMapImpl< K, V >.remove().

Here is the caller graph for this function:

◆ hashCodeOf() [1/2]

int javolution.util.internal.comparator.IdentityComparatorImpl< E >.hashCodeOf ( E obj )

Definition at line 24 of file IdentityComparatorImpl.java.

                                  {
         return System.identityHashCode(obj);
     }

Referenced by javolution.util.internal.comparator.IdentityComparatorImpl< E >.compare().

Here is the caller graph for this function:

◆ hashCodeOf() [2/2]

int javolution.util.function.Equality< T >.hashCodeOf ( T object )

inherited

Returns the hash code for the specified object (consistent with areEqual). Two objects considered equal have the same hash code. The hash code of null is always 0.

Parameters

object the object to return the hashcode for.