// we know that the prior set `S` covered the entire history of C and
// was maximal. Subsequent sets will miss events earlier in the
// topological ordering that appear in `S`
- EventSet minimally_reproducible_events = EventSet();
+ EventSet minimally_reproducible_events;
for (const auto& maximal_set : maximal_subsets_iterator_wrapper<Configuration>(*this)) {
if (maximal_set.size() > minimally_reproducible_events.size()) {
for (const auto& event_in_spike : spikes) {
events.push_back(*event_in_spike);
}
- return EventSet(std::move(events));
+ return EventSet(events);
};
const auto alternative =
std::find_if(comb.combinations_begin(), comb.combinations_end(),