- Todo:
- Is there a replacement for std::list that allows fast insertion inside, fast deletion at the beginning, and maintains sorting?
- Note
- Constructed with empty structures, which are set to proper sizes by init_buffers_().
-
State_ only contains read-out values, so we copy-construct using the default c'tor.
nest::correlation_detector::State_::State_ |
( |
| ) |
|
void nest::correlation_detector::State_::reset |
( |
const Parameters_ & |
p | ) |
|
std::vector<long_t> nest::correlation_detector::State_::count_histogram_ |
std::vector<double_t> nest::correlation_detector::State_::histogram_ |
Weighted histogram.
- Note
- Data type is double to accomodate weights.
std::vector<double_t> nest::correlation_detector::State_::histogram_correction_ |
used for Kahan summation algorithm
std::vector<SpikelistType> nest::correlation_detector::State_::incoming_ |
std::vector<long_t> nest::correlation_detector::State_::n_events_ |
The documentation for this struct was generated from the following files: