Reading and writing CSV files in C++ can be done using the standard file input/output operations. Using `
Here is an example of how to read from and write to a CSV file in C++:
#include
#include
#include
#include
#include
void readCSV(const std::string& filename) {
std::ifstream file(filename);
std::string line;
while (std::getline(file, line)) {
std::stringstream ss(line);
std::string item;
std::vector<:string> row;
while (std::getline(ss, item, ',')) {
row.push_back(item);
}
// Process row data
for (const auto& element : row) {
std::cout << element << " ";
}
std::cout << std::endl;
}
file.close();
}
void writeCSV(const std::string& filename) {
std::ofstream file(filename);
file << "Name,Age,Location\n";
file << "Alice,30,New York\n";
file << "Bob,25,Los Angeles\n";
file.close();
}
int main() {
writeCSV("output.csv");
readCSV("output.csv");
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?