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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T21:17:28+00:00 2026-05-24T21:17:28+00:00

I am looking for an elegant solution to the following problem. I have a

  • 0

I am looking for an elegant solution to the following problem. I have a task struct that I use for deferred function calls.

template <typename T> struct Task1
{
    T Arg1;
    Delegate<T> TaskDelegate;
};

The problem I’m having is this:

Task1<const Foo&> MyTask;

This will result in the parameter being held as a const reference. Does anyone know a nice solution to get round this? I could enforce rules such as the delegate signature always taking const& params but this seems restrictive. I could always have two task structs (one for ref and one for value) but this seems nasty.

The other solution would be to create the following:

template <typename T1, typename T2> struct Task1
{
    T2 Arg1;
    Delegate<T1> TaskDelegate;
};

Is there anyway to default T2 to be the same type as T1? That way whenever I have a method value signature I don’t need to have the additional template params.

EDIT:
The template is used for a multithreaded task scheduler. Here is an example:

void MyClass::Populate(const std::string& instrText);

CTaskScheduler::Schedule(Task1<const std::string&>(this, &MyClass::Popluate, "MyString"));
  • 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-05-24T21:17:29+00:00Added an answer on May 24, 2026 at 9:17 pm

    You could take a look at the implementation of function<> either in boost or the upcoming standard. As a matter of fact, you can just use function<>. I think that the solution there was (before C++0x) to always store a copy of the arguments, if the user wants reference semantics they can use a reference wrapper.

    As to how to get to a value, you can take a look at some simple metafunction to remove const or &:

    // Remove reference:
    template <typename T>
    struct remove_reference {
       typedef T type;
    };
    template <typename T>
    struct remove_reference<T&> {
       typedef T type;
    };
    

    Similarly for const.

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

Sidebar

Related Questions

I'm looking for an elegant solution to the following problem: I currently have a
I'm looking for an elegant, high performance solution to the following problem. There are
I am looking for an elegant solution for the following problem. Let's assume we
I have been looking for an elegant way to write a function that takes
I am currently looking for an intelligent best practice solution for the following problem.
I have a problem which has an solution that can be solved by iteration,
I'm looking for some attractive Haskell syntax for the following I have a function
I have a function similar to the following that takes an integer as a
I'm looking for an elegant solution to a formula for the following criteria: Location:
I'm looking for an elegant Python program that does a BFS traveral of 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.