private void scanAllAsearchB ( ) { final long [ ] scanAArr = a_ . getCache ( ) ; final int arrLongsIn = scanAArr . length ; cache_ = new long [ arrLongsIn ] ; for ( int i = 0 ; i < arrLongsIn ; i ++ ) { final long hashIn = scanAArr [ i ] ; if ( ( hashIn <= 0L ) || ( hashIn >= thetaLong_ ) ) { continue ; } final int foundIdx = hashSearch ( bHashTable_ , lgArrLongsHT_ , hashIn ) ; if ( foundIdx > - 1 ) { continue ; } cache_ [ curCount_ ++ ] = hashIn ; } }
Sketch A is either unordered compact or hash table