C# 中是否存在与 IEnumerableT 等效的标准 C++

cpp
#include <IOStream>
#include <vector>
int mAIn() {
    std::vector<int> numbers = {1, 2, 3, 4, 5};
    // 使用迭代器遍历容器
    for (auto it = numbers.begin(); it != numbers.end(); ++it) {
        std::cout << *it << " ";</p>    }
    return 0;
}

cpp
#include <IOStream>
class Node {
public:
    int data;
    Node* next;
    Node(int data) {
        this->data = data;
        this->next = nullptr;
    }
};
class LinkedList {
private:
    Node* head;
    Node* tAIl;
public:
    LinkedList() {
        this->head = nullptr;
        this->tAIl = nullptr;
    }
    // 添加元素到链表
    void add(int data) {
        Node* newNode = new Node(data);
        if (head == nullptr) {
            head = newNode;
            tAIl = newNode;
        } else {
            tAIl->next = newNode;
            tAIl = newNode;
        }
    }
    // 自定义迭代器
    class Iterator {
    private:
        Node* current;
    public:
        Iterator(Node* node) {
            this->current = node;
        }
        // 迭代器的自增运算符
        Iterator& operator++() {
            current = current->next;
            return *this;
        }
        // 迭代器的解引用运算符
        int operator*() const {
            return current->data;
        }
        // 迭代器的比较运算符
        bool operator!=(const Iterator& other) const {
            return current != other.current;
        }
    };
    // 获取链表的起始迭代器
    Iterator begin() {
        return Iterator(head);
    }
    // 获取链表的末尾迭代器
    Iterator end() {
        return Iterator(nullptr);
    }
};
int mAIn() {
    LinkedList list;
    list.add(1);
    list.add(2);
    list.add(3);
    list.add(4);
    list.add(5);
    // 使用自定义迭代器遍历链表
    for (auto it = list.begin(); it != list.end(); ++it) {
        std::cout << *it << " ";</p>    }
    return 0;
}