protected boolean containsElem ( int index , final T key , int hashCode ) { for ( LinkedElement < T > e = entries [ index ] ; e != null ; e = e . next ) { // element found if ( hashCode == e . hashCode && e . element . equals ( key ) ) { return true ; } } // element not found return false ; }
Check if the set contains given element at given index .