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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T03:34:51+00:00 2026-06-14T03:34:51+00:00

I am working with vectors and I am initialising them like so: vector<int> values;

  • 0

I am working with vectors and I am initialising them like so:

vector<int> values;

values.push_back(1);
values.push_back(2);
values.push_back(8);
values.push_back(12);
values.push_back(32);
values.push_back(43);
values.push_back(23);
values.push_back(234);
values.push_back(7);
values.push_back(1);

Is there a way, to push_back these elements in a way that is array-like? Like this:

    int numbers[2] = {1, 2};

The vector method takes up too many lines, IMO!

  • 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-14T03:34:52+00:00Added an answer on June 14, 2026 at 3:34 am

    In C++11 you can use brace initialization with any container.

    std::vector <int> v = {1, 2, 8, 12, 32 ...};
    

    In C++03 you can do this

    const int arr[] = {1, 2, 8, 12, 32 ... };
    const int size = sizeof arr / sizeof arr[0];
    std::vector<int> v(arr, arr + size);
    

    or use boost assign.

    #include <boost/assign.hpp>
    using namespace boost::assign;
    ///...
    {
        std::vector<int> v;
        v += 1, 2, 8, 12, 32;
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm working with a vector and need to check if there exists an element
I am working on an application that builds a vector of structs for items
Working with box2d and cocos2d, I've calculated two vectors: one is the vector pointing
I am currently working on a game engine that needs to move values between
I'm trying to get a working googletest test that compares two vectors. For this
I'm working with xyz vectors a lot in my program. I'm using them enough
I've been working on a school assignment that makes pretty heavy use of vectors,
I'm working with vectors and at some point there will be NULL entries; I
I am working with some code that uses the %*% operator to apply vectors
I am working on a C++ application. I have 2 vectors of points vector<Point2f>

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.