public int getAccessCountCeiling ( int count , int margin ) { return ArrayCounter . rank ( accessTable , hashIndex . newNodePointer , count , accessMin + 1 , accessCount , margin ) ; }
Return the max accessCount value for count elements with the lowest access count . Always return at least accessMin + 1