diff --git a/linker/linked_list.h b/linker/linked_list.h
index 5fbdc8ffbcdb2e31143c964308ecd818b643bf8e..a72b73ccd6753cf0d7a5b25b42819efbdcabce3f 100644 (file)
--- a/linker/linked_list.h
+++ b/linker/linked_list.h
clear();
}
+ LinkedList(LinkedList&& that) {
+ this->head_ = that.head_;
+ this->tail_ = that.tail_;
+ that.head_ = that.tail_ = nullptr;
+ }
+
void push_front(T* const element) {
LinkedListEntry<T>* new_entry = Allocator::alloc();
new_entry->next = head_;
return element;
}
+ T* front() const {
+ if (head_ == nullptr) {
+ return nullptr;
+ }
+
+ return head_->element;
+ }
+
void clear() {
while (head_ != nullptr) {
LinkedListEntry<T>* p = head_;
}
template<typename F>
- void for_each(F action) {
+ void for_each(F action) const {
visit([&] (T* si) {
action(si);
return true;
}
template<typename F>
- bool visit(F action) {
+ bool visit(F action) const {
for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {
if (!action(e->element)) {
return false;
}
}
- size_t size() const {
- size_t sz = 0;
- for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {
- ++sz;
- }
-
- return sz;
- }
-
size_t copy_to_array(T* array[], size_t array_length) const {
size_t sz = 0;
for (LinkedListEntry<T>* e = head_; sz < array_length && e != nullptr; e = e->next) {
return false;
}
+ static LinkedList make_list(T* const element) {
+ LinkedList<T, Allocator> one_element_list;
+ one_element_list.push_back(element);
+ return one_element_list;
+ }
+
private:
LinkedListEntry<T>* head_;
LinkedListEntry<T>* tail_;