Detailed explanation of struct usage in C language
Detailed explanation of the usage of struct in c language
In C language, you can use a structure (Struct) to store a Group different types of data. The definition form of a structure is:
struct 结构体名{ 结构体所包含的变量或数组 };
A structure is a collection that contains multiple variables or arrays. Their types can be the same or different. Each such variable or array is called Is a member of the structure.
Recommended "c Language Tutorial"
Please take a look at the following example:
struct stu{ char *name; //姓名 int num; //学号 int age; //年龄 char group; //所在学习小组 float score; //成绩 };
stu is the name of the structure, which contains 5 members , respectively name, num, age, group, score. Structure members are defined in the same way as variables and arrays, except that they cannot be initialized.
Pay attention to the semicolon after the curly braces; it cannot be missing. This is a complete statement.
The structure is also a data type, which is defined by the programmer himself and can contain multiple other types of data.
Data types such as int, float, char, etc. are provided by the C language itself and cannot be split. We call them basic data types; and structures can contain multiple basic types of data, as well. Can contain other structures, which we call complex data types or constructed data types.
Structure variables
Since the structure is a data type, you can use it to define variables. For example:
struct stu stu1, stu2;
defines two variables stu1 and stu2, both of which are stu type and consist of 5 members. Note that the keyword struct cannot be missing.
stu is like a "template", and the variables defined have the same properties. The structure can also be compared to a "drawing" and the structure variables to "parts". Parts produced based on the same drawing have the same characteristics.
You can also define structure variables while defining the structure:
struct stu{
char *name; //Name
int num ; //Student number
int age; //Age
char group; //Study group
float score; //Score
} stu1, stu2;
Just put the variable at the end of the structure definition.
If you only need two variables, stu1 and stu2, and you don’t need to use the structure name to define other variables later, you don’t need to give the structure name when defining, as shown below:
struct{ //No stu
char *name; //Name
int num; //Student number
int age; //Age
char group; //Study group
float score; //Score
} stu1, stu2;
This is easy to write, but because there is no structure name , you cannot use this structure to define new variables later.
Theoretically speaking, each member of the structure is stored continuously in the memory, which is very similar to an array. For example, the memory distribution of the above structure variables stu1 and stu2 is as shown in the figure below, occupying a total of 4 4 4 1 4 = 17 bytes.
However, in the specific implementation of the compiler, there may be gaps between each member. For stu1 and stu2, there is a 3-byte blank filling between the member variables group and score (see the figure below) . Calculated in this way, stu1 and stu2 actually occupy 17 3 = 20 bytes.
Regarding the reasons for the "cracks" between member variables, we will explain in detail in the section "C Language Memory Alignment to Improve Addressing Efficiency" in the "C Language Memory Essentials" topic.
Acquisition and assignment of members
Structures are similar to arrays. They are also a collection of data, and their overall use does not make much sense. Arrays use subscript [ ] to obtain a single element, and structures use dot. to obtain a single member. The general format for obtaining structure members is:
结构体变量名.成员名;
In this way, you can obtain the value of the member, and you can also assign a value to the member:
#include <stdio.h> int main(){ struct{ char *name; //姓名 int num; //学号 int age; //年龄 char group; //所在小组 float score; //成绩 } stu1; //给结构体成员赋值 stu1.name = "Tom"; stu1.num = 12; stu1.age = 18; stu1.group = 'A'; stu1.score = 136.5; //读取结构体成员的值 printf("%s的学号是%d,年龄是%d,在%c组,今年的成绩是%.1f!\n", stu1.name, stu1.num, stu1.age, stu1.group, stu1.score); return 0; }
Running result:
Tom's The student number is 12, the age is 18, and in Group A, this year’s score is 136.5!
In addition to assigning values to members one by one, you can also assign values as a whole during definition, for example:
struct{ char *name; //姓名 int num; //学号 int age; //年龄 char group; //所在小组 float score; //成绩 } stu1, stu2 = { "Tom", 12, 18, 'A', 136.5 };
However, overall assignment is limited to when defining structure variables. During use, you can only assign values to Members are assigned values one by one, which is very similar to the assignment of arrays.
It should be noted that the structure is a custom data type, which is a template for creating variables and does not occupy memory space; only structure variables contain real data and require memory space to store .
For more programming related content, please pay attention to the Programming Introduction column on the php Chinese website!
The above is the detailed content of Detailed explanation of struct usage in C language. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

How to output a countdown in C? Answer: Use loop statements. Steps: 1. Define the variable n and store the countdown number to output; 2. Use the while loop to continuously print n until n is less than 1; 3. In the loop body, print out the value of n; 4. At the end of the loop, subtract n by 1 to output the next smaller reciprocal.

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.

Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i

C Language Data Structure: Overview of the Key Role of Data Structure in Artificial Intelligence In the field of artificial intelligence, data structures are crucial to processing large amounts of data. Data structures provide an effective way to organize and manage data, optimize algorithms and improve program efficiency. Common data structures Commonly used data structures in C language include: arrays: a set of consecutively stored data items with the same type. Structure: A data type that organizes different types of data together and gives them a name. Linked List: A linear data structure in which data items are connected together by pointers. Stack: Data structure that follows the last-in first-out (LIFO) principle. Queue: Data structure that follows the first-in first-out (FIFO) principle. Practical case: Adjacent table in graph theory is artificial intelligence

Troubleshooting Tips for C language processing files When processing files in C language, you may encounter various problems. The following are common problems and corresponding solutions: Problem 1: Cannot open the file code: FILE*fp=fopen("myfile.txt","r");if(fp==NULL){//File opening failed} Reason: File path error File does not exist without file read permission Solution: Check the file path to ensure that the file has check file permission problem 2: File reading failed code: charbuffer[100];size_tread_bytes=fread(buffer,1,siz

C language functions are reusable code blocks, receive parameters for processing, and return results. It is similar to the Swiss Army Knife, powerful and requires careful use. Functions include elements such as defining formats, parameters, return values, and function bodies. Advanced usage includes function pointers, recursive functions, and callback functions. Common errors are type mismatch and forgetting to declare prototypes. Debugging skills include printing variables and using a debugger. Performance optimization uses inline functions. Function design should follow the principle of single responsibility. Proficiency in C language functions can significantly improve programming efficiency and code quality.
