merge: replaced 'interface{}' with 'any' using new go1.18 alias (#506)

Author: ritikBhandari

CONTRIBUTING.md

@@ -93,7 +93,7 @@ import (
 // Fprint formats using the default formats for its operands and writes to w.
 // Spaces are added between operands when neither is a string.
 // It returns the number of bytes written, and any write error encountered.
-func Fprint(w io.Writer, a ...interface{}) (n int, err error) {
+func Fprint(w io.Writer, a ...any) (n int, err error) {
     ...
 }
 

graph/dijkstra.go

@@ -7,7 +7,7 @@ type Item struct {
 	dist int
 }
 
-func (a Item) More(b interface{}) bool {
+func (a Item) More(b any) bool {
 	// reverse direction for minheap
 	return a.dist < b.(Item).dist
 }

sort/heapsort.go

@@ -107,11 +107,11 @@ func (h MaxHeap) heapifyDown(i int) {
 
 type Comparable interface {
 	Idx() int
-	More(interface{}) bool
+	More(any) bool
 }
 type Int int
 
-func (a Int) More(b interface{}) bool {
+func (a Int) More(b any) bool {
 	return a > b.(Int)
 }
 func (a Int) Idx() int {

structure/dynamicarray/dynamicarray.go

@@ -21,11 +21,11 @@ var defaultCapacity = 10
 type DynamicArray struct {
 	Size        int
 	Capacity    int
-	ElementData []interface{}
+	ElementData []any
 }
 
 // Put function is change/update the value in array with the index and new value
-func (da *DynamicArray) Put(index int, element interface{}) error {
+func (da *DynamicArray) Put(index int, element any) error {
 	err := da.CheckRangeFromIndex(index)
 
 	if err != nil {
@@ -38,7 +38,7 @@ func (da *DynamicArray) Put(index int, element interface{}) error {
 }
 
 // Add function is add new element to our array
-func (da *DynamicArray) Add(element interface{}) {
+func (da *DynamicArray) Add(element any) {
 	if da.Size == da.Capacity {
 		da.NewCapacity()
 	}
@@ -64,7 +64,7 @@ func (da *DynamicArray) Remove(index int) error {
 }
 
 // Get function is return one element with the index of array
-func (da *DynamicArray) Get(index int) (interface{}, error) {
+func (da *DynamicArray) Get(index int) (any, error) {
 	err := da.CheckRangeFromIndex(index)
 
 	if err != nil {
@@ -80,7 +80,7 @@ func (da *DynamicArray) IsEmpty() bool {
 }
 
 // GetData function return all value of array
-func (da *DynamicArray) GetData() []interface{} {
+func (da *DynamicArray) GetData() []any {
 	return da.ElementData[:da.Size]
 }
 
@@ -100,7 +100,7 @@ func (da *DynamicArray) NewCapacity() {
 		da.Capacity = da.Capacity << 1
 	}
 
-	newDataElement := make([]interface{}, da.Capacity)
+	newDataElement := make([]any, da.Capacity)
 
 	copy(newDataElement, da.ElementData)
 

structure/dynamicarray/dynamicarray_test.go

@@ -26,7 +26,7 @@ func TestDynamicArray(t *testing.T) {
 		if numbers.IsEmpty() != false {
 			t.Errorf("Expected be false but got %v", numbers.IsEmpty())
 		}
-		var res []interface{}
+		var res []any
 		res = append(res, 10)
 		res = append(res, 20)
 		res = append(res, 30)
@@ -43,7 +43,7 @@ func TestDynamicArray(t *testing.T) {
 		if numbers.IsEmpty() != false {
 			t.Errorf("Expected be false but got %v", numbers.IsEmpty())
 		}
-		var res []interface{}
+		var res []any
 		res = append(res, 10)
 		res = append(res, 30)
 		res = append(res, 40)

structure/hashmap/hashmap.go

@@ -8,8 +8,8 @@ import (
 var defaultCapacity uint64 = 1 << 10
 
 type node struct {
-	key   interface{}
-	value interface{}
+	key   any
+	value any
 	next  *node
 }
 
@@ -38,7 +38,7 @@ func Make(size, capacity uint64) HashMap {
 }
 
 // Get returns value associated with given key
-func (hm *HashMap) Get(key interface{}) interface{} {
+func (hm *HashMap) Get(key any) any {
 	node := hm.getNodeByHash(hm.hash(key))
 
 	if node != nil {
@@ -49,17 +49,17 @@ func (hm *HashMap) Get(key interface{}) interface{} {
 }
 
 // Put puts new key value in hashmap
-func (hm *HashMap) Put(key interface{}, value interface{}) interface{} {
+func (hm *HashMap) Put(key any, value any) any {
 	return hm.putValue(hm.hash(key), key, value)
 }
 
 // Contains checks if given key is stored in hashmap
-func (hm *HashMap) Contains(key interface{}) bool {
+func (hm *HashMap) Contains(key any) bool {
 	node := hm.getNodeByHash(hm.hash(key))
 	return node != nil
 }
 
-func (hm *HashMap) putValue(hash uint64, key interface{}, value interface{}) interface{} {
+func (hm *HashMap) putValue(hash uint64, key any, value any) any {
 	if hm.capacity == 0 {
 		hm.capacity = defaultCapacity
 		hm.table = make([]*node, defaultCapacity)
@@ -106,22 +106,22 @@ func (hm *HashMap) resize() {
 	}
 }
 
-func newNode(key interface{}, value interface{}) *node {
+func newNode(key any, value any) *node {
 	return &node{
 		key:   key,
 		value: value,
 	}
 }
 
-func newNodeWithNext(key interface{}, value interface{}, next *node) *node {
+func newNodeWithNext(key any, value any, next *node) *node {
 	return &node{
 		key:   key,
 		value: value,
 		next:  next,
 	}
 }
 
-func (hm *HashMap) hash(key interface{}) uint64 {
+func (hm *HashMap) hash(key any) uint64 {
 	h := fnv.New64a()
 	_, _ = h.Write([]byte(fmt.Sprintf("%v", key)))
 

structure/hashmap/hashmap_test.go

@@ -59,7 +59,7 @@ func TestHashMap(t *testing.T) {
 	})
 
 	t.Run("Test 7: Checking if the key does not exist Get func returns nil", func(t *testing.T) {
-		want := interface{}(nil)
+		want := any(nil)
 		got := mp.Get(2)
 		if got != want {
 			t.Errorf("Key '2' does not exists in the map but it says otherwise")

structure/linkedlist/cyclic.go

@@ -17,7 +17,7 @@ func NewCyclic() *Cyclic {
 // point to itself. For other cases, the node will be added
 // to the end of the list. End of the list is Prev field of
 // current item. Complexity O(1).
-func (cl *Cyclic) Add(val interface{}) {
+func (cl *Cyclic) Add(val any) {
 	n := NewNode(val)
 	cl.Size++
 	if cl.Head == nil {

structure/linkedlist/cyclic_test.go

@@ -15,8 +15,8 @@ func TestAdd(t *testing.T) {
 	list := NewCyclic()
 	fillList(list, 3)
 
-	want := []interface{}{1, 2, 3}
-	var got []interface{}
+	want := []any{1, 2, 3}
+	var got []any
 	var start *Node
 	start = list.Head
 

structure/linkedlist/doubly.go

@@ -24,7 +24,7 @@ func NewDoubly() *Doubly {
 }
 
 // AddAtBeg Add a node to the beginning of the linkedlist
-func (ll *Doubly) AddAtBeg(val interface{}) {
+func (ll *Doubly) AddAtBeg(val any) {
 	n := NewNode(val)
 	n.Next = ll.Head
 
@@ -37,7 +37,7 @@ func (ll *Doubly) AddAtBeg(val interface{}) {
 }
 
 // AddAtEnd Add a node at the end of the linkedlist
-func (ll *Doubly) AddAtEnd(val interface{}) {
+func (ll *Doubly) AddAtEnd(val any) {
 	n := NewNode(val)
 
 	if ll.Head == nil {
@@ -53,7 +53,7 @@ func (ll *Doubly) AddAtEnd(val interface{}) {
 }
 
 // DelAtBeg Delete the node at the beginning of the linkedlist
-func (ll *Doubly) DelAtBeg() interface{} {
+func (ll *Doubly) DelAtBeg() any {
 	if ll.Head == nil {
 		return -1
 	}
@@ -68,7 +68,7 @@ func (ll *Doubly) DelAtBeg() interface{} {
 }
 
 // DetAtEnd Delete a node at the end of the linkedlist
-func (ll *Doubly) DelAtEnd() interface{} {
+func (ll *Doubly) DelAtEnd() any {
 	// no item
 	if ll.Head == nil {
 		return -1
@@ -90,7 +90,7 @@ func (ll *Doubly) DelAtEnd() interface{} {
 }
 
 // Count Number of nodes in the linkedlist
-func (ll *Doubly) Count() interface{} {
+func (ll *Doubly) Count() any {
 	var ctr int = 0
 
 	for cur := ll.Head; cur != nil; cur = cur.Next {

structure/linkedlist/shared.go

@@ -3,12 +3,12 @@ package linkedlist
 // Node Structure representing the linkedlist node.
 // This node is shared across different implementations.
 type Node struct {
-	Val  interface{}
+	Val  any
 	Prev *Node
 	Next *Node
 }
 
 // Create new node.
-func NewNode(val interface{}) *Node {
+func NewNode(val any) *Node {
 	return &Node{val, nil, nil}
 }

structure/linkedlist/singlylinkedlist.go

@@ -21,15 +21,15 @@ func NewSingly() *Singly {
 }
 
 // AddAtBeg adds a new snode with given value at the beginning of the list.
-func (ll *Singly) AddAtBeg(val interface{}) {
+func (ll *Singly) AddAtBeg(val any) {
 	n := NewNode(val)
 	n.Next = ll.Head
 	ll.Head = n
 	ll.length++
 }
 
 // AddAtEnd adds a new snode with given value at the end of the list.
-func (ll *Singly) AddAtEnd(val interface{}) {
+func (ll *Singly) AddAtEnd(val any) {
 	n := NewNode(val)
 
 	if ll.Head == nil {
@@ -46,7 +46,7 @@ func (ll *Singly) AddAtEnd(val interface{}) {
 }
 
 // DelAtBeg deletes the snode at the head(beginning) of the list and returns its value. Returns -1 if the list is empty.
-func (ll *Singly) DelAtBeg() interface{} {
+func (ll *Singly) DelAtBeg() any {
 	if ll.Head == nil {
 		return -1
 	}
@@ -59,7 +59,7 @@ func (ll *Singly) DelAtBeg() interface{} {
 }
 
 // DelAtEnd deletes the snode at the tail(end) of the list and returns its value. Returns -1 if the list is empty.
-func (ll *Singly) DelAtEnd() interface{} {
+func (ll *Singly) DelAtEnd() any {
 	if ll.Head == nil {
 		return -1
 	}

structure/linkedlist/singlylinkedlist_test.go

@@ -12,8 +12,8 @@ func TestSingly(t *testing.T) {
 	list.AddAtBeg(3)
 
 	t.Run("Test AddAtBeg()", func(t *testing.T) {
-		want := []interface{}{3, 2, 1}
-		got := []interface{}{}
+		want := []any{3, 2, 1}
+		got := []any{}
 		current := list.Head
 		got = append(got, current.Val)
 		for current.Next != nil {
@@ -28,8 +28,8 @@ func TestSingly(t *testing.T) {
 	list.AddAtEnd(4)
 
 	t.Run("Test AddAtEnd()", func(t *testing.T) {
-		want := []interface{}{3, 2, 1, 4}
-		got := []interface{}{}
+		want := []any{3, 2, 1, 4}
+		got := []any{}
 		current := list.Head
 		got = append(got, current.Val)
 		for current.Next != nil {
@@ -42,15 +42,15 @@ func TestSingly(t *testing.T) {
 	})
 
 	t.Run("Test DelAtBeg()", func(t *testing.T) {
-		want := interface{}(3)
+		want := any(3)
 		got := list.DelAtBeg()
 		if got != want {
 			t.Errorf("got: %v, want: %v", got, want)
 		}
 	})
 
 	t.Run("Test DelAtEnd()", func(t *testing.T) {
-		want := interface{}(4)
+		want := any(4)
 		got := list.DelAtEnd()
 		if got != want {
 			t.Errorf("got: %v, want: %v", got, want)
@@ -74,8 +74,8 @@ func TestSingly(t *testing.T) {
 	list2.AddAtBeg(6)
 
 	t.Run("Test Reverse()", func(t *testing.T) {
-		want := []interface{}{1, 2, 3, 4, 5, 6}
-		got := []interface{}{}
+		want := []any{1, 2, 3, 4, 5, 6}
+		got := []any{}
 		list2.Reverse()
 		current := list2.Head
 		got = append(got, current.Val)
@@ -89,8 +89,8 @@ func TestSingly(t *testing.T) {
 	})
 
 	t.Run("Test ReversePartition()", func(t *testing.T) {
-		want := []interface{}{1, 5, 4, 3, 2, 6}
-		got := []interface{}{}
+		want := []any{1, 5, 4, 3, 2, 6}
+		got := []any{}
 		err := list2.ReversePartition(2, 5)
 
 		if err != nil {

structure/queue/queue_test.go

@@ -109,7 +109,7 @@ func TestQueue(t *testing.T) {
 			}
 		})
 
-		ListQueue = []interface{}{}
+		ListQueue = []any{}
 
 		t.Run("Test Queue isEmpty", func(t *testing.T) {
 
@@ -125,7 +125,7 @@ func TestQueue(t *testing.T) {
 			}
 		})
 
-		ListQueue = []interface{}{}
+		ListQueue = []any{}
 		t.Run("Test Queue Length", func(t *testing.T) {
 			if LenQueue() != 0 {
 				t.Errorf("Test Queue Length is wrong the result must be %v but got %v", 0, LenQueue())