dominant_cell()

template<typename LatticeT , typename CellT >

std::pair< CellT, size_t > MayaFlux::Kinesis::SymbolicTrajectory< LatticeT, CellT >::dominant_cell ( size_t  window ) const

inline

Cell with the most observations within the most recent window observations.

Parameters

window

Number of recent observations to examine, clamped to the trajectory's retained history capacity

Returns

The most-occupied cell in the window, and how many of the window's observations fell in it

Ties resolve to whichever qualifying cell appears first in the scan, which is the most recent one among ties since the underlying HistoryBuffer is newest-first; not documented as a guarantee beyond "deterministic," since which specific tie-break rule matters is a caller decision this does not presume to make.

Definition at line 180 of file SymbolicTrajectory.hpp.

    {
        window = std::min(window, m_history.capacity());
        const auto view = m_history.linearized_view();
 
        CellT best {};
        size_t best_count = 0;
        for (size_t i = 0; i < window; ++i) {
            size_t count = 0;
            for (size_t j = 0; j < window; ++j) {
                if (view[j] == view[i])
                    ++count;
            }
            if (count > best_count) {
                best_count = count;
                best = view[i];
            }
        }
        return { best, best_count };
    }

References MayaFlux::Memory::HistoryBuffer< T >::capacity(), count, MayaFlux::Memory::HistoryBuffer< T >::linearized_view(), and MayaFlux::Kinesis::SymbolicTrajectory< LatticeT, CellT >::m_history.

Here is the call graph for this function: