I have created a custom container called goldbox that only contains arithmetic types and I have also implemented begin and end member functions to iterate over the elements.
My Full Source Code:
#include <algorithm>
#include <vector>
#include <initializer_list>
#include <iostream>
#include <type_traits>
#include <ranges>
template <typename T>
concept Arithmetic = std::is_arithmetic_v<T>;
template <Arithmetic T = int>
class goldbox {
private:
template <Arithmetic Base_t>
struct Node {
Base_t data;
Node<Base_t>* prev;
Node<Base_t>* next;
};
Node<T>* head;
Node<T>* current_node;
Node<T>*& __at_node(size_t index) {
auto temp = head;
size_t count {0};
while (count < index) {
temp = temp->next;
count++;
}
current_node = temp;
return current_node;
}
Node<T>*& __get_tail() {
return __at_node(length() - 1);
}
public:
using value_type = T;
goldbox() : head{nullptr}, current_node{nullptr} {}
goldbox(std::initializer_list<T>&& list_arg) : goldbox() {
decltype(auto) list_1 = std::forward<decltype(list_arg)>(list_arg);
T temp[list_1.size()];
std::copy(list_1.begin(), list_1.end(), temp);
std::reverse(temp, temp + list_1.size());
for (const auto& elem : temp)
push_front(elem);
}
class iterator {
private:
Node<T>* node;
public:
iterator(Node<T>* arg) noexcept : node{arg} {}
iterator& operator=(Node<T>* arg) {
node = arg;
return *this;
}
iterator operator++() {
if (node)
node = node->next;
return *this;
}
iterator operator++(int) {
iterator iter = *this;
++(*this);
return iter;
}
iterator operator--() {
if (node)
node = node->prev;
return *this;
}
iterator operator--(int) {
iterator iter = *this;
--(*this);
return iter;
}
bool operator==(const iterator& other) {
return (node == other.node);
}
bool operator!=(const iterator& other) {
return (node != other.node);
}
T& operator*() {
return node->data;
}
};
iterator begin() {
return iterator{head};
}
iterator end() {
return iterator{nullptr};
}
size_t length() const {
auto temp = head;
size_t count {0};
while (temp != nullptr) {
++count;
temp = temp->next;
}
return count;
}
goldbox& push_front(T arg) {
auto new_node = new Node<T>;
new_node->data = arg;
new_node->prev = nullptr;
new_node->next = head;
if (head != nullptr)
head->prev = new_node;
head = new_node;
return *this;
}
goldbox& push_back(T arg) {
auto new_node = new Node<T>;
auto last = head;
new_node->data = arg;
new_node->next = nullptr;
if (head == nullptr){
new_node->prev = nullptr;
head = new_node;
return *this;
}
while (last->next != nullptr)
last = last->next;
last->next = new_node;
new_node->prev = last;
return *this;
}
goldbox& clear() {
auto temp = head;
Node<T>* next_temp;
while (temp != nullptr) {
next_temp = temp->next;
delete temp;
temp = next_temp;
}
head = nullptr;
return *this;
}
goldbox& pop_back() {
if (head != nullptr) {
if (length() != 1) {
delete std::move(__get_tail());
__at_node(length() - 2)->next = nullptr;
} else {
this->clear();
}
}
return *this;
}
goldbox& pop_front() {
if (head != nullptr) {
auto temp = head;
head = head->next;
delete temp;
}
return *this;
}
};
int main() {
goldbox goldbox_1 {2, 3, 5, 6, 7, 9};
goldbox goldbox_2;
for (const auto& elem : goldbox_1) {
std::cout << elem << ' ';
} std::cout << '\n';
std::transform(goldbox_1.begin(), goldbox_1.end(),
std::back_inserter(goldbox_2),
[](auto x){return 2 * x - 1; }
);
for (const auto& elem : goldbox_2) {
std::cout << elem << ' ';
} std::cout << '\n';
return 0;
}
Output:
2 3 5 6 7 9
3 5 9 11 13 17
But I wanted to use it using ranges so that I don't have to create a new instance.
Once I applied the goldbox inside the range-based for loop:
for (const auto& elem: goldbox_1 | std::ranges::views::transform([](auto x){return 2 * x - 1;})) {
std::cout << elem << ' ';
} std::cout << '\n';
It throws an error because I haven't provided an operator|.
If I used the non-pipe syntax:
for (const auto& elem: std::ranges::views::transform(goldbox_1, [](auto x){return x + 1;})) {
std::cout << elem << ' ';
} std::cout << '\n';
It will still throw an error that both begin and end were not declared in the scope.
