Added Hashset methods with HS. ToList. Minor List update.

Added tests

Collections/Hashset.go

@@ -88,6 +88,38 @@ func (this *Hashset[K]) UnionWith(other *[]K) {
 	}
 }
 
+func (this *Hashset[K]) UnionWithHS(other *Hashset[K]) {
+	for k, _ := range *other._imap {
+		this.Add(k.(K))
+	}
+}
+
+func (this *Hashset[K]) ExceptWithHS(other *Hashset[K]) {
+	for k, _ := range *other._imap {
+		this.Remove(k.(K))
+	}
+}
+
+func (this *Hashset[K]) IntersectWithHS(other *Hashset[K]) {
+	res := map[interface{}]bool{}
+
+	for k, _ := range *other._imap {
+		if this.Contains(k.(K)) {
+			res[k] = false
+		}
+	}
+
+	this._imap = &res
+}
+
+func (this *Hashset[K]) ToList() List[K] {
+	r := NewList[K]()
+	for k := range *this._imap {
+		r.Add(k.(K))
+	}
+	return r
+}
+
 func (this *Hashset[K]) Clone() *Hashset[K] {
 	res := NewHashset[K]()
 	res._imap = CopyMap(this._imap)

Collections/List.go

@@ -176,8 +176,8 @@ func (list *List[T]) Clone() *List[T] {
 	return &newList
 }
 
-// GetSlice returns a copy of the slice.
-func (list List[T]) GetSlice() []T {
+// ToSlice returns a copy of the slice.
+func (list List[T]) ToSlice() []T {
 	res := make([]T, len(list._ilist._arr))
 	copy(res, list._ilist._arr)
 	return res

Tests/Collections/Hashset_test.go

@@ -75,6 +75,22 @@ func Test_ExceptWith(t *testing.T) {
 
 }
 
+func Test_ExceptWithHS(t *testing.T) {
+	hs := Collections.NewHashset[int]()
+	hs.Add(100)
+	hs.Add(20)
+	hs.Add(3)
+
+	hs2 := Collections.NewHashset[int]()
+	hs2.Add(100)
+	hs2.Add(3)
+
+	hs.ExceptWithHS(hs2)
+	assert.Equal(t, 1, hs.Size())
+	assert.True(t, hs.Contains(20))
+
+}
+
 func Test_IntersectWith(t *testing.T) {
 	hs := Collections.NewHashset[int]()
 	hs.Add(100)
@@ -88,6 +104,23 @@ func Test_IntersectWith(t *testing.T) {
 
 }
 
+func Test_IntersectWithHS(t *testing.T) {
+	hs := Collections.NewHashset[int]()
+	hs.Add(100)
+	hs.Add(20)
+	hs.Add(3)
+
+	hs2 := Collections.NewHashset[int]()
+	hs2.Add(100)
+	hs2.Add(3)
+
+	hs.IntersectWithHS(hs2)
+	assert.Equal(t, 2, hs.Size())
+	assert.True(t, hs.Contains(100))
+	assert.True(t, hs.Contains(3))
+
+}
+
 func Test_UnionWith(t *testing.T) {
 	hs := Collections.NewHashset[int]()
 	hs.Add(100)
@@ -101,6 +134,38 @@ func Test_UnionWith(t *testing.T) {
 
 }
 
+func Test_UnionWithHS(t *testing.T) {
+	hs := Collections.NewHashset[int]()
+	hs.Add(100)
+	hs.Add(20)
+	hs.Add(3)
+
+	hs2 := Collections.NewHashset[int]()
+	hs2.Add(33)
+	hs2.Add(44)
+
+	hs.UnionWithHS(hs2)
+	assert.Equal(t, 5, hs.Size())
+	assert.True(t, hs.Contains(33))
+	assert.True(t, hs.Contains(44))
+
+}
+
+func Test_ToList(t *testing.T) {
+	hs1 := Collections.NewHashset[int]()
+	hs1.Add(100)
+	hs1.Add(20)
+	hs1.Add(3)
+
+	li := hs1.ToList()
+
+	assert.Equal(t, 3, li.Size())
+	assert.Equal(t, 100, li.Get(0))
+	assert.Equal(t, 20, li.Get(1))
+	assert.Equal(t, 3, li.Get(2))
+
+}
+
 func Test_Clone(t *testing.T) {
 	hs1 := Collections.NewHashset[int]()
 	hs1.Add(100)

Tests/Collections/List_test.go

@@ -230,7 +230,7 @@ func Test_GetClone_no_impact_to_original(t *testing.T) {
 func Test_GetSlice_no_impact_to_original(t *testing.T) {
 	list := Collections.NewList[int]()
 	list.AddRange([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 0})
-	res := list.GetSlice()
+	res := list.ToSlice()
 	assert.Equal(t, 10, len(res))
 	assert.Equal(t, 4, res[3])
 	assert.Equal(t, 5, res[4])