


C language file operation analysis detailed explanation and example code
C Language File Operation Analysis
In addition to open operations and read and write operations, there are several more common operations in file operations. The functions involved in these operations are introduced below.
1. Functions to move the position pointer
rewind function and fseek function, the prototypes of these two functions are:
void rewind(FILE *fp); Move the position pointer to the beginning of the file
int fseek(FILE *fp ,long int offset,int origin); Move the position pointer to the offset number of bytes from origin. For the parameters in the fseek function, origin is the starting point, and offset is the offset bytes from origin. There are three values for origin: SEEK_SET(0 )—>The beginning of the file, SEEK_CUR(1)—>The current position, SEEK_END(2)—>The end of the file.
Note: 1) If the file is opened in append mode, these two functions will not work when writing. No matter where the position pointer is moved, the added data will always be appended to the end of the file.
2. Other commonly used functions
1. ftell function
long int ftell(FILE *fp);
Calculate the number of bytes from the current position pointer to the beginning of the file. If an error occurs, -1L is returned.
Use the ftell function to calculate the file size.
2.feof function
int feof(FILE *fp);
Detects whether the current position pointer reaches the end of the file. If it reaches the end of the file, it returns a non-zero value, otherwise it returns 0.
3.ferror function
int ferror(FILE *fp);
Detects whether there is an error during the file operation. If an error occurs, it returns a non-zero value, otherwise it returns 0
4.remove function
int remove( const char *filename);
Delete the file. If the deletion is successful, return 0, otherwise return a non-zero value
5.rename function
int rename(const char *oldname, const char *newname);
Replace the file Rename, return 0 if the rename is successful, otherwise return a non-zero value.
6.freopen function
FILE* freopen(const char *filename,const char *mode,FILE *stream);
implements redirected input and output. This function is often used when testing data.
7.fclose function
int fclose(FILE *stream);
Closes a stream. If successful, it returns 0, otherwise it returns -1. Note that the stream must be closed after each operation on the file, otherwise it may cause data lost.
Test program:
#include<stdio.h> #include<stdlib.h> int main(void) { freopen("input.txt","r",stdin); freopen("output.txt","w+",stdout); int i; int a[10]; for(i=0;i<10;i++) { scanf("%d",&a[i]); } for(i=0;i<10;i++) { printf("%d\n",a[i]); } return 0; }
Assume input.txt already exists in the project directory, and the data in the file is 1 2 -1 3 4 5 7 8 9 10. After running, there is no need to input data from the console. The program reads data directly from input.txt, and then outputs the results to output.txt, without directly outputting the results to the console.
Thanks for reading, I hope it can help everyone. For more related articles, please pay attention to the PHP Chinese website (www.php.cn)!

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.

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 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.

The readdir function in the Debian system is a system call used to read directory contents and is often used in C programming. This article will explain how to integrate readdir with other tools to enhance its functionality. Method 1: Combining C language program and pipeline First, write a C program to call the readdir function and output the result: #include#include#include#includeintmain(intargc,char*argv[]){DIR*dir;structdirent*entry;if(argc!=2){

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 functions include definitions, calls and declarations. Function definition specifies function name, parameters and return type, function body implements functions; function calls execute functions and provide parameters; function declarations inform the compiler of function type. Value pass is used for parameter pass, pay attention to the return type, maintain a consistent code style, and handle errors in functions. Mastering this knowledge can help write elegant, robust C code.

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.
