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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T09:35:18+00:00 2026-05-18T09:35:18+00:00

The simplest code is the best asker: #include <vector> #include <algorithm> using namespace std;

  • 0

The simplest code is the best asker:

#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> coll;
    for_each(coll.begin(), coll.end(), [](vector<int>::value_type n) -> void {});

    return 0;
}

Here, vector<int>::value_type n is tedious. I want to have an auto-like utility to deduce the right type of n automatically; just like the following:

for_each(coll.begin(), coll.end(), [](auto_type n) -> void {});

To be more greedy, I want auto_type to take an argument used to deduce the right type of n. The argument can be a (smart) pointer or reference to the container, or an iterator of the container.

Dear gurus, how to implement that?

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

    You don’t have to declare the void return in that function. You could use decltype, like, decltype(coll[0]).

    std::for_each(coll.begin(), coll.end(), [](decltype(coll[0]) value) {
        std::cout << value;
    });
    

    Edit:

    template<typename T> auto type(T&& t) -> decltype(*std::forward<T>(t).begin()) {
        return *t.begin();
    }
    std::for_each(coll.begin(), coll.end(), [](decltype(type(coll)) value) {
    });
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

What is the simplest way (least error-prone, least lines of code, however you want
What is the simplest, fastest way to complete the PHP code below such that
What's the best / simplest / most accurate way to detect the browser of
What is the best (and simplest!) way to record video from a webcam to
Trying to determine best way to code this requirement : Need to insert rows
Possible Duplicate: Best algorithm to count the number of set bits in a 32-bit
What is the simplest SQL query to find the second largest integer value in
What's the simplest-to-use techonlogy available to save an arbitrary Java object graph as an
What is the simplest and most elegant way to simulate the hover pseudo-class for
What's the simplest way to connect and query a database for a set of

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.