utility/rec_lambda.cpp

• View this file on GitHub
• Last update: 2021-11-03 19:13:26+09:00

Required by

• graph/binary_optimization.cpp
• graph/dinic.cpp
• graph/strongly_connected_components.cpp
• graph/tree_manager.cpp

Verified with

• test/bipartite_matching.test.cpp
• test/heavy_light_decomposition.test.cpp
• test/rollback_union_find.test.cpp
• test/strongly_connected_components.test.cpp

Code

#pragma once
#include <type_traits>
#include <utility>

template <class F> struct RecursiveLambda : private F {
    explicit constexpr RecursiveLambda(F&& f) : F(std::forward<F>(f)) {}
    template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class F> constexpr decltype(auto) rec_lambda(F&& f) { return RecursiveLambda<F>(std::forward<F>(f)); }

#line 2 "utility/rec_lambda.cpp"
#include <type_traits>
#include <utility>

template <class F> struct RecursiveLambda : private F {
    explicit constexpr RecursiveLambda(F&& f) : F(std::forward<F>(f)) {}
    template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class F> constexpr decltype(auto) rec_lambda(F&& f) { return RecursiveLambda<F>(std::forward<F>(f)); }

Back to top page