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 154189
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T09:56:05+00:00 2026-05-11T09:56:05+00:00

How do i pass a pointer to a member function to std::list.sort()? Is this

  • 0

How do i pass a pointer to a member function to std::list.sort()?

Is this possible? Thanks

struct Node {        uint32_t ID;        char *   Value; };  class myClass {           private:             uint32_t  myValueLength;           public:             list<queueNode *> MyQueue;             bool compare(Node * first, Node * second);             bool doStuff(); }  bool myClass::compare(Node * first, Node * second) {     unsigned int ii =0;     while (ii < myValueLength)     {         if (first-> Value[ii] < second-> Value[ii])          {             return true;         } else if (first-> Value[ii] > second-> Value[ii])         {             return false;         }          ++ii;     }      return false; }  bool myClass::doStuff() {     list.sort(compare); } 

I want to use a length variable from within the class instead of doing strlen() within the compare function (The Value will always be the same length)

Edit: The myValueLength was not the only variable i wanted to access from within the comparison function I just simplified it to make the example shorter.

  • 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-11T09:56:06+00:00Added an answer on May 11, 2026 at 9:56 am

    Elaborating on grieve’s response, why not use a functor? E.g.:

    struct Functor {   bool operator()( char * a, char * b )     { return strcmp(a,b) < 0; } }; 

    Then you could just use:

    Functor f; myList.sort(f); 

    You could even use your class as the Functor by defining operator()…

    class myClass {   ...   bool operator()( queueNode * a, queueNode * b )   { return compare( a, b ); }    void doStuff() { MyQueue.sort(*this); } }; 

    Simple example code:

    #include <iostream> #include <list> using namespace std;    // Assumes  TYPE t; cout << t;  is valid. template<class TYPE> inline ostream & operator<< ( ostream & theOstream,                               const list<TYPE> & theList ) {   typename list<TYPE>::const_iterator listIterator = theList.begin();   for ( int i = 0;   listIterator != theList.end();  listIterator ++, i ++ )     theOstream << '    [' << i << ']:   \'' << (*listIterator) << '\'' << endl;   return theOstream; }  struct Functor {   bool operator()( const char * a, const char * b )     { return strcmp(a,b) < 0; } };  int main() {   list<char*>  l;      /* Load up some example test data... */   char  s[3];   s[2] = '\0';   for (   s[0]='c'; s[0]>='a'; s[0]-- )     for ( s[1]='c'; s[1]>='a'; s[1]--  )       l.push_back(strdup(s));      /* Show us that test data... */   cout << l << endl;      /* Sort list. */   Functor f;   l.sort(f);      /* Show us what we have now... */   cout << l << endl; } 
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 71k
  • Answers 71k
  • 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
  • added an answer SELECT COALESCE(c.price, r.price) AS price FROM regPrice r LEFT OUTER… May 11, 2026 at 1:19 pm
  • added an answer Have you looked into this PEAR package? http://pear.php.net/package/MIME_Type May 11, 2026 at 1:19 pm
  • added an answer What about ImageMagick? May 11, 2026 at 1:19 pm

Related Questions

No related questions found

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.