}
void RowData::get_annotation_subset(
- vector<const pv::data::decode::Annotation*> &dest,
+ deque<const pv::data::decode::Annotation*> &dest,
uint64_t start_sample, uint64_t end_sample) const
{
// Determine whether we must apply per-class filtering or not
if (all_ann_classes_enabled) {
// No filtering, send everyting out as-is
- dest.reserve(dest.size() + annotations_.size());
for (const auto& annotation : annotations_)
if ((annotation.end_sample() > start_sample) &&
(annotation.start_sample() <= end_sample))
if (c->visible)
class_visible[c->id] = 1;
- dest.reserve(dest.size() + annotations_.size());
for (const auto& annotation : annotations_)
- if ((class_visible[annotation.ann_class()]) &&
+ if ((class_visible[annotation.ann_class_id()]) &&
(annotation.end_sample() > start_sample) &&
(annotation.start_sample() <= end_sample))
dest.push_back(&annotation);
}
}
-void RowData::emplace_annotation(srd_proto_data *pdata)
+const Annotation* RowData::emplace_annotation(srd_proto_data *pdata)
{
+ const Annotation* result = nullptr;
+
// We insert the annotation in a way so that the annotation list
// is sorted by start sample. Otherwise, we'd have to sort when
// painting, which is expensive
if (it != annotations_.begin())
it++;
- annotations_.insert(it, Annotation(pdata, row_));
+ it = annotations_.emplace(it, pdata, row_);
+ result = &(*it);
} else {
annotations_.emplace_back(pdata, row_);
+ result = &(annotations_.back());
prev_ann_start_sample_ = pdata->start_sample;
}
+
+ return result;
}
} // namespace decode