LinkedList.go

package linkedlist

import (
	"errors"
	"fmt"
)

type LinkedList struct {
	head *node[any]
}

// Add node
func (L *LinkedList) Add(value any) {
	var newnode *node[any] = new(node[any])
	newnode.data = value
	newnode.next = nil

	if L.head == nil {
		L.head = newnode
	} else {
		var temp *node[any] = L.head

		for temp.next != nil {
			temp = temp.next
		}
		temp.next = newnode
	}
}

// First Index Add node
func (L *LinkedList) AddFirst(value any) {
	var newnode *node[any] = new(node[any])
	newnode.data = value
	newnode.next = nil

	if L.head == nil {
		L.head = newnode
	} else {
		newnode.next = L.head
		L.head = newnode
	}
}

// Linked List Traversal
func (L *LinkedList) Traversal() {
	if L.head == nil {
		fmt.Println("Your linked list is empty")
	} else {
		var temp *node[any] = L.head

		for temp != nil {
			fmt.Printf("[%v] -> ", temp.data)
			temp = temp.next
		}

		fmt.Println("nil")
	}
}

// Includes
func (L *LinkedList) Includes(value any) bool {
	var temp *node[any] = L.head

	for temp != nil {
		if temp.data == value {
			return true
		}
		temp = temp.next
	}
	return false
}

// Element Count
func (L *LinkedList) Count() uint {
	var temp *node[any] = L.head
	var count uint = 0

	for temp != nil {
		count++
		temp = temp.next
	}
	return count
}

// Get Value
func (L *LinkedList) Get(index uint) any {
	if L.Count() > index {
		var temp *node[any] = L.head

		for i := 0; i != int(index); i++ {
			temp = temp.next
		}
		return temp.data

	} else {
		return nil
	}
}

// Get First Value
func (L *LinkedList) GetFirst() any {
	if L.head != nil {
		return L.head.data
	} else {
		return nil
	}
}

// Get Last Value
func (L *LinkedList) GetLast() any {
	if L.head != nil {
		var temp *node[any] = L.head
		for temp.next != nil {
			temp = temp.next
		}
		return temp.data

	} else {
		return nil
	}
}

// Update Index Value
func (L *LinkedList) Update(index uint, value any) error {
	if L.Count() > index {
		var temp *node[any] = L.head

		for i := 0; i != int(index); i++ {
			temp = temp.next
		}
		temp.data = value

		return nil
	} else {
		return errors.New("index is out of range")
	}
}

// Remove Index
func (L *LinkedList) RemoveIndex(index uint) error {
	if L.Count() > index {

		if index == 0 {
			L.head = L.head.next
		} else {
			var temp *node[any] = L.head

			for i := 1; i != int(index); i++ {
				temp = temp.next
			}

			temp.next = temp.next.next
		}

		return nil
	} else {
		return errors.New("Index out of range")
	}
}

// Remove First Value
func (L *LinkedList) Remove(value any) {
	if L.head == nil {
		return
	}

	if L.head.data == value {
		L.head = L.head.next
	} else {
		var temp *node[any] = L.head

		for temp.next != nil {
			if temp.next.data == value {
				temp.next = temp.next.next
				return
			}
			temp = temp.next
		}
	}
}

// Revome All Value
func (L *LinkedList) RemoveAll(value any) {
	for L.head != nil && L.head.data == value {
		L.head = L.head.next
	}

	var temp *node[any] = L.head
	if temp != nil {
		for temp.next != nil {
			if temp.next.data == value {
				temp.next = temp.next.next
			} else {
				temp = temp.next
			}
		}
	}
}

// Linked List Foreach
func (L *LinkedList) ForEach(f func(index uint, value any)) {
	var temp *node[any] = L.head

	for i := 0; temp != nil; i++ {
		f(uint(i), temp.data)
		temp = temp.next
	}
}