visit() [1/2]

template<typename... Types>

template<typename Visitor>

void fl::Variant< Types >::visit ( Visitor & visitor )

inline

Definition at line 154 of file variant.h.

                                                             {
        if (_tag == Empty)
            return;
 
        // Fn is "a pointer to function taking (void* storage, Visitor&)"
        using Fn = void (*)(void *, Visitor &);
 
        // Build a constexpr array of one thunk per type in Types...
        // Each thunk casts the storage back to the right T* and calls
        // visitor.accept
        static constexpr Fn table[] = {
            &Variant::template visit_fn<Types, Visitor>...};
 
        // _tag is 1-based, so dispatch in O(1) via one indirect call:
        // Check bounds to prevent out-of-bounds access
        size_t index = _tag - 1;
        if (index < sizeof...(Types)) {
            table[index](&_storage, visitor);
        }
    }

Referenced by fl::Gradient::Gradient().

Here is the caller graph for this function: