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

  • Home
  • SEARCH
  • 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 76333
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 10, 20262026-05-10T20:39:25+00:00 2026-05-10T20:39:25+00:00

I have some function to find a value: struct FindPredicate { FindPredicate(const SomeType& t)

  • 0

I have some function to find a value:

struct FindPredicate {      FindPredicate(const SomeType& t) : _t(t) {     }     bool operator()(SomeType& t) {       return t == _t;     }  private:     const SomeType& _t; };  bool ContainsValue(std::vector<SomeType>& v, SomeType& valueToFind) {     return find_if(v.begin(), v.end(), FindPredicate(valueToFind)) != v.end(); } 

Now I would like to write a function that checks if all members of a vector satisfy that predicate:

bool AllSatisfy(std::vector<SomeType>& v) {     /* ... */ } 

One solution is to use the std::count_if algorithm.

Does anyone know a solution that involves negating the predicate?

  • 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. 2026-05-10T20:39:26+00:00Added an answer on May 10, 2026 at 8:39 pm

    The best solution is to use the STL functional library. By deriving your predicate from unary_function<SomeType, bool> , you’ll then be able to use the not1 function, which does precisely what you need (i.e. negating a unary predicate).

    Here is how you could do that :

    struct FindPredicate : public unary_function<SomeType, bool> {     FindPredicate(const SomeType& t) : _t(t) {}      bool operator()(const SomeType& t) const {       return t == _t;     }  private:     const SomeType& _t; };  bool AllSatisfy(std::vector<SomeType>& v, SomeType& valueToFind) {     return find_if(v.begin(),                     v.end(),                     not1(FindPredicate(valueToFind))) == v.end(); } 

    If you want to roll your own solution (which is, IMHO, not the best option…), well, you could write another predicate that is the negation of the first one :

    struct NotFindPredicate {      NotFindPredicate(const SomeType& t) : _t(t) {     }     bool operator()(SomeType& t) {       return t != _t;     }  private:     const SomeType& _t; };  bool AllSatisfy(std::vector<SomeType>& v) {     return find_if(v.begin(),                     v.end(),                     NotFindPredicate(valueToFind)) == v.end(); } 

    Or you could do better and write a template functor negator, like :

    template <class Functor> struct Not {     Not(Functor & f) : func(f) {}      template <typename ArgType>     bool operator()(ArgType & arg) { return ! func(arg); }    private:     Functor & func; }; 

    that you could use as follow :

    bool AllSatisfy(std::vector<SomeType>& v, SomeType& valueToFind) {     FindPredicate f(valueToFind);     return find_if(v.begin(), v.end(), Not<FindPredicate>(f)) == v.end(); } 

    Of course, the latter solution is better because you can reuse the Not struct with every functor you want.

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

Sidebar

Ask A Question

Stats

  • Questions 102k
  • Answers 102k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer Your keys may already be in PEM format, but just… May 11, 2026 at 8:19 pm
  • Editorial Team
    Editorial Team added an answer There is Binary patch and diff, which is free, Windows… May 11, 2026 at 8:19 pm
  • Editorial Team
    Editorial Team added an answer You need to declare the XML namespaces ("soap" in this… May 11, 2026 at 8:19 pm

Related Questions

I am very new to C and I have some problems learning about pointers.
I am facing the problem of having several integers, and I have to generate
Given [1,2,3,4,5] , how can I do something like 1/1, 1/2, 1/3,1/4,1/5, ...., 3/1,3/2,3/3,3/4,3/5,....
I'm looking for the fastest way to determine if a long value is a

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

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.