- 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::correlomatrix_detector::State_::State_ |
( |
| ) |
|
void nest::correlomatrix_detector::State_::get |
( |
DictionaryDatum & |
d | ) |
const |
void nest::correlomatrix_detector::State_::reset |
( |
const Parameters_ & |
p | ) |
|
- Parameters
-
bool | if true, force state reset |
std::vector<std::vector<std::vector<long_t> > > nest::correlomatrix_detector::State_::count_covariance_ |
Unweighted covariance matrix.
std::vector<std::vector<std::vector<double_t> > > nest::correlomatrix_detector::State_::covariance_ |
Weighted covariance matrix.
- Note
- Data type is double to accomodate weights.
std::vector<long_t> nest::correlomatrix_detector::State_::n_events_ |
The documentation for this struct was generated from the following files: