Coalesces adjacent topology graphs sharing a concatenable topology into one run.
Strip and fan graphs are always reported separately.
246{
247 std::vector<DrawRun> runs;
248 uint32_t offset = 0;
249
251 const auto count =
static_cast<uint32_t
>(tp->get_vertex_count());
252 const auto topo = tp->get_primitive_topology();
253
255 runs.back().vertex_count +=
count;
256 } else {
257 runs.push_back(
DrawRun { .topology = topo, .vertex_offset = offset, .vertex_count =
count });
258 }
259
261 }
262
263 return runs;
264}
std::vector< std::shared_ptr< GpuSync::TopologyGeneratorNode > > m_topologies
std::vector< double > count(std::span< const double > data, size_t n_windows, uint32_t hop_size, uint32_t window_size)
Sample count per window (as double for pipeline uniformity).
constexpr bool is_concatenable_topology(PrimitiveTopology topology) noexcept
Whether two adjacent spans of this topology can be concatenated without altering the primitives they ...
Portal::Graphics::DrawRun DrawRun