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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T11:05:23+00:00 2026-05-24T11:05:23+00:00

I have a vector of vectors, say std::vector< std::vector<int> > my2dArray; Now I would

  • 0

I have a vector of vectors, say

std::vector< std::vector<int> > my2dArray;

Now I would like to have a vector that contains the sizes of the vectors inside my2dArray. Manually this would look something like

std::vector<int> mySizes;
for (int i = 0; i < my2dArray.size(); i++ )
{
  mySizes.push_back( my2dArray[i].size() );
}

Is there a more “elegant” way of doing this – without manually writing a loop – by making use of some STL algorithm or the like?

  • 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-24T11:05:23+00:00Added an answer on May 24, 2026 at 11:05 am

    C++03:

    typedef std::vector<int> IntVec;
    std::vector<size_t> sizes(my2dArray.size());
    std::transform(my2dArray.begin(), my2dArray.end(), sizes.begin(), 
                   std::mem_fun_ref(&IntVec::size));
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Say I have the following: std::vector<int> myints; and then I have a function that
I have two containers, let's say they're defined like this: std::vector<std::unique_ptr<int>> a; std::vector<std::unique_ptr<int>> b;
Let's say I have a function: typedef std::vector<int> VecType; VecType randomVector(); int processing() {
Say I have something like: #include <vector> #include <algorithm> #include <tr1/functional> void bar(int value)
What is the behavior of std::advance when you have say: std::vector<int> foo(10,10); auto i
Suppose i have a std::vector<int> v //and ... for(int i =0;i<100;++i) v.push_back(i); now i
Lets say I have these lines of code; std::vector<int> ints; std::for_each(ints.begin(), ints.end(), [](int& val){
Lets say we have the following code: std::vector<int> f() { std::vector<int> y; ... return
Say, I have a std::vector<SomeClass *> v; in my code and I need to
Let's say I have a container (std::vector) of pointers used by a multi-threaded application.

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.