diff options
| author | Stan Seibert <stan@mtrr.org> | 2011-10-13 14:40:14 -0400 |
|---|---|---|
| committer | tlatorre <tlatorre@uchicago.edu> | 2021-05-09 08:42:38 -0700 |
| commit | 8c5ea6510c339c6719d037e9b66f7134a493428f (patch) | |
| tree | 82eb329153f7df8f6e4d50d026008b5814332785 | |
| parent | 58fbce33934a79f803fa752cd13c36cd35962331 (diff) | |
| download | chroma-8c5ea6510c339c6719d037e9b66f7134a493428f.tar.gz chroma-8c5ea6510c339c6719d037e9b66f7134a493428f.tar.bz2 chroma-8c5ea6510c339c6719d037e9b66f7134a493428f.zip | |
Fix returning from PDF accumulator too soon.
| -rw-r--r-- | chroma/cuda/pdf.cu | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/chroma/cuda/pdf.cu b/chroma/cuda/pdf.cu index 0d82e3a..41c4b4a 100644 --- a/chroma/cuda/pdf.cu +++ b/chroma/cuda/pdf.cu @@ -97,7 +97,7 @@ accumulate_pdf_eval(int time_only, int nchannels, unsigned int *event_hit, } // Do we need to keep updating the nearest_mc list? - if (channel_bincount + 1 >= min_bin_content) + if (channel_bincount >= min_bin_content) return; // No need to perform insertion into nearest_mc because bincount is a better estimate of the PDF value // insertion sort the distance into the array of nearest MC points |