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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 8, 20262026-06-08T01:31:09+00:00 2026-06-08T01:31:09+00:00

how can I efficiently modify the elements of these two lists using stl algorithms:

  • 0

how can I efficiently modify the elements of these two lists using stl algorithms:

std::list<std::pair<double, string> > listPair(10);
std::list<double> listA(10);

And in such a way that the first pair-element gets the corresponding double value from listA?

  • 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-08T01:31:11+00:00Added an answer on June 8, 2026 at 1:31 am

    Here I assume listPair is already filled, because there’s no way to get that string otherwise.


    You could loop through the collections directly.

    auto a_cur = listA.begin(), a_end = listA.end();
    auto pair_cur = listPair.begin();
    for (; a_cur != a_end; ++ a_cur, ++ pair_cur) {
        pair_cur->first = *a_cur;
    }
    

    or use the “binary” version of std::transform, but this will involve copying the string:

    std::transform(listA.begin(), listA.end(), listPair.begin(), listPair.begin(),
                   [](double a, std::pair<double, string> b) {
                       return std::make_pair(a, b.second);
                   });
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

How can I efficiently and easily sort a list of tuples without being sensitive
Ok, so I'm not super familiar with using For /F. I can modify it
I would like some container that I can very efficiently append a variable amount
Can mysql handle a dataset of 50gb (only text) efficiently ? If not, what
Is there anything wrong with this code or can this be done more efficiently?
There is a requirement to load a list of items(ArrayList) from two different tables.
Why is returning a std::pair or boost::tuple so much less efficient than returning by
How do i update multiple rows efficiently? One statement Multiple statements Can a single
I'm using GIT to manage a Content Management System (CMS) project. The CMS can
Using the Lua C-API is there an efficient way to concatenate two LuaL_Buffer s?

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.