Remove remnants of memory-exploding bincount.

audfprint_match.py

@@ -252,17 +252,12 @@ def _approx_match_counts(self, hits, ids, rawcounts):
         mintime = np.amin(alltimes)
         alltimes -= mintime
         nresults = 0
-        # Hash IDs and times together, so only a single bincount
-        timebits = max(1, encpowerof2(np.amax(alltimes)))
-        #allbincounts = np.bincount((allids << timebits) + alltimes)
-        #log("len(allbincounts)=%d" % len(allbincounts))
         min_time = 0
         max_time = 0
         for urank, (id, rawcount) in enumerate(zip(ids, rawcounts)):
             # Make sure id is an int64 before shifting it up.
             id = int(id)
             # Select the subrange of bincounts corresponding to this id
-            #bincounts = allbincounts[(id << timebits):(((id+1)<<timebits)-1)]
             bincounts = np.bincount(alltimes[allids==id])
             still_looking = True
             # Only consider legit local maxima in bincounts.