From cf7626cb6450db1daf11e45daf1a91f2ccb84d22 Mon Sep 17 00:00:00 2001
From: Stoycho Kyosev <stoycho.kk@gmail.com>
Date: Mon, 21 Nov 2022 15:23:19 +0200
Subject: Add more helper functions on ll

---
 Seminar04/linked-list-utils.h | 43 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)

diff --git a/Seminar04/linked-list-utils.h b/Seminar04/linked-list-utils.h
index 8e0fa23..bf093ba 100644
--- a/Seminar04/linked-list-utils.h
+++ b/Seminar04/linked-list-utils.h
@@ -21,6 +21,49 @@ void printLinkedList(const LinkedListNode<T>* ll) {
     std::cout << std::endl;
 }
 
+template<class T>
+void printLinkedList(const LinkedListNode<T>* ll, void (*print)(T)) {
+    const LinkedListNode<T>* iterate = ll;
+
+    while(iterate) {
+        print(iterate->data);
+        iterate = iterate->next;
+    }
+
+    std::cout << std::endl;
+}
+
+template<class T>
+void printLinkedList(const LinkedListNode<T>* ll, void (*print)(const T&)) {
+    const LinkedListNode<T>* iterate = ll;
+
+    while(iterate) {
+        print(iterate->data);
+        iterate = iterate->next;
+    }
+
+    std::cout << std::endl;
+}
+
+template<class T>
+LinkedListNode<T>* fromList(const std::initializer_list<T>& l) {
+    LinkedListNode<T>* toReturn = nullptr;
+    LinkedListNode<T>* iter = nullptr;
+
+    for(const auto& elem : l) {
+        LinkedListNode<T>* toInsert = new LinkedListNode<T>(elem);
+        if(iter == nullptr) {
+            toReturn = toInsert;
+            iter = toInsert;
+        }
+        else {
+            iter->next = toInsert;
+            iter = iter->next;
+        }
+    }
+    return toReturn;
+}
+
 template<class T>
 void freeList(LinkedListNode<T>* ll) {
     while(ll) {
-- 
cgit v1.3.1-23-gd82d