MayaFlux 1.0.0
Digital-First Multimedia Processing Framework
Loading...
Searching...
No Matches

◆ topology_runs()

std::vector< DrawRun > MayaFlux::Nodes::Network::PathOperator::topology_runs ( ) const
overridevirtual

Coalesces adjacent paths sharing a concatenable topology into one run.

Strip and fan paths are always reported separately.

Reimplemented from MayaFlux::Nodes::Network::GraphicsOperator.

Definition at line 267 of file PathOperator.cpp.

268{
269 std::vector<DrawRun> runs;
270 uint32_t offset = 0;
271
272 for (const auto& path : m_paths) {
273 const auto count = static_cast<uint32_t>(path->get_vertex_count());
274 const auto topo = path->get_primitive_topology();
275
276 if (!runs.empty() && runs.back().topology == topo && is_concatenable_topology(topo)) {
277 runs.back().vertex_count += count;
278 } else {
279 runs.push_back(DrawRun { .topology = topo, .vertex_offset = offset, .vertex_count = count });
280 }
281
282 offset += count;
283 }
284
285 return runs;
286}
std::vector< std::shared_ptr< GpuSync::PathGeneratorNode > > m_paths
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).
Definition Analysis.cpp:506
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

References MayaFlux::Nodes::Network::is_concatenable_topology(), and m_paths.

Here is the call graph for this function: