Method random_visit

src/semiorderedset.h:191–212

    // This will "randomly" visit nodes biased towards lower values first
    template<typename T_VISITOR>
    size_t random_visit(T_VISITOR &fn)
    {
        bool fSawAny = true;
        size_t visited = 0;
        size_t basePrimary = rand() % m_data.size();
        for (size_t idxSecondary = 0; fSawAny; ++idxSecondary)
        {
            fSawAny = false;
            for (size_t idxPrimaryCount = 0; idxPrimaryCount < m_data.size(); ++idxPrimaryCount)
            {
                size_t idxPrimary = (basePrimary + idxPrimaryCount) % m_data.size();
                if (m_data[idxPrimary] != nullptr && idxSecondary < m_data[idxPrimary]->size())
                {
                    ++visited;
                    fSawAny = true;
                    if (!fn(m_data[idxPrimary]->operator[](idxSecondary)))
                        return visited;
                }
            }
        }
        return visited;
    }

    const T& random_value() const
    {