Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8886969
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T21:41:26+00:00 2026-06-14T21:41:26+00:00

I am having hard time using variadic template with the following problem. Suppose that

  • 0

I am having hard time using variadic template with the following problem.

Suppose that all the predicate functors are of the form,

class Pred1 {
public:
    Pred1( Args... ); // The signature Args... can vary class to class.

    template <typename T>
    bool operator()(T t);
};

Given those functors, I want to make a variadic template class which returns true if all the operator() of each predicate return true, i.e.,

template <typename... Preds>
class CombinePredAnd {
public:
    template <typename T>
    bool operator()(T t){
         // returns true if all of the Preds( Args... ).operator()(t) returns true;  
         // Args... should be passed when CombinePredAnd is constructed.
    }
};

To me, I have no idea to pass arguments to each constructor of Preds.
Could you give me some hint?
Also, if you have better design with the same functionality, please let me know.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-14T21:41:27+00:00Added an answer on June 14, 2026 at 9:41 pm

    Maybe like this:

    #include <tuple>
    #include <type_traits>
    
    template <std::size_t N, std::size_t I, typename Tuple>
    struct evaluate_all
    {
        template <typename T>
        static bool eval(T const & t, Tuple const & preds)
        {
            return std::get<I>(preds)(t)
                && evaluate_all<N, I + 1, Tuple>::eval(t, preds);
        }
    };
    
    template <std::size_t N, typename Tuple>
    struct evaluate_all<N, N, Tuple>
    {
        template <typename T>
        static bool eval(T const &, Tuple const &)
        {
            return true;
        }
    };
    
    template <typename ...Preds>
    struct conjunction
    {
    private:
        typedef std::tuple<Preds...> tuple_type;
        tuple_type preds;
    
    public:
        conjunction(Preds const &... p) : preds(p...) { }
    
        template <typename T>
        bool operator()(T const & t) const
        {
            return evaluate_all<sizeof...(Preds), 0, tuple_type>::eval(t, preds);
        }
    };
    
    template <typename ...Preds>
    conjunction<typename std::decay<Preds>::type...> make_conjunction(Preds &&... preds)
    {
        return conjunction<typename std::decay<Preds>::type...>(std::forward<Preds>(preds)...);
    }
    

    Usage:

    auto c = make_conjunction(MyPred(), YourPred(arg1, arg2, arg3));
    
    if (c(10)) { /* ... */ }
    

    Example:

    #include <iostream>
    
    typedef int T;
    
    struct Pred1
    {
        int a;
        Pred1(int n) : a(n) { }
        bool operator()(int n) const { return n >= a; }
    };
    struct Pred2
    {
        int a;
        Pred2(int n) : a(n) { }
        bool operator()(int n) const { return n <= a; }
    };
    
    int main()
    {
        auto c = make_conjunction(Pred1(1), Pred2(3));
    
        std::cout << "1: " << c(1) << "\n"
                  << "5: " << c(4) << "\n";
    }
    

    Note: You could make the “conjunction” part of this approach parametric as well, so you can have conjunctions and disjunctions just by plugging in std::logical_and or std::logical_or.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm using the Utility Application template to build my app. Having a hard time
I'm having a hard time using std::string::iterators in C++. This code compiles fine (still
I am having a hard time using the $op variable when working with forms.
I'm having a hard time enabling git colored output on windows when using console2.
I'm having a hard time rendering a view in Haml,using MongoMapper for a small
Using the Qt DBus library, I'm having a hard time registering an object implementing
I am (stuck) using Prototype 1.3.1 and I'm having a hard time moving from
I'm having a hard time using sscanf to scan hour and minutes from a
I'm having a hard time using sscanf to scan hour and minutes from a
I'm having a hard time using sscanf to scan hour and minutes from a

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.