linkedlist

README

LinkedList

install

1. Download and install it:

   $ go get github.com/kerem37mert/linkedlist
   

2. Import it in your code:

   import "github.com/kerem37mert/linkedlist"
   

Getting Started

Create a linked list

package main

import (
	"github.com/kerem37mert/linkedlist"
)

func main() {
	myList := linkedlist.New()
}

Adding element to linked list and traversal

package main

import (
	"github.com/kerem37mert/linkedlist"
)

func main() {
	myList := linkedlist.New()

	myList.Add("go")
	myList.Add("rust")
	myList.Add("c++")

	myList.Traversal()
}

Remove linked list element by value

package main

import (
	"github.com/kerem37mert/linkedlist"
)

func main() {
	myList := linkedlist.New()

	myList.Add("go")
	myList.Add("rust")
	myList.Add("c++")

	myList.Remove("go")
}

Remove linked list element by index

package main

import (
	"github.com/kerem37mert/linkedlist"
)

func main() {
	myList := linkedlist.New()

	myList.Add("go")
	myList.Add("rust")
	myList.Add("c++")

	myList.RemoveIndex(0)
}

Update value by index

package main

import (
	"github.com/kerem37mert/linkedlist"
	"fmt"
)

func main() {
	myList := linkedlist.New()

	myList.Add("go")
	myList.Add("rust")
	myList.Add("c++")

	err := myList.Update(1, "C")
	if err != nil {
		fmt.Println(err)
	}
}

Using ForEach loop

package main

import (
	"github.com/kerem37mert/linkedlist"
	"fmt"
)

func main() {
	myList := linkedlist.New()

	myList.Add("go")
	myList.Add("rust")
	myList.Add("c++")

	myList.ForEach(func(index uint, value any) {
		fmt.Println(value)
	})
}

Documentation

Index

• type LinkedList
  • func New() *LinkedList
  • func (L *LinkedList) Add(value any)
  • func (L *LinkedList) AddFirst(value any)
  • func (L *LinkedList) Count() uint
  • func (L *LinkedList) ForEach(f func(index uint, value any))
  • func (L *LinkedList) Get(index uint) any
  • func (L *LinkedList) GetFirst() any
  • func (L *LinkedList) GetLast() any
  • func (L *LinkedList) Includes(value any) bool
  • func (L *LinkedList) Remove(value any)
  • func (L *LinkedList) RemoveAll(value any)
  • func (L *LinkedList) RemoveIndex(index uint) error
  • func (L *LinkedList) Traversal()
  • func (L *LinkedList) Update(index uint, value any) error
• type Node

Types

type LinkedList

type LinkedList struct {
	// contains filtered or unexported fields
}

func New

func New() *LinkedList

func (*LinkedList) Add

func (L *LinkedList) Add(value any)

Add Node

func (*LinkedList) AddFirst

func (L *LinkedList) AddFirst(value any)

First Index Add Node

func (*LinkedList) Count

func (L *LinkedList) Count() uint

Element Count

func (*LinkedList) ForEach

func (L *LinkedList) ForEach(f func(index uint, value any))

Linked List Foreach

func (*LinkedList) Get

func (L *LinkedList) Get(index uint) any

Get Value

func (*LinkedList) GetFirst

func (L *LinkedList) GetFirst() any

Get First Value

func (*LinkedList) GetLast

func (L *LinkedList) GetLast() any

Get Last Value

func (*LinkedList) Includes

func (L *LinkedList) Includes(value any) bool

Includes

func (*LinkedList) Remove

func (L *LinkedList) Remove(value any)

Remove First Value

func (*LinkedList) RemoveAll

func (L *LinkedList) RemoveAll(value any)

Revome All Value

func (*LinkedList) RemoveIndex

func (L *LinkedList) RemoveIndex(index uint) error

Remove Index

func (*LinkedList) Traversal

func (L *LinkedList) Traversal()

Linked List Traversal

func (*LinkedList) Update

func (L *LinkedList) Update(index uint, value any) error

Update Index Value

type Node

type Node[T any] struct {
	// contains filtered or unexported fields
}