YOUR C LEARNING COMPANION

Kahan se padhein?

Learning path
Data ka designChapter 34 of 73

Records aur aggregates initialize karna

Braced aur designated initialization ko typed values se jodein; compound literals, lifetimes aur C23 additions samjhein.

6 min readCore conceptsC17 baseline
Offline reading
Is chapter mein8 sections
0% through this chapter

Record ko meaningful state se shuru hona chahiye. Initializers member values choose karne dete hain aur allowed ho toh members ko naam se specify bhi kar sakte hain. Typed starting values, later assignment aur raw byte filling ko alag samjhenge.

1. Aggregate ke parts initialize karein

C terminology mein arrays aur structures aggregate types hain. Union separate category hai jiske apne initialization rules hain. Braced initializer lists nested shape describe kar sakti hain. Positional structure initializer mein values member declaration order follow karti hain. Designators .name se member aur [index] se array element identify karte hain.

C17 · illustrative fragment
struct Point { int x; int y; int z; };
struct Point point = {.y = 5, .x = 2};
int days[4] = {[0] = 31, [3] = 30};

Yeh C99-and-later notation sirf positions par depend hone ke bajay fields name karti hai. Partial-initialization rules ke under remaining integer members aur elements zero values paate hain. Array ab bhi four elements ki hai; sparse initialization dictionary create nahi karti aur demand par grow nahi hoti.

2. Typed zero, zero bytes se zyada hai

C17 · illustrative fragment
struct Options { int count; double scale; int *target; };
struct Options options = {0};

In ordinary members ke liye C17 ka {0} initializer integer zero deta hai aur remaining members ko required way se implicitly initialize karta hai: floating zero aur null pointer. Yeh type-aware language operation hai. Iska promise memset ya calloc ke saare representation bits zero karne jaisa nahi. Null pointers aur floating values ki all-zero representations required nahi.

Partial initialization ko no initialization se confuse na karein. Ordinary automatic record bina initializer ke initialized member values nahi paata sirf isliye ki doosre example ne braces use ki. Union mein initializer ek member select karta hai; omitted initialization har overlapping member ki independent simultaneous values create nahi karti. Padding questions intended member values se separate hain.

3. Definition ki braces general expression nahi

C17 mein struct Point p = {1, 2}; new object initialize karta hai. Later bare p = {1, 2}; valid ordinary assignment expression nahi. Compound literal specified type ka unnamed object supply karta hai jiska value expression mein use ho sakta hai:

C17 · illustrative fragment
struct Point { int x; int y; };
struct Point point = {1, 2};
point = (struct Point){.x = 7, .y = 8};

Compound literal object hai, loose values par sirf textual cast nahi. Is assignment mein uski structure value existing point mein copy hoti hai. Compound literal function call ke liye array bhi supply kar sakti hai. Neeche function array alive hone par ek element read karta hai; pointer later use ke liye retain nahi karta.

Complete C17 program
#include <assert.h>

static int first(const int *values)
{
    return values[0];
}

int main(void)
{
    int value = first((int[]){4, 5, 6});
    assert(value == 4);
    return 0;
}

4. Unnamed object ki bhi lifetime hoti hai

Plain C17 compound literal function body ke bahar static storage duration rakhti hai. Block ke andar uski automatic storage duration enclosing block se associated hoti hai; woh sirf call expression tak limited nahi. Pointer tab tak usable hai jab object ki lifetime allow kare. Ordinary block-scope compound literal ka pointer return karna object ko block ke baad alive nahi rakhta.

5. Initialization state banati hai, har invariant nahi

Record fully initialized hokar bhi intended rules violate kar sakta hai: lower bound upper bound se zyada, count capacity se zyada, ya tag chosen union payload se inconsistent. Constructor-style function relationships validate karke failure report kar sakta hai. Final lesson interface pattern develop karega. Structure aur intended flexible payload ke liye checked total size ki storage saath allocate karni hoti hai; initializer mein length name karna elements reserve nahi karta.

Primary references aur aage padhne ke liye

Aage badhne se pehle

  • Aggregate initializers type rules se members aur elements ki starting values dete hain.
  • Designators selected members ya elements name karte hain; layout change nahi hota.
  • Compound literals objects banate hain jinki lifetime context aur version rules par depend karti hai.
In ideas ko alag rakhein
Typed zero initialisation / Zero bytes
Language-level zero values type rules follow karti hain; raw zero-filled bytes har type ka universal substitute nahi.
Apne words mein samjhaayein

Designated initializer se record ki intended starting state reader ko clearer kyun ho sakti hai?

Optional: bolkar samjhein ya note rakhein. Tayyar hon toh aage badh sakte hain.

Apni understanding check karein

Optional hai. Answers save ya send nahi hote; chapter kabhi lock nahi hota.

int a[3] = {1}; mein baaki do elements kaise initialize hote hain?
Har choice ki explanation padhein
  1. Dono mein 1 repeat hota hai.

    Partial initializer last explicitly supplied value repeat nahi karta.

  2. Dono zero se initialize hote hain.

    ✓ Sahi reasoning. Baaki aggregate elements ko language ki specified implicit initialization milti hai.

  3. Unmein arbitrary uninitialized values hona zaroori hai.

    Is aggregate ka initializer hai; omitted elements uninitialized automatic int jaise treat nahi hote.

C17

Earlier edition ka quick reference

Existing section links aur saved passages ke liye retained. Connected explanations ke liye expanded lessons follow karein.

C99 ne kuch initialization features add kiye jo kuch patterns ko C89 ke positional-listing alternative se kahin zyada expressive bana dete hain.

Designated Initializers

Ek designated initializer ek specific struct member ya array index ko naam ya position se set karta hai, kisi bhi order mein, aur baaki har element ko implicitly zero-initialize chhod deta hai:

C17 · illustrative fragment
struct Point { int x, y, z; };
struct Point p = { .y = 5, .x = 2 };   /* z implicitly 0 hai */

int days[12] = { [0] = 31, [1] = 28, [11] = 31 };  /* baaki 0 default hote hain */

Ek baar struct mein kuch members se zyada ho jaayen, yeh positional initialization se kahin zyada readable hota hai, aur baad mein struct ko reorder karne par bhi silently galat field initialize nahi hone deta.

Compound Literals

Ek compound literal ek given type aur value ka ek unnamed object inline banata hai, bina ek separate variable declaration ke — jo ek one-off struct ya array ko seedha function call mein pass karne ke liye useful hai:

C17 · illustrative fragment
struct Point { int x, y, z; };
void print_point(struct Point p);
int sum(const int *arr, int n);

/* Fragment: linking ke liye print_point aur sum ki definitions dein. */
void compound_examples(void) {
    print_point((struct Point){ .x = 1, .y = 2, .z = 3 });
    (void)sum((int[]){ 4, 8, 15, 16, 23, 42 }, 6);
}

C17 mein function body ke andar compound literal ki automatic storage duration hoti hai, jo enclosing block se associated hai; block ki execution end hone par object ki lifetime end hoti hai. Function bodies ke bahar compound literal ki static storage duration hoti hai. C23 static jaise kuch storage-class specifiers bhi allow karta hai, isliye block-scope compound literal ka automatic storage duration hona zaroori nahi.

Flexible Array Members

Flexible array member incomplete array hota hai, structure ka last member; kam se kam ek aur named member hona chahiye. Yeh sizeof(struct Buffer) mein ordinary element storage add nahi karta, lekin trailing padding ho sakti hai. Checked sizeof *b + n allocation ke baad data ke liye kam se kam n bytes available hain; length logical bound hai, assumed total layout ya n-byte string nahi. Length n ki null-terminated string chahiye toh terminator ki space bhi reserve/check karein. Enclosing allocation free karein, data separately nahi.

C17 · illustrative fragment
#include <stdint.h>
#include <stdlib.h>

struct Buffer {
    size_t length;
    char data[];  /* last member; length doosra named member hai */
};

struct Buffer *make_buffer(size_t n) {
    if (n > SIZE_MAX - sizeof(struct Buffer)) return NULL;
    struct Buffer *b = malloc(sizeof *b + n);
    if (b != NULL) b->length = n;
    return b;  /* caller NULL check kare aur baad mein free call kare */
}

sizeof(struct Buffer) + n bytes allocate karne se data ko same allocation mein kam se kam n usable bytes milte hain, bina separate pointer member ya second allocation ki zaroorat ke. Padding se available storage zyada ho sakti hai; recorded length logical bound rehta hai. Yeh standardized C99 pattern purane, non-portable "struct hack" ko replace karta hai jisme trailing array ko fake size 1 ya 0 ke saath declare kiya jaata tha.

Agla idea padhne ke liye tayyar?

Mark this chapter as read whenever you feel ready.

CHAPTER 34 / 73

Is chapter mein

Records aur aggregates initialize karna

Search all 73 chapters in both languages.EN + HG

Try “pointer”, “why int”, or “undefined behavior”.

Concepts connect. Follow your curiosity.↑ ↓ to explore · Enter to open
MAKE YOURSELF COMFORTABLE

Your reading space

Appearance

A clear canvas with balanced contrast.

Text size

100%
AA

Reading tools

Your data stays in this browser

Export a backup before changing browsers or replacing an older version of the reader.

YOUR PERSONAL MARGINS

My notebook

Saved on this device
A LITTLE CLARITY

The glossary

A starting meaning, then a chapter to go deeper.

A QUICK DEFINITION

A little clarity

Read the full explanation →

A thought worth keeping