bool has_children = false;
pair<int, int> extents(INT_MAX, INT_MIN);
- for (const shared_ptr<TraceTreeItem> t : trace_tree_child_items()) {
+ for (const shared_ptr<TraceTreeItem>& t : trace_tree_child_items()) {
assert(t);
if (!t->enabled())
continue;
{
vector<shared_ptr<TraceTreeItem>> items(trace_tree_child_items());
- // Sort by the centre line of the extents
+ // Sort by the center line of the extents
stable_sort(items.begin(), items.end(),
[](const shared_ptr<TraceTreeItem> &a, const shared_ptr<TraceTreeItem> &b) {
const auto aext = a->v_extents();