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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T20:09:58+00:00 2026-05-18T20:09:58+00:00

Sample code: int ar[3]; ………… ar[0] = 123; ar[1] = 456; ar[2] = 789;

  • 0

Sample code:

int ar[3];
............
ar[0] = 123;
ar[1] = 456;
ar[2] = 789;

Is there any way to init it shorter? Something like:

int ar[3];
............
ar[] = { 123, 456, 789 };

I don’t need solution like:

int ar[] = { 123, 456, 789 };

Definition and initialization must be separate.

  • 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-18T20:09:58+00:00Added an answer on May 18, 2026 at 8:09 pm

    What you are asking for cannot be done directly. There are, however different things that you can do there, starting from creation of a local array initialized with the aggregate initialization and then memcpy-ed over your array (valid only for POD types), or using higher level libraries like boost::assign.

    // option1
    int array[10];
    //... code
    {
       int tmp[10] = { 1, 2, 3, 4, 5 }
       memcpy( array, tmp, sizeof array ); // ! beware of both array sizes here!!
    }  // end of local scope, tmp should go away and compiler can reclaim stack space
    

    I don’t have time to check how to do this with boost::assign, as I hardly ever work with raw arrays.

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

Sidebar

Related Questions

Sample code: int ar[3]; ............ ar[0] = 123; ar[1] = 456; ar[2] = 789;
Here's the sample code: class TestAO { int[] x; public TestAO () { this.x
Look at my sample code struct A { int member; }; int main() {
Sample code: float** a; a = (float**) malloc(numNodes * sizeof(float*)); for(int i=0; i<`numNodes`; i++)
I found this sample code on the msdn library #include <iostream> int main() {
This very simple code gives me tons of errors: #include <iostream> #include <string> int
So, simple procedure, calculate a factorial number. Code is as follows. int calcFactorial(int num)
Sample code that shows how to create threads using MFC declares the thread function
Searching for some sample code for converting a point in WGS84 coordinate system to
Here is my sample code: from xml.dom.minidom import * def make_xml(): doc = Document()

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.