Unify coding styles

Author: johnteee

stream.go

@@ -298,7 +298,7 @@ func SetFromArrayInterface(list []interface{}) *MapSetDef[interface{}, interface
 }
 
 // MapKey Map all keys of Set by function
-func (mapSetSelf *MapSetDef[T, R]) MapKey(fn TransformerFunctor[T, T]) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) MapKey(fn TransformerFunctor[T, T]) SetDef[T, R] {
 	result := make(MapSetDef[T, R], len(*mapSetSelf))
 	for k, v := range *mapSetSelf {
 		result[fn(k)] = v
@@ -308,7 +308,7 @@ func (mapSetSelf *MapSetDef[T, R]) MapKey(fn TransformerFunctor[T, T]) *MapSetDe
 }
 
 // MapValue Map all values of Set by function
-func (mapSetSelf *MapSetDef[T, R]) MapValue(fn TransformerFunctor[R, R]) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) MapValue(fn TransformerFunctor[R, R]) SetDef[T, R] {
 	result := make(MapSetDef[T, R], len(*mapSetSelf))
 	for k, v := range *mapSetSelf {
 		result[k] = fn(v)
@@ -334,25 +334,25 @@ func (mapSetSelf *MapSetDef[T, R]) ContainsValue(input R) bool {
 }
 
 // IsSubsetByKey returns true or false by checking if set1 is a subset of set2
-func (mapSetSelf *MapSetDef[T, R]) IsSubsetByKey(input *MapSetDef[T, R]) bool {
-	return IsSubsetMapByKey(*mapSetSelf, *input)
+func (mapSetSelf *MapSetDef[T, R]) IsSubsetByKey(input SetDef[T, R]) bool {
+	return IsSubsetMapByKey(*mapSetSelf, input.AsMap())
 }
 
 // IsSupersetByKey returns true or false by checking if set1 is a superset of set2
-func (mapSetSelf *MapSetDef[T, R]) IsSupersetByKey(input *MapSetDef[T, R]) bool {
-	return IsSupersetMapByKey(*mapSetSelf, *input)
+func (mapSetSelf *MapSetDef[T, R]) IsSupersetByKey(input SetDef[T, R]) bool {
+	return IsSupersetMapByKey(*mapSetSelf, input.AsMap())
 }
 
 // Add Add items into the Set
-func (mapSetSelf *MapSetDef[T, R]) Add(input ...T) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) Add(input ...T) SetDef[T, R] {
 	inputLen := len(input)
 	if inputLen > 0 {
 		result := mapSetSelf.Clone()
 		for _, v := range input {
-			if _, ok := (*result)[v]; ok {
+			if _, ok := result.AsMap()[v]; ok {
 				continue
 			}
-			(*result)[v] = *new(R)
+			result.AsMap()[v] = *new(R)
 		}
 
 		return result
@@ -362,12 +362,12 @@ func (mapSetSelf *MapSetDef[T, R]) Add(input ...T) *MapSetDef[T, R] {
 }
 
 // RemoveKeys Remove keys from the Set
-func (mapSetSelf *MapSetDef[T, R]) RemoveKeys(input ...T) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) RemoveKeys(input ...T) SetDef[T, R] {
 	inputLen := len(input)
 	if inputLen > 0 {
 		result := mapSetSelf.Clone()
 		for _, v := range input {
-			delete(*result, v)
+			delete(result.AsMap(), v)
 		}
 
 		return result
@@ -377,14 +377,14 @@ func (mapSetSelf *MapSetDef[T, R]) RemoveKeys(input ...T) *MapSetDef[T, R] {
 }
 
 // RemoveValues Remove values from the Set
-func (mapSetSelf *MapSetDef[T, R]) RemoveValues(input ...R) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) RemoveValues(input ...R) SetDef[T, R] {
 	inputLen := len(input)
 	if inputLen > 0 {
 		result := mapSetSelf.Clone()
 		valueMap := SliceToMap(0, input...)
 		for k, v := range *mapSetSelf {
 			if _, ok := valueMap[v]; ok {
-				delete(*result, k)
+				delete(result.AsMap(), k)
 			}
 		}
 
@@ -407,45 +407,45 @@ func (mapSetSelf *MapSetDef[T, R]) Set(key T, value R) {
 }
 
 // Clone Clone this Set
-func (mapSetSelf *MapSetDef[T, R]) Clone() *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) Clone() SetDef[T, R] {
 	result := MapSetDef[T, R](DuplicateMap[T, R](*mapSetSelf))
 
 	return &result
 }
 
 // Union Union an another Set object
-func (mapSetSelf *MapSetDef[T, R]) Union(input *MapSetDef[T, R]) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) Union(input SetDef[T, R]) SetDef[T, R] {
 	if input == nil || input.Size() == 0 {
 		return mapSetSelf
 	}
 
-	result := MapSetDef[T, R](Merge(*mapSetSelf, *input))
+	result := MapSetDef[T, R](Merge(*mapSetSelf, input.AsMap()))
 
 	return &result
 }
 
 // Intersection Get the Intersection with this Set and an another Set
-func (mapSetSelf *MapSetDef[T, R]) Intersection(input *MapSetDef[T, R]) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) Intersection(input SetDef[T, R]) SetDef[T, R] {
 	if input == nil || input.Size() == 0 {
 		return new(MapSetDef[T, R])
 	}
 
-	result := MapSetDef[T, R](IntersectionMapByKey(*mapSetSelf, *input))
+	result := MapSetDef[T, R](IntersectionMapByKey(*mapSetSelf, input.AsMap()))
 
 	return &result
 }
 
 // Minus Get all of this Set but not in the given Set
-func (mapSetSelf *MapSetDef[T, R]) Minus(input *MapSetDef[T, R]) *MapSetDef[T, R] {
+func (mapSetSelf *MapSetDef[T, R]) Minus(input SetDef[T, R]) SetDef[T, R] {
 	if input == nil || input.Size() == 0 {
 		return mapSetSelf
 	}
 
 	result := mapSetSelf.Clone()
-	for k := range *result {
-		_, exists := (*input)[k]
+	for k := range result.AsMap() {
+		_, exists := input.AsMap()[k]
 		if exists {
-			delete(*result, k)
+			delete(result.AsMap(), k)
 		}
 	}