release v2.1.11

README.md

@@ -4,7 +4,7 @@
 <br/>
 
 ![Go version](https://img.shields.io/badge/go-%3E%3Dv1.18-9cf)
-[![Release](https://img.shields.io/badge/release-2.1.9-green.svg)](https://github.com/duke-git/lancet/releases)
+[![Release](https://img.shields.io/badge/release-2.1.11-green.svg)](https://github.com/duke-git/lancet/releases)
 [![GoDoc](https://godoc.org/github.com/duke-git/lancet/v2?status.svg)](https://pkg.go.dev/github.com/duke-git/lancet/v2)
 [![Go Report Card](https://goreportcard.com/badge/github.com/duke-git/lancet/v2)](https://goreportcard.com/report/github.com/duke-git/lancet/v2)
 [![test](https://github.com/duke-git/lancet/actions/workflows/codecov.yml/badge.svg?branch=main&event=push)](https://github.com/duke-git/lancet/actions/workflows/codecov.yml)
@@ -19,7 +19,7 @@
     Lancet is a comprehensive, efficient, and reusable util function library of go. Inspired by the java apache common package and lodash.js.
 </p>
 
-English | [简体中文](./README_zh-CN.md)
+English | [简体中文](./README_zh-CN.md) | [Website](https://uvdream.github.io/lancet-docs/en/)
 
 ## Feature
 
@@ -38,7 +38,7 @@ English | [简体中文](./README_zh-CN.md)
 go get github.com/duke-git/lancet/v2 // will install latest version of v2.x.x
 ```
 
-2. <b>For users who use version below go1.18, you should install v1.x.x. now latest v1 is v1.3.3. </b>
+2. <b>For users who use version below go1.18, you should install v1.x.x. now latest v1 is v1.3.4. </b>
 
 ```go
 go get github.com/duke-git/lancet@v1.3.3 // below go1.18, install latest version of v1.x.x
@@ -372,11 +372,11 @@ import "github.com/duke-git/lancet/v2/netutil"
 -   [DecodeResponse](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#DecodeResponse)
 -   [StructToUrlValues](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#StructToUrlValues)
 
--   [HttpGet<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpGet)
--   [HttpDelete<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpDelete)
--   [HttpPost<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpPost)
--   [HttpPut<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpPut)
--   [HttpPatch<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpPatch)
+-   [HttpGet<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpGet)
+-   [HttpDelete<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpDelete)
+-   [HttpPost<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpPost)
+-   [HttpPut<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpPut)
+-   [HttpPatch<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#HttpPatch)
 -   [ParseHttpResponse](https://github.com/duke-git/lancet/blob/main/docs/netutil.md#ParseHttpResponse)
 
 ### 14. Random package implements some basic functions to generate random int and string.
@@ -425,6 +425,7 @@ import "github.com/duke-git/lancet/v2/slice"
 -   [Compact](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Compact)
 -   [Concat](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Concat)
 -   [Count](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Count)
+-   [CountBy](https://github.com/duke-git/lancet/blob/main/docs/slice.md#CountBy)
 -   [Difference](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Difference)
 -   [DifferenceBy](https://github.com/duke-git/lancet/blob/main/docs/slice.md#DifferenceBy)
 -   [DifferenceWith](https://github.com/duke-git/lancet/blob/main/docs/slice.md#DifferenceWith)
@@ -441,21 +442,25 @@ import "github.com/duke-git/lancet/v2/slice"
 -   [ForEach](https://github.com/duke-git/lancet/blob/main/docs/slice.md#ForEach)
 -   [GroupBy](https://github.com/duke-git/lancet/blob/main/docs/slice.md#GroupBy)
 -   [GroupWith](https://github.com/duke-git/lancet/blob/main/docs/slice.md#GroupWith)
--   [IntSlice](https://github.com/duke-git/lancet/blob/main/docs/slice.md#IntSlice)
--   [InterfaceSlice](https://github.com/duke-git/lancet/blob/main/docs/slice.md#InterfaceSlice)
+-   [IntSlice<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice.md#IntSlice)
+-   [InterfaceSlice<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice.md#InterfaceSlice)
 -   [Intersection](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Intersection)
 -   [InsertAt](https://github.com/duke-git/lancet/blob/main/docs/slice.md#InsertAt)
 -   [IndexOf](https://github.com/duke-git/lancet/blob/main/docs/slice.md#IndexOf)
 -   [LastIndexOf](https://github.com/duke-git/lancet/blob/main/docs/slice.md#LastIndexOf)
 -   [Map](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Map)
+-   [Merge](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Merge)
 -   [Reverse](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Reverse)
 -   [Reduce](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Reduce)
 -   [Replace](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Replace)
 -   [ReplaceAll](https://github.com/duke-git/lancet/blob/main/docs/slice.md#ReplaceAll)
+-   [Repeat](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Repeat)
 -   [Shuffle](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Shuffle)
--   [SortByField](https://github.com/duke-git/lancet/blob/main/docs/slice.md#SortByField)
+-   [Sort](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Sort)
+-   [SortBy](https://github.com/duke-git/lancet/blob/main/docs/slice.md#SortBy)
+-   [SortByField<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice.md#SortByField)
 -   [Some](https://github.com/duke-git/lancet/blob/main/docs/slice.md#Some)
--   [StringSlice](https://github.com/duke-git/lancet/blob/main/docs/slice.md#StringSlice)
+-   [StringSlice<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice.md#StringSlice)
 -   [SymmetricDifference](https://github.com/duke-git/lancet/blob/main/docs/slice.md#SymmetricDifference)
 -   [ToSlice](https://github.com/duke-git/lancet/blob/main/docs/slice.md#ToSlice)
 -   [ToSlicePointer](https://github.com/duke-git/lancet/blob/main/docs/slice.md#ToSlicePointer)

README_zh-CN.md

@@ -4,7 +4,7 @@
 <br/>
 
 ![Go version](https://img.shields.io/badge/go-%3E%3Dv1.18-9cf)
-[![Release](https://img.shields.io/badge/release-2.1.9-green.svg)](https://github.com/duke-git/lancet/releases)
+[![Release](https://img.shields.io/badge/release-2.1.11-green.svg)](https://github.com/duke-git/lancet/releases)
 [![GoDoc](https://godoc.org/github.com/duke-git/lancet/v2?status.svg)](https://pkg.go.dev/github.com/duke-git/lancet/v2)
 [![Go Report Card](https://goreportcard.com/badge/github.com/duke-git/lancet/v2)](https://goreportcard.com/report/github.com/duke-git/lancet/v2)
 [![test](https://github.com/duke-git/lancet/actions/workflows/codecov.yml/badge.svg?branch=main&event=push)](https://github.com/duke-git/lancet/actions/workflows/codecov.yml)
@@ -18,7 +18,7 @@
     lancet（柳叶刀）是一个全面、高效、可复用的go语言工具函数库。 lancet受到了java apache common包和lodash.js的启发。
 </p>
 
-简体中文 | [English](./README.md)
+简体中文 | [English](./README.md) | [文档](https://uvdream.github.io/lancet-docs)
 
 ## 特性
 
@@ -37,7 +37,7 @@
 go get github.com/duke-git/lancet/v2 //安装v2最新版本v2.x.x
 ```
 
-2. <b>使用 go1.18 以下版本的用户，必须安装 v1.x.x。目前最新的 v1 版本是 v1.3.3。</b>
+2. <b>使用 go1.18 以下版本的用户，必须安装 v1.x.x。目前最新的 v1 版本是 v1.3.4。</b>
 
 ```go
 go get github.com/duke-git/lancet@v1.3.3 // 使用go1.18以下版本, 必须安装v1.x.x版本
@@ -371,11 +371,11 @@ import "github.com/duke-git/lancet/v2/netutil"
 -   [DecodeResponse](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#DecodeResponse)
 -   [StructToUrlValues](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#StructToUrlValues)
 
--   [HttpGet<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpGet)
--   [HttpDelete<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpDelete)
--   [HttpPost<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpPost)
--   [HttpPut<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpPut)
--   [HttpPatch<sup>Deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpPatch)
+-   [HttpGet<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpGet)
+-   [HttpDelete<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpDelete)
+-   [HttpPost<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpPost)
+-   [HttpPut<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpPut)
+-   [HttpPatch<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#HttpPatch)
 -   [ParseHttpResponse](https://github.com/duke-git/lancet/blob/main/docs/netutil_zh-CN.md#ParseHttpResponse)
 
 ### 14. random 随机数生成器包，可以生成随机[]bytes, int, string。
@@ -424,6 +424,7 @@ import "github.com/duke-git/lancet/v2/slice"
 -   [Compact](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Compact)
 -   [Concat](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Concat)
 -   [Count](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Count)
+-   [CountBy](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#CountBy)
 -   [Difference](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Difference)
 -   [DifferenceBy](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#DifferenceBy)
 -   [DifferenceWith](https://github.com/duke-git/lancet/blob/main/docs/slice.md#DifferenceWith)
@@ -438,21 +439,25 @@ import "github.com/duke-git/lancet/v2/slice"
 -   [ForEach](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#ForEach)
 -   [GroupBy](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#GroupBy)
 -   [GroupWith](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#GroupWith)
--   [IntSlice](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#IntSlice)
--   [InterfaceSlice](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#InterfaceSlice)
+-   [IntSlice<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#IntSlice)
+-   [InterfaceSlice<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#InterfaceSlice)
 -   [Intersection](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Intersection)
 -   [InsertAt](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#InsertAt)
 -   [IndexOf](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#IndexOf)
 -   [LastIndexOf](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#LastIndexOf)
 -   [Map](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Map)
+-   [Merge](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Merge)
 -   [Reverse](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Reverse)
 -   [Reduce](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Reduce)
 -   [Replace](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Replace)
 -   [ReplaceAll](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#ReplaceAll)
+-   [Repeat](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Repeat)
 -   [Shuffle](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Shuffle)
--   [SortByField](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#SortByField)
+-   [Sort](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Sort)
+-   [SortBy](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#SortBy)
+-   [SortByField<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#SortByField)
 -   [Some](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#Some)
--   [StringSlice](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#StringSlice)
+-   [StringSlice<sup>deprecated</sup>](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#StringSlice)
 -   [SymmetricDifference](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#SymmetricDifference)
 -   [ToSlice](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#ToSlice)
 -   [ToSlicePointer](https://github.com/duke-git/lancet/blob/main/docs/slice_zh-CN.md#ToSlicePointer)

SECURITY.md

@@ -0,0 +1,15 @@
+# Security Policy
+
+## Supported Versions
+Here is the lancet version and compatibility with go language version.
+
+| Version | Supported         |
+| ------- | ------------------|
+| 2.x.x   | +go v1.18         |
+| 1.x.x   | +go v1.12         |
+
+
+## Reporting a Vulnerability
+
+For now, there is no public website to report a vulnerability, If you find security issue in lancet, you can send it to me via my email `lanliddd.2007@163.com`.
+we can discuss it. I am appreciate if someone can create a public page for reporting vulnerability.

convertor/convertor.go

@@ -90,34 +90,50 @@ func ToChannel[T any](array []T) <-chan T {
 }
 
 // ToString convert value to string
+// for number, string, []byte, will convert to string
+// for other type (slice, map, array, struct) will call json.Marshal
 func ToString(value any) string {
-	result := ""
 	if value == nil {
-		return result
+		return ""
 	}
 
-	v := reflect.ValueOf(value)
-
 	switch value.(type) {
-	case float32, float64:
-		result = strconv.FormatFloat(v.Float(), 'f', -1, 64)
-		return result
-	case int, int8, int16, int32, int64:
-		result = strconv.FormatInt(v.Int(), 10)
-		return result
-	case uint, uint8, uint16, uint32, uint64:
-		result = strconv.FormatUint(v.Uint(), 10)
-		return result
+	case float32:
+		return strconv.FormatFloat(float64(value.(float32)), 'f', -1, 32)
+	case float64:
+		return strconv.FormatFloat(value.(float64), 'f', -1, 64)
+	case int:
+		return strconv.FormatInt(int64(value.(int)), 10)
+	case int8:
+		return strconv.FormatInt(int64(value.(int8)), 10)
+	case int16:
+		return strconv.FormatInt(int64(value.(int16)), 10)
+	case int32:
+		return strconv.FormatInt(int64(value.(int32)), 10)
+	case int64:
+		return strconv.FormatInt(value.(int64), 10)
+	case uint:
+		return strconv.FormatUint(uint64(value.(uint)), 10)
+	case uint8:
+		return strconv.FormatUint(uint64(value.(uint8)), 10)
+	case uint16:
+		return strconv.FormatUint(uint64(value.(uint16)), 10)
+	case uint32:
+		return strconv.FormatUint(uint64(value.(uint32)), 10)
+	case uint64:
+		return strconv.FormatUint(value.(uint64), 10)
 	case string:
-		result = v.String()
-		return result
+		return value.(string)
 	case []byte:
-		result = string(v.Bytes())
-		return result
+		return string(value.([]byte))
 	default:
 		newValue, _ := json.Marshal(value)
-		result = string(newValue)
-		return result
+		return string(newValue)
+
+		// todo: maybe we should't supprt other type convertion
+		// v := reflect.ValueOf(value)
+		// log.Panicf("Unsupported data type: %s ", v.String())
+		// return ""
 	}
 }
 

convertor/convertor_test.go

@@ -137,9 +137,10 @@ func TestToString(t *testing.T) {
 		"", "",
 		"0", "1", "-1",
 		"123", "123", "123", "123", "123", "123", "123",
-		"12.3", "12.300000190734863",
+		"12.3", "12.3",
 		"true", "false",
-		"[1,2,3]", "{\"a\":1,\"b\":2,\"c\":3}", "{\"Name\":\"TestStruct\"}", "hello"}
+		"[1,2,3]", "{\"a\":1,\"b\":2,\"c\":3}", "{\"Name\":\"TestStruct\"}", "hello",
+	}
 
 	for i := 0; i < len(cases); i++ {
 		actual := ToString(cases[i])

datastructure/set/set.go

@@ -4,22 +4,59 @@ package datastructure
 type Set[T comparable] map[T]struct{}
 
 // NewSet return a instance of set
-func NewSet[T comparable](values ...T) Set[T] {
+func NewSet[T comparable](items ...T) Set[T] {
 	set := make(Set[T])
-	set.Add(values...)
+	set.Add(items...)
 	return set
 }
 
-// Add value to set
-func (s Set[T]) Add(values ...T) {
-	for _, v := range values {
+// NewSetFromSlice create a set from slice
+func NewSetFromSlice[T comparable](items []T) Set[T] {
+	set := make(Set[T])
+	for _, item := range items {
+		set.Add(item)
+	}
+	return set
+}
+
+// Add items to set
+func (s Set[T]) Add(items ...T) {
+	for _, v := range items {
 		s[v] = struct{}{}
 	}
 }
 
-// Contain checks if set contains value or not
-func (s Set[T]) Contain(value T) bool {
-	_, ok := s[value]
+// AddIfNotExist checks if item exists in the set,
+// it adds the item to set and returns true if it does not exist in the set,
+// or else it does nothing and returns false.
+func (s Set[T]) AddIfNotExist(item T) bool {
+	if !s.Contain(item) {
+		if _, ok := s[item]; !ok {
+			s[item] = struct{}{}
+			return true
+		}
+	}
+	return false
+}
+
+// AddIfNotExistBy checks if item exists in the set and pass the `checker` function
+// it adds the item to set and returns true if it does not exists in the set and
+// function `checker` returns true, or else it does nothing and returns false.
+func (s Set[T]) AddIfNotExistBy(item T, checker func(element T) bool) bool {
+	if !s.Contain(item) {
+		if checker(item) {
+			if _, ok := s[item]; !ok {
+				s[item] = struct{}{}
+				return true
+			}
+		}
+	}
+	return false
+}
+
+// Contain checks if set contains item or not
+func (s Set[T]) Contain(item T) bool {
+	_, ok := s[item]
 	return ok
 }
 
@@ -41,9 +78,9 @@ func (s Set[T]) Clone() Set[T] {
 	return set
 }
 
-// Delete value of set
-func (s Set[T]) Delete(values ...T) {
-	for _, v := range values {
+// Delete item of set
+func (s Set[T]) Delete(items ...T) {
+	for _, v := range items {
 		delete(s, v)
 	}
 }
@@ -58,7 +95,7 @@ func (s Set[T]) Equal(other Set[T]) bool {
 }
 
 // Iterate call function by every element of set
-func (s Set[T]) Iterate(fn func(value T)) {
+func (s Set[T]) Iterate(fn func(item T)) {
 	for v := range s {
 		fn(v)
 	}
@@ -76,13 +113,13 @@ func (s Set[T]) Size() int {
 
 // Values return all values of set
 func (s Set[T]) Values() []T {
-	values := make([]T, 0, 0)
+	result := make([]T, 0, len(s))
 
 	s.Iterate(func(value T) {
-		values = append(values, value)
+		result = append(result, value)
 	})
 
-	return values
+	return result
 }
 
 // Union creates a new set contain all element of set s and other

datastructure/set/set_test.go

@@ -6,6 +6,19 @@ import (
 	"github.com/duke-git/lancet/v2/internal"
 )
 
+func TestSet_NewSetFromSlice(t *testing.T) {
+	assert := internal.NewAssert(t, "TestSet_NewSetFromSlice")
+
+	s1 := NewSetFromSlice([]int{1, 2, 2, 3})
+	assert.Equal(3, s1.Size())
+	assert.Equal(true, s1.Contain(1))
+	assert.Equal(true, s1.Contain(2))
+	assert.Equal(true, s1.Contain(3))
+
+	s2 := NewSetFromSlice([]int{})
+	assert.Equal(0, s2.Size())
+}
+
 func TestSet_Add(t *testing.T) {
 	assert := internal.NewAssert(t, "TestSet_Add")
 
@@ -17,6 +30,38 @@ func TestSet_Add(t *testing.T) {
 	assert.Equal(true, set.Equal(expected))
 }
 
+func TestSet_AddIfNotExist(t *testing.T) {
+	assert := internal.NewAssert(t, "TestSet_AddIfNotExist")
+
+	set := NewSet[int]()
+	set.Add(1, 2, 3)
+
+	assert.Equal(false, set.AddIfNotExist(1))
+	assert.Equal(true, set.AddIfNotExist(4))
+	assert.Equal(NewSet(1, 2, 3, 4), set)
+}
+
+func TestSet_AddIfNotExistBy(t *testing.T) {
+	assert := internal.NewAssert(t, "TestSet_AddIfNotExistBy")
+
+	set := NewSet[int]()
+	set.Add(1, 2)
+
+	ok := set.AddIfNotExistBy(3, func(val int) bool {
+		return val%2 != 0
+	})
+
+	notOk := set.AddIfNotExistBy(4, func(val int) bool {
+		return val%2 != 0
+	})
+
+	assert.Equal(true, ok)
+	assert.Equal(false, notOk)
+
+	assert.Equal(true, set.Contain(3))
+	assert.Equal(false, set.Contain(4))
+}
+
 func TestSet_Contain(t *testing.T) {
 	assert := internal.NewAssert(t, "TestSet_Contain")
 

docs/algorithm.md

@@ -21,6 +21,7 @@ import (
 <div STYLE="page-break-after: always;"></div>
 
 ## Index
+
 - [BubbleSort](#BubbleSort)
 - [InsertionSort](#InsertionSort)
 - [SelectionSort](#SelectionSort)
@@ -31,7 +32,6 @@ import (
 - [CountSort](#CountSort)
 - [BinarySearch](#BinarySearch)
 - [BinaryIterativeSearch](#BinaryIterativeSearch)
-
 - [LinearSearch](#LinearSearch)
 - [LRUCache](#LRUCache)
 

docs/algorithm_zh-CN.md

@@ -29,7 +29,6 @@ import (
 - [QuickSort](#QuickSort)
 - [HeapSort](#HeapSort)
 - [MergeSort](#MergeSort)
-
 - [CountSort](#CountSort)
 - [BinarySearch](#BinarySearch)
 - [BinaryIterativeSearch](#BinaryIterativeSearch)

docs/convertor.md

@@ -25,7 +25,6 @@ import (
 - [ToBytes](#ToBytes)
 - [ToChar](#ToChar)
 - [ToChannel](#ToChannel)
-
 - [ToFloat](#ToFloat)
 - [ToInt](#ToInt)
 - [ToJson](#ToJson)
@@ -395,6 +394,32 @@ func main() {
 ```
 
 
+### <span id="ToString">ToString</span>
+
+<p>ToString convert value to string, for number, string, []byte, will convert to string. For other type (slice, map, array, struct) will call json.Marshal</p>
+
+<b>Signature:</b>
+
+```go
+func ToString(value any) string
+```
+<b>Example:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    "github.com/duke-git/lancet/v2/convertor"
+)
+
+func main() {
+    fmt.Printf("%q", convertor.ToString(1)) //"1"
+    fmt.Printf("%q", convertor.ToString(1.1)) //"1.1"
+    fmt.Printf("%q", convertor.ToString([]int{1, 2, 3})) //"[1,2,3]"
+}
+```
+
 
 ### <span id="StructToMap">StructToMap</span>
 

docs/convertor_zh-CN.md

@@ -27,7 +27,6 @@ import (
 - [ToBytes](#ToBytes)
 - [ToChar](#ToChar)
 - [ToChannel](#ToChannel)
-
 - [ToFloat](#ToFloat)
 - [ToInt](#ToInt)
 - [ToJson](#ToJson)
@@ -401,7 +400,7 @@ func main() {
 
 ### <span id="ToString">ToString</span>
 
-<p>将interface转成字符串</p>
+<p>将值转换为字符串，对于数字、字符串、[]byte，将转换为字符串。 对于其他类型（切片、映射、数组、结构）将调用 json.Marshal</p>
 
 <b>函数签名:</b>
 

docs/cryptor.md

@@ -47,7 +47,6 @@ import (
 - [HmacSha1](#HmacSha1)
 - [HmacSha256](#HmacSha256)
 - [HmacSha512](#HmacSha512)
-
 - [Md5String](#Md5String)
 - [Md5File](#Md5File)
 - [Sha1](#Sha1)

docs/cryptor_zh-CN.md

@@ -33,7 +33,6 @@ import (
 - [AesOfbDecrypt](#AesOfbDecrypt)
 - [Base64StdEncode](#Base64StdEncode)
 - [Base64StdDecode](#Base64StdDecode)
-
 - [DesEcbEncrypt](#DesEcbEncrypt)
 - [DesEcbDecrypt](#DesEcbDecrypt)
 - [DesCbcEncrypt](#DesCbcEncrypt)
@@ -43,7 +42,6 @@ import (
 - [DesCfbDecrypt](#DesCfbDecrypt)
 - [DesOfbEncrypt](#DesOfbEncrypt)
 - [DesOfbDecrypt](#DesOfbDecrypt)
-
 - [HmacMd5](#HmacMd5)
 - [HmacSha1](#HmacSha1)
 - [HmacSha256](#HmacSha256)

docs/datastructure/set.md

@@ -22,8 +22,11 @@ import (
 ## Index
 
 - [NewSet](#NewSet)
+- [NewSetFromSlice](#NewSetFromSlice)
 - [Values](#Values)
 - [Add](#Add)
+- [AddIfNotExist](#AddIfNotExist)
+- [AddIfNotExistBy](#AddIfNotExistBy)
 - [Delete](#Delete)
 - [Contain](#Contain)
 - [ContainAll](#ContainAll)
@@ -34,7 +37,6 @@ import (
 - [IsEmpty](#IsEmpty)
 - [Union](#Union)
 - [Intersection](#Intersection)
-
 - [SymmetricDifference](#SymmetricDifference)
 - [Minus](#Minus)
 
@@ -45,13 +47,13 @@ import (
 ## Documentation
 
 ### <span id="NewSet">NewSet</span>
-<p>Make a Set instance</p>
+<p>Create a set instance</p>
 
 <b>Signature:</b>
 
 ```go
 type Set[T comparable] map[T]bool
-func NewSet[T comparable](values ...T) Set[T]
+func NewSet[T comparable](items ...T) Set[T]
 ```
 <b>Example:</b>
 
@@ -70,6 +72,30 @@ func main() {
 ```
 
 
+### <span id="NewSetFromSlice">NewSetFromSlice</span>
+<p>Create a set from slice</p>
+
+<b>Signature:</b>
+
+```go
+func NewSetFromSlice[T comparable](items []T) Set[T]
+```
+<b>Example:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    set "github.com/duke-git/lancet/v2/datastructure/set"
+)
+
+func main() {
+    st := set.NewSetFromSlice([]int{1, 2, 2, 3})
+    fmt.Println(st.Values()) //1,2,3
+}
+```
+
 
 
 ### <span id="Values">Values</span>
@@ -100,12 +126,12 @@ func main() {
 
 
 ### <span id="Add">Add</span>
-<p>Add value to set</p>
+<p>Add items to set</p>
 
 <b>Signature:</b>
 
 ```go
-func (s Set[T]) Add(values ...T)
+func (s Set[T]) Add(items ...T)
 ```
 <b>Example:</b>
 
@@ -126,14 +152,83 @@ func main() {
 ```
 
 
-
-### <span id="Delete">Delete</span>
-<p>Delete value in set</p>
+### <span id="AddIfNotExist">AddIfNotExist</span>
+<p>AddIfNotExist checks if item exists in the set, it adds the item to set and returns true if it does not exist in the set, or else it does nothing and returns false.</p>
 
 <b>Signature:</b>
 
 ```go
-func (s Set[T]) Delete(values ...T)
+func (s Set[T]) AddIfNotExist(item T) bool
+```
+<b>Example:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    set "github.com/duke-git/lancet/v2/datastructure/set"
+)
+
+func main() {
+    st := set.NewSet[int]()
+    st.Add(1, 2, 3)
+
+    r1 := st.AddIfNotExist(1)
+	r2 := st.AddIfNotExist(4)
+
+    fmt.Println(r1) // false
+    fmt.Println(r2) // true
+    fmt.Println(st.Values()) // 1,2,3,4
+}
+```
+
+
+### <span id="AddIfNotExistBy">AddIfNotExistBy</span>
+<p>AddIfNotExistBy checks if item exists in the set and pass the `checker` function it adds the item to set and returns true if it does not exists in the set and function `checker` returns true, or else it does nothing and returns false.</p>
+
+<b>Signature:</b>
+
+```go
+func (s Set[T]) AddIfNotExistBy(item T, checker func(element T) bool) bool
+```
+<b>Example:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    set "github.com/duke-git/lancet/v2/datastructure/set"
+)
+
+func main() {
+    st := set.NewSet[int]()
+    st.Add(1, 2)
+
+	ok := st.AddIfNotExistBy(3, func(val int) bool {
+		return val%2 != 0
+	})
+    fmt.Println(ok) // true
+
+
+	notOk := st.AddIfNotExistBy(4, func(val int) bool {
+		return val%2 != 0
+	})
+    fmt.Println(notOk) // false
+    
+    fmt.Println(st.Values()) // 1, 2, 3
+}
+```
+
+
+### <span id="Delete">Delete</span>
+<p>Delete item in set</p>
+
+<b>Signature:</b>
+
+```go
+func (s Set[T]) Delete(items ...T)
 ```
 <b>Example:</b>
 
@@ -157,12 +252,12 @@ func main() {
 
 
 ### <span id="Contain">Contain</span>
-<p>Check if value is in set or not</p>
+<p>Check if item is in set or not</p>
 
 <b>Signature:</b>
 
 ```go
-func (s Set[T]) Contain(value T) bool
+func (s Set[T]) Contain(item T) bool
 ```
 <b>Example:</b>
 
@@ -309,7 +404,7 @@ func main() {
 <b>Signature:</b>
 
 ```go
-func (s Set[T]) Iterate(fn func(value T))
+func (s Set[T]) Iterate(fn func(item T))
 ```
 <b>Example:</b>
 
@@ -324,8 +419,8 @@ import (
 func main() {
     set1 := set.NewSet(1, 2, 3)
     arr := []int{}
-    set.Iterate(func(value int) {
-        arr = append(arr, value)
+    set.Iterate(func(item int) {
+        arr = append(arr, item)
     })
 
     fmt.Println(arr) //1,2,3

docs/datastructure/set_zh-CN.md

@@ -22,8 +22,11 @@ import (
 ## 目录
 
 - [NewSet](#NewSet)
+- [NewSetFromSlice](#NewSetFromSlice)
 - [Values](#Values)
 - [Add](#Add)
+- [AddIfNotExist](#AddIfNotExist)
+- [AddIfNotExistBy](#AddIfNotExistBy)
 - [Delete](#Delete)
 - [Contain](#Contain)
 - [ContainAll](#ContainAll)
@@ -34,7 +37,6 @@ import (
 - [IsEmpty](#IsEmpty)
 - [Union](#Union)
 - [Intersection](#Intersection)
-
 - [SymmetricDifference](#SymmetricDifference)
 - [Minus](#Minus)
 
@@ -51,7 +53,7 @@ import (
 
 ```go
 type Set[T comparable] map[T]bool
-func NewSet[T comparable](values ...T) Set[T]
+func NewSet[T comparable](items ...T) Set[T]
 ```
 <b>例子:</b>
 
@@ -71,6 +73,31 @@ func main() {
 
 
 
+### <span id="NewSetFromSlice">NewSetFromSlice</span>
+<p>基于切片创建集合</p>
+
+<b>函数签名:</b>
+
+```go
+func NewSetFromSlice[T comparable](items []T) Set[T]
+```
+<b>例子:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    set "github.com/duke-git/lancet/v2/datastructure/set"
+)
+
+func main() {
+    st := set.NewSetFromSlice([]int{1, 2, 2, 3})
+    fmt.Println(st.Values()) //1,2,3
+}
+```
+
+
 
 ### <span id="Values">Values</span>
 <p>获取集合中所有元素的切片</p>
@@ -105,7 +132,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func (s Set[T]) Add(values ...T)
+func (s Set[T]) Add(items ...T)
 ```
 <b>例子:</b>
 
@@ -126,6 +153,76 @@ func main() {
 ```
 
 
+### <span id="AddIfNotExist">AddIfNotExist</span>
+<p>如果集合中不存在元素，则添加该元素返回true, 如果集合中存在元素, 不做任何操作，返回false</p>
+
+<b>函数签名:</b>
+
+```go
+func (s Set[T]) AddIfNotExist(item T) bool
+```
+<b>例子:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    set "github.com/duke-git/lancet/v2/datastructure/set"
+)
+
+func main() {
+    st := set.NewSet[int]()
+    st.Add(1, 2, 3)
+
+    r1 := st.AddIfNotExist(1)
+	r2 := st.AddIfNotExist(4)
+
+    fmt.Println(r1) // false
+    fmt.Println(r2) // true
+    fmt.Println(st.Values()) // 1,2,3,4
+}
+```
+
+
+### <span id="AddIfNotExistBy">AddIfNotExistBy</span>
+<p>根据checker函数判断元素是否在集合中，如果集合中不存在元素且checker返回true，则添加该元素返回true, 否则不做任何操作，返回false</p>
+
+<b>函数签名:</b>
+
+```go
+func (s Set[T]) AddIfNotExistBy(item T, checker func(element T) bool) bool
+```
+<b>例子:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    set "github.com/duke-git/lancet/v2/datastructure/set"
+)
+
+func main() {
+    st := set.NewSet[int]()
+    st.Add(1, 2)
+
+	ok := st.AddIfNotExistBy(3, func(val int) bool {
+		return val%2 != 0
+	})
+    fmt.Println(ok) // true
+
+
+	notOk := st.AddIfNotExistBy(4, func(val int) bool {
+		return val%2 != 0
+	})
+    fmt.Println(notOk) // false
+    
+    fmt.Println(st.Values()) // 1, 2, 3
+}
+```
+
+
 
 ### <span id="Delete">Delete</span>
 <p>删除集合中元素</p>
@@ -133,7 +230,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func (s Set[T]) Delete(values ...T)
+func (s Set[T]) Delete(items ...T)
 ```
 <b>例子:</b>
 
@@ -162,7 +259,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func (s Set[T]) Contain(value T) bool
+func (s Set[T]) Contain(item T) bool
 ```
 <b>例子:</b>
 
@@ -309,7 +406,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func (s Set[T]) Iterate(fn func(value T))
+func (s Set[T]) Iterate(fn func(item T))
 ```
 <b>例子:</b>
 
@@ -324,8 +421,8 @@ import (
 func main() {
     set1 := set.NewSet(1, 2, 3)
     arr := []int{}
-    set.Iterate(func(value int) {
-        arr = append(arr, value)
+    set.Iterate(func(item int) {
+        arr = append(arr, item)
     })
 
     fmt.Println(arr) //1,2,3
@@ -420,9 +517,6 @@ func main() {
 ```
 
 
-
-
-
 ### <span id="SymmetricDifference">SymmetricDifference</span>
 <p>返回一个集合，其中元素在第一个集合或第二个集合中，且不同时存在于两个集合中</p>
 

docs/datastructure/tree.md

@@ -29,7 +29,6 @@ import (
 - [PreOrderTraverse](#BSTree_PreOrderTraverse)
 - [InOrderTraverse](#BSTree_InOrderTraverse)
 - [PostOrderTraverse](#BSTree_PostOrderTraverse)
-  
 - [LevelOrderTraverse](#BSTree_LevelOrderTraverse)
 - [Depth](#BSTree_Depth)
 - [HasSubTree](#BSTree_HasSubTree)

docs/datastructure/tree_zh-CN.md

@@ -29,7 +29,6 @@ import (
 - [PreOrderTraverse](#BSTree_PreOrderTraverse)
 - [InOrderTraverse](#BSTree_InOrderTraverse)
 - [PostOrderTraverse](#BSTree_PostOrderTraverse)
-  
 - [LevelOrderTraverse](#BSTree_LevelOrderTraverse)
 - [Depth](#BSTree_Depth)
 - [HasSubTree](#BSTree_HasSubTree)

docs/datetime.md

@@ -42,7 +42,6 @@ import (
 - [GetNightTimestamp](#GetNightTimestamp)
 - [FormatTimeToStr](#FormatTimeToStr)
 - [FormatStrToTime](#FormatStrToTime)
-
 - [NewUnixNow](#NewUnixNow)
 - [NewUnix](#NewUnix)
 - [NewFormat](#NewFormat)

docs/datetime_zh-CN.md

@@ -41,7 +41,6 @@ import (
 - [GetNightTimestamp](#GetNightTimestamp)
 - [FormatTimeToStr](#FormatTimeToStr)
 - [FormatStrToTime](#FormatStrToTime)
-
 - [NewUnixNow](#NewUnixNow)
 - [NewUnix](#NewUnix)
 - [NewFormat](#NewFormat)

docs/fileutil.md

@@ -28,7 +28,6 @@ import (
 - [IsExist](#IsExist)
 - [IsLink](#IsLink)
 - [IsDir](#IsDir)
-
 - [ListFileNames](#ListFileNames)
 - [RemoveFile](#RemoveFile)
 - [ReadFileToString](#ReadFileToString)

docs/fileutil_zh-CN.md

@@ -28,7 +28,6 @@ import (
 - [IsExist](#IsExist)
 - [IsLink](#IsLink)
 - [IsDir](#IsDir)
-
 - [ListFileNames](#ListFileNames)
 - [RemoveFile](#RemoveFile)
 - [ReadFileToString](#ReadFileToString)

docs/mathutil.md

@@ -28,7 +28,6 @@ import (
 - [MaxBy](#MaxBy)
 - [Min](#Min)
 - [MinBy](#MaxBy)
-
 - [Percent](#Percent)
 - [RoundToFloat](#RoundToFloat)
 - [RoundToString](#RoundToString)

docs/mathutil_zh-CN.md

@@ -28,7 +28,6 @@ import (
 - [MaxBy](#MaxBy)
 - [Min](#Min)
 - [MinBy](#MaxBy)
-  
 - [Percent](#Percent)
 - [RoundToFloat](#RoundToFloat)
 - [RoundToString](#RoundToString)

docs/netutil.md

@@ -25,7 +25,6 @@ import (
 ## Index
 - [ConvertMapToQueryString](#ConvertMapToQueryString)
 - [EncodeUrl](#EncodeUrl)
-  
 - [GetInternalIp](#GetInternalIp)
 - [GetIps](#GetIps)
 - [GetMacAddrs](#GetMacAddrs)
@@ -38,7 +37,6 @@ import (
 - [SendRequest](#SendRequest)
 - [DecodeResponse](#DecodeResponse)
 - [StructToUrlValues](#StructToUrlValues)
-
 - [HttpGet<sup>Deprecated</sup>](#HttpGet)
 - [HttpDelete<sup>Deprecated</sup>](#HttpDelete)
 - [HttpPost<sup>Deprecated</sup>](#HttpPost)

docs/netutil_zh-CN.md

@@ -30,7 +30,6 @@ import (
 - [GetMacAddrs](#GetMacAddrs)
 - [GetPublicIpInfo](#GetPublicIpInfo)
 - [GetRequestPublicIp](#GetRequestPublicIp)
-
 - [IsPublicIP](#IsPublicIP)
 - [IsInternalIP](#IsInternalIP)
 - [HttpRequest](#HttpRequest)
@@ -38,13 +37,11 @@ import (
 - [SendRequest](#SendRequest)
 - [DecodeResponse](#DecodeResponse)
 - [StructToUrlValues](#StructToUrlValues)
-
 - [HttpGet<sup>Deprecated</sup>](#HttpGet)
 - [HttpDelete<sup>Deprecated</sup>](#HttpDelete)
 - [HttpPost<sup>Deprecated</sup>](#HttpPost)
 - [HttpPut<sup>Deprecated</sup>](#HttpPut)
 - [HttpPatch<sup>Deprecated</sup>](#HttpPatch)
-
 - [ParseHttpResponse](#ParseHttpResponse)
 
 <div STYLE="page-break-after: always;"></div>

docs/random.md

@@ -26,7 +26,6 @@ import (
 -   [RandInt](#RandInt)
 -   [RandString](#RandString)
 -   [RandUpper](#RandUpper)
-
 -   [RandLower](#RandLower)
 -   [RandNumeral](#RandNumeral)
 -   [RandNumeralOrLetter](#RandNumeralOrLetter)

docs/random_zh-CN.md

@@ -26,7 +26,6 @@ import (
 -   [RandInt](#RandInt)
 -   [RandString](#RandString)
 -   [RandUpper](#RandUpper)
-
 -   [RandLower](#RandLower)
 -   [RandNumeral](#RandNumeral)
 -   [RandNumeralOrLetter](#RandNumeralOrLetter)

docs/slice.md

@@ -29,6 +29,7 @@ import (
 -   [Compact](#Compact)
 -   [Concat](#Concat)
 -   [Count](#Count)
+-   [CountBy](#CountBy)
 -   [Difference](#Difference)
 -   [DifferenceBy](#DifferenceBy)
 -   [DifferenceWith](#DifferenceWith)
@@ -43,24 +44,27 @@ import (
 -   [Flatten](#Flatten)
 -   [FlattenDeep](#FlattenDeep)
 -   [ForEach](#ForEach)
-
 -   [GroupBy](#GroupBy)
 -   [GroupWith](#GroupWith)
--   [IntSlice](#IntSlice)
--   [InterfaceSlice](#InterfaceSlice)
+-   [IntSlice<sup>deprecated</sup>](#IntSlice)
+-   [InterfaceSlice<sup>deprecated</sup>](#InterfaceSlice)
 -   [Intersection](#Intersection)
 -   [InsertAt](#InsertAt)
 -   [IndexOf](#IndexOf)
 -   [LastIndexOf](#LastIndexOf)
 -   [Map](#Map)
+-   [Merge](#Merge)
 -   [Reverse](#Reverse)
 -   [Reduce](#Reduce)
 -   [Replace](#Replace)
 -   [ReplaceAll](#ReplaceAll)
+-   [Repeat](#Repeat)
 -   [Shuffle](#Shuffle)
--   [SortByField](#SortByField)
+-   [Sort](#Sort)
+-   [SortBy](#SortBy)
+-   [SortByField<sup>deprecated</sup>](#SortByField)
 -   [Some](#Some)
--   [StringSlice](#StringSlice)
+-   [StringSlice<sup>deprecated</sup>](#StringSlice)
 -   [SymmetricDifference](#SymmetricDifference)
 -   [ToSlice](#ToSlice)
 -   [ToSlicePointer](#ToSlicePointer)
@@ -78,12 +82,12 @@ import (
 
 ### <span id="AppendIfAbsent">AppendIfAbsent</span>
 
-<p>If slice doesn't contain the value, append it to the slice.</p>
+<p>If slice doesn't contain the item, append it to the slice.</p>
 
 <b>Signature:</b>
 
 ```go
-func AppendIfAbsent[T comparable](slice []T, value T) []T
+func AppendIfAbsent[T comparable](slice []T, item T) []T
 ```
 
 <b>Example:</b>
@@ -106,12 +110,12 @@ func main() {
 
 ### <span id="Contain">Contain</span>
 
-<p>Check if the value is in the slice or not.</p>
+<p>Check if the target value is in the slice or not.</p>
 
 <b>Signature:</b>
 
 ```go
-func Contain[T comparable](slice []T, value T) bool
+func Contain[T comparable](slice []T, target T) bool
 ```
 
 <b>Example:</b>
@@ -135,7 +139,7 @@ func main() {
 <b>Signature:</b>
 
 ```go
-func ContainSubSlice[T comparable](slice, subslice []T) bool
+func ContainSubSlice[T comparable](slice, subSlice []T) bool
 ```
 
 <b>Example:</b>
@@ -172,8 +176,8 @@ import (
 
 func main() {
 	arr := []string{"a", "b", "c", "d", "e"}
-	res := slice.Chunk(InterfaceSlice(arr), 3)
-	fmt.Println(res) //[][]any{{"a", "b", "c"}, {"d", "e"}}
+	res := slice.Chunk((arr), 3)
+	fmt.Println(res) //[][]string{{"a", "b", "c"}, {"d", "e"}}
 }
 ```
 
@@ -184,7 +188,7 @@ func main() {
 <b>Signature:</b>
 
 ```go
-func Compact[T any](slice []T) []T
+func Compact[T comparable](slice []T) []T
 ```
 
 <b>Example:</b>
@@ -203,12 +207,12 @@ func main() {
 
 ### <span id="Concat">Concat</span>
 
-<p>Creates a new slice concatenating slice with any additional slices and/or values.</p>
+<p>Creates a new slice concatenating slice with any additional slices.</p>
 
 <b>Signature:</b>
 
 ```go
-func Concat[T any](slice []T, values ...[]T) []T
+func Concat[T any](slice []T, slices ...[]T) []T
 ```
 
 <b>Example:</b>
@@ -230,12 +234,38 @@ func main() {
 
 ### <span id="Count">Count</span>
 
-<p>Count iterates over elements of slice, returns a count of all matched elements.</p>
+<p>Returns the number of occurrences of the given item in the slice.</p>
 
 <b>Signature:</b>
 
 ```go
-func Count[T any](slice []T, predicate func(index int, t T) bool) int
+func Count[T comparable](slice []T, item T) int
+```
+
+<b>Example:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	nums := []int{1, 2, 3, 3, 4, 5}
+
+	fmt.Println(slice.Count(nums, 1)) //1
+	fmt.Println(slice.Count(nums, 3)) //2
+}
+```
+
+### <span id="CountBy">CountBy</span>
+
+<p>Iterates over elements of slice with predicate function, returns the number of all matched elements.</p>
+
+<b>Signature:</b>
+
+```go
+func CountBy[T any](slice []T, predicate func(index int, item T) bool) int
 ```
 
 <b>Example:</b>
@@ -248,15 +278,16 @@ import (
 
 func main() {
 	nums := []int{1, 2, 3, 4, 5, 6}
-	evenFunc := func(i, num int) bool {
+	evenFunc := func(_, num int) bool {
 		return (num % 2) == 0
 	}
 
-	res := slice.Count(nums, evenFunc)
+	res := slice.CountBy(nums, evenFunc)
 	fmt.Println(res) //3
 }
 ```
 
+
 ### <span id="Difference">Difference</span>
 
 <p>Creates an slice of whose element not included in the other given slice.</p>
@@ -715,11 +746,12 @@ func main() {
 		return math.Floor(num)
 	}
 	res := slice.GroupWith(nums, floor)
+	
 	fmt.Println(res) //map[float64][]float64{ 4: {4.2}, 6: {6.1, 6.3},}
 }
 ```
 
-### <span id="IntSlice">IntSlice</span>
+### <span id="IntSlice">IntSlice (Deprecated: use generic feature of go1.18+ for replacement)</span>
 
 <p>Convert interface slice to int slice.</p>
 
@@ -744,7 +776,7 @@ func main() {
 }
 ```
 
-### <span id="InterfaceSlice">InterfaceSlice</span>
+### <span id="InterfaceSlice">InterfaceSlice (Deprecated: use generic feature of go1.18+ for replacement)</span>
 
 <p>Convert value to interface slice.</p>
 
@@ -827,12 +859,12 @@ func main() {
 
 ### <span id="IndexOf">IndexOf</span>
 
-<p>Returns the index at which the first occurrence of a value is found in a slice or return -1 if the value cannot be found.</p>
+<p>Returns the index at which the first occurrence of a item is found in a slice or return -1 if the item cannot be found.</p>
 
 <b>Signature:</b>
 
 ```go
-func IndexOf[T comparable](slice []T, value T) int
+func IndexOf[T comparable](slice []T, item T) int
 ```
 
 <b>Example:</b>
@@ -855,12 +887,12 @@ func main() {
 
 ### <span id="LastIndexOf">LastIndexOf</span>
 
-<p>Returns the index at which the last occurrence of a value is found in a slice or return -1 if the value cannot be found.</p>
+<p>Returns the index at which the last occurrence of a item is found in a slice or return -1 if the item cannot be found.</p>
 
 <b>Signature:</b>
 
 ```go
-func LastIndexOf[T comparable](slice []T, value T) int
+func LastIndexOf[T comparable](slice []T, item T) int
 ```
 
 <b>Example:</b>
@@ -909,6 +941,36 @@ func main() {
 }
 ```
 
+
+### <span id="Merge">Merge</span>
+
+<p>Merge all given slices into one slice.</p>
+
+<b>Signature:</b>
+
+```go
+func Merge[T any](slices ...[]T) []T
+```
+
+<b>Example:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	s1 := []int{1, 2, 3}
+	s2 := []int{2, 4}
+	res := slice.Merge(s1, s2)
+
+	fmt.Println(res) //[]int{1, 2, 3, 2, 4}
+}
+```
+
+
+
 ### <span id="Reverse">Reverse</span>
 
 <p>Reverse the elements order in slice.</p>
@@ -1018,6 +1080,31 @@ func main() {
 }
 ```
 
+
+### <span id="Repeat">Repeat</span>
+
+<p>Creates a slice with length n whose elements are passed param item.</p>
+
+<b>Signature:</b>
+
+```go
+func Repeat[T any](item T, n int) []T
+```
+
+<b>Example:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	fmt.Println(slice.Repeat("a", 3)) //[]string{"a", "a", "a"}
+}
+```
+
+
 ### <span id="Shuffle">Shuffle</span>
 
 <p>Creates an slice of shuffled values.</p>
@@ -1043,7 +1130,94 @@ func main() {
 }
 ```
 
-### <span id="SortByField">SortByField</span>
+### <span id="Sort">Sort</span>
+
+<p>Sorts a slice of any ordered type(number or string), use quick sort algrithm. Default sort order is ascending (asc), if want descending order, set param `sortOrder` to `desc`. Ordered type: number(all ints uints floats) or string.
+</p>
+
+<b>Signature:</b>
+
+```go
+func Sort[T lancetconstraints.Ordered](slice []T, sortOrder ...string)
+```
+
+<b>Example:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	numbers := []int{1, 4, 3, 2, 5}
+	
+	slice.Sort(numbers)
+	fmt.Println(numbers) //{1,2,3,4,5}
+
+	slice.Sort(numbers, "desc")
+	fmt.Println(numbers) //{5,4,3,2,1}
+
+	strings := []string{"a", "d", "c", "b", "e"}
+
+	slice.Sort(strings)
+	fmt.Println(strings) //{"a", "b", "c", "d", "e"}
+
+	slice.Sort(strings, "desc")
+	fmt.Println(strings) //{"e", "d", "c", "b", "a"}
+}
+```
+
+
+### <span id="SortBy">SortBy</span>
+
+<p>Sorts the slice in ascending order as determined by the less function. This sort is not guaranteed to be stable.<p>
+
+<b>Signature:</b>
+
+```go
+func SortBy[T any](slice []T, less func(a, b T) bool)
+```
+
+<b>Example:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	numbers := []int{1, 4, 3, 2, 5}
+
+	slice.SortBy(numbers, func(a, b int) bool {
+		return a < b
+	})
+	fmt.Println(numbers) //{1, 2, 3, 4, 5}
+
+	type User struct {
+		Name string
+		Age  uint
+	}
+
+	users := []User{
+		{Name: "a", Age: 21},
+		{Name: "b", Age: 15},
+		{Name: "c", Age: 100}}
+
+	slice.SortBy(users, func(a, b User) bool {
+		return a.Age < b.Age
+	})
+
+	fmt.Printf("sort users by age: %v", users) 
+
+	// output
+	// [{b 15} {a 21} {c 100}]
+}
+```
+
+
+### <span id="SortByField">SortByField (Deprecated: use Sort and SortBy for replacement)</span>
 
 <p>Sort struct slice by field. Slice element should be struct, field type should be int, uint, string, or bool. Default sort type is ascending (asc), if descending order, set sortType to desc</p>
 
@@ -1115,7 +1289,7 @@ func main() {
 }
 ```
 
-### <span id="StringSlice">StringSlice</span>
+### <span id="StringSlice">StringSlice (Deprecated: use generic feature of go1.18+ for replacement)</span>
 
 <p>Convert interface slice to string slice.</p>
 
@@ -1171,12 +1345,12 @@ func main() {
 
 ### <span id="ToSlice">ToSlice</span>
 
-<p>Returns a slices of a variable parameter transformation</p>
+<p>Creates a slice of give items.</p>
 
 <b>Signature:</b>
 
 ```go
-func ToSlice[T any](value ...T) []T
+func ToSlice[T any](items ...T) []T
 ```
 
 <b>Example:</b>
@@ -1200,7 +1374,7 @@ func main() {
 <b>Signature:</b>
 
 ```go
-func ToSlicePointer[T any](value ...T) []*T
+func ToSlicePointer[T any](items ...T) []*T
 ```
 
 <b>Example:</b>
@@ -1351,12 +1525,12 @@ func main() {
 
 ### <span id="Without">Without</span>
 
-<p>Creates a slice excluding all given values. </p>
+<p>Creates a slice excluding all given items. </p>
 
 <b>Signature:</b>
 
 ```go
-func Without[T comparable](slice []T, values ...T) []T
+func Without[T comparable](slice []T, items ...T) []T
 ```
 
 <b>Example:</b>

docs/slice_zh-CN.md

@@ -20,8 +20,10 @@ import (
 
 <div STYLE="page-break-after: always;"></div>
 
+
 ## 目录
 
+
 -   [AppendIfAbsent](#AppendIfAbsent)
 -   [Contain](#Contain)
 -   [ContainSubSlice](#ContainSubSlice)
@@ -29,6 +31,7 @@ import (
 -   [Compact](#Compact)
 -   [Concat](#Concat)
 -   [Count](#Count)
+-   [CountBy](#CountBy)
 -   [Difference](#Difference)
 -   [DifferenceBy](#DifferenceBy)
 -   [DifferenceWith](#DifferenceWith)
@@ -45,22 +48,25 @@ import (
 -   [ForEach](#ForEach)
 -   [GroupBy](#GroupBy)
 -   [GroupWith](#GroupWith)
--   [IntSlice](#IntSlice)
-
--   [InterfaceSlice](#InterfaceSlice)
+-   [IntSlice<sup>deprecated</sup>](#IntSlice)
+-   [InterfaceSlice<sup>deprecated</sup>](#InterfaceSlice)
 -   [Intersection](#Intersection)
 -   [InsertAt](#InsertAt)
 -   [IndexOf](#IndexOf)
 -   [LastIndexOf](#LastIndexOf)
 -   [Map](#Map)
+-   [Merge](#Merge)
 -   [Reverse](#Reverse)
 -   [Reduce](#Reduce)
 -   [Replace](#Replace)
 -   [ReplaceAll](#ReplaceAll)
+-   [Repeat](#Repeat)
 -   [Shuffle](#Shuffle)
--   [SortByField](#SortByField)
+-   [Sort](#Sort)
+-   [SortBy](#SortBy)
+-   [SortByField<sup>deprecated</sup>](#SortByField)
 -   [Some](#Some)
--   [StringSlice](#StringSlice)
+-   [StringSlice<sup>deprecated</sup>](#StringSlice)
 -   [SymmetricDifference](#SymmetricDifference)
 -   [ToSlice](#ToSlice)
 -   [ToSlicePointer](#ToSlicePointer)
@@ -72,6 +78,7 @@ import (
 -   [Without](#Without)
 -   [KeyBy](#KeyBy)
 
+
 <div STYLE="page-break-after: always;"></div>
 
 ## 文档
@@ -83,7 +90,7 @@ import (
 <b>函数签名:</b>
 
 ```go
-func AppendIfAbsent[T comparable](slice []T, value T) []T
+func AppendIfAbsent[T comparable](slice []T, item T) []T
 ```
 
 <b>例子:</b>
@@ -111,7 +118,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func Contain[T comparable](slice []T, value T) bool
+func Contain[T comparable](slice []T, target T) bool
 ```
 
 <b>例子:</b>
@@ -135,7 +142,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func ContainSubSlice[T comparable](slice, subslice []T) bool
+func ContainSubSlice[T comparable](slice, subSlice []T) bool
 ```
 
 <b>例子:</b>
@@ -172,8 +179,8 @@ import (
 
 func main() {
 	arr := []string{"a", "b", "c", "d", "e"}
-	res := slice.Chunk(InterfaceSlice(arr), 3)
-	fmt.Println(res) //[][]any{{"a", "b", "c"}, {"d", "e"}}
+	res := slice.Chunk(arr, 3)
+	fmt.Println(res) //[][]string{{"a", "b", "c"}, {"d", "e"}}
 }
 ```
 
@@ -184,7 +191,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func Compact[T any](slice []T) []T
+func Compact[T comparable](slice []T) []T
 ```
 
 <b>例子:</b>
@@ -203,12 +210,12 @@ func main() {
 
 ### <span id="Concat">Concat</span>
 
-<p>连接values到slice中，values类型可以是切片或多个值</p>
+<p>合并多个slices到slice中</p>
 
 <b>函数签名:</b>
 
 ```go
-func Concat[T any](slice []T, values ...[]T) []T
+func Concat[T any](slice []T, slices ...[]T) []T
 ```
 
 <b>例子:</b>
@@ -230,12 +237,38 @@ func main() {
 
 ### <span id="Count">Count</span>
 
-<p>遍历切片，对每个元素执行函数function. 返回符合函数返回值为true的元素的个数</p>
+<p>返回切片中指定元素的个数</p>
 
 <b>函数签名:</b>
 
 ```go
-func Count[T any](slice []T, predicate func(index int, t T) bool) int
+func Count[T comparable](slice []T, item T) int
+```
+
+<b>例子:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	nums := []int{1, 2, 3, 3, 4, 5}
+
+	fmt.Println(slice.Count(nums, 1)) //1
+	fmt.Println(slice.Count(nums, 3)) //2
+}
+```
+
+### <span id="CountBy">CountBy</span>
+
+<p>遍历切片，对每个元素执行函数predicate. 返回符合函数返回值为true的元素的个数.</p>
+
+<b>函数签名:</b>
+
+```go
+func CountBy[T any](slice []T, predicate func(index int, item T) bool) int
 ```
 
 <b>例子:</b>
@@ -248,11 +281,11 @@ import (
 
 func main() {
 	nums := []int{1, 2, 3, 4, 5, 6}
-	evenFunc := func(i, num int) bool {
+	evenFunc := func(_, num int) bool {
 		return (num % 2) == 0
 	}
 
-	res := slice.Count(nums, evenFunc)
+	res := slice.CountBy(nums, evenFunc)
 	fmt.Println(res) //3
 }
 ```
@@ -719,7 +752,7 @@ func main() {
 }
 ```
 
-### <span id="IntSlice">IntSlice</span>
+### <span id="IntSlice">IntSlice (已弃用: 使用go1.18+泛型代替)</span>
 
 <p>将接口切片转换为int切片</p>
 
@@ -744,7 +777,7 @@ func main() {
 }
 ```
 
-### <span id="InterfaceSlice">InterfaceSlice</span>
+### <span id="InterfaceSlice">InterfaceSlice(已弃用: 使用go1.18+泛型代替)</span>
 
 <p>将值转换为接口切片</p>
 
@@ -832,7 +865,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func IndexOf[T comparable](slice []T, value T) int
+func IndexOf[T comparable](slice []T, item T) int
 ```
 
 <b>例子:</b>
@@ -860,7 +893,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func LastIndexOf[T comparable](slice []T, value T) int
+func LastIndexOf[T comparable](slice []T, item T) int
 ```
 
 <b>例子:</b>
@@ -883,7 +916,7 @@ func main() {
 
 ### <span id="Map">Map</span>
 
-<p>通过运行函数slice中的每个元素来创建一个新切片</p>
+<p>对slice中的每个元素执行map函数以创建一个新切片</p>
 
 <b>函数签名:</b>
 
@@ -909,6 +942,34 @@ func main() {
 }
 ```
 
+### <span id="Merge">Merge</span>
+
+<p>合并多个切片（不会消除重复元素).</p>
+
+<b>函数签名:</b>
+
+```go
+func Merge[T any](slices ...[]T) []T
+```
+
+<b>例子:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	s1 := []int{1, 2, 3}
+	s2 := []int{2, 4}
+	res := slice.Merge(s1, s2)
+
+	fmt.Println(res) //[]int{1, 2, 3, 2, 4}
+}
+```
+
+
 ### <span id="Reverse">Reverse</span>
 
 <p>反转切片中的元素顺序</p>
@@ -1018,6 +1079,30 @@ func main() {
 }
 ```
 
+### <span id="Repeat">Repeat</span>
+
+<p>创建一个切片，包含n个传入的item</p>
+
+<b>函数签名:</b>
+
+```go
+func Repeat[T any](item T, n int) []T
+```
+
+<b>例子:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	fmt.Println(slice.Repeat("a", 3)) //[]string{"a", "a", "a"}
+}
+```
+
+
 ### <span id="Shuffle">Shuffle</span>
 
 <p>随机打乱切片中的元素顺序</p>
@@ -1043,7 +1128,93 @@ func main() {
 }
 ```
 
-### <span id="SortByField">SortByField</span>
+### <span id="Sort">Sort</span>
+
+<p>对任何有序类型（数字或字符串）的切片进行排序，使用快速排序算法。 默认排序顺序为升序 (asc)，如果需要降序，请将参数 `sortOrder` 设置为 `desc`。 Ordered类型：数字（所有整数浮点数）或字符串。</p>
+
+<b>函数签名:</b>
+
+```go
+func Sort[T lancetconstraints.Ordered](slice []T, sortOrder ...string)
+```
+
+<b>例子:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	numbers := []int{1, 4, 3, 2, 5}
+	
+	slice.Sort(numbers)
+	fmt.Println(numbers) //{1,2,3,4,5}
+
+	slice.Sort(numbers, "desc")
+	fmt.Println(numbers) //{5,4,3,2,1}
+
+	strings := []string{"a", "d", "c", "b", "e"}
+
+	slice.Sort(strings)
+	fmt.Println(strings) //{"a", "b", "c", "d", "e"}
+
+	slice.Sort(strings, "desc")
+	fmt.Println(strings) //{"e", "d", "c", "b", "a"}
+}
+```
+
+
+### <span id="SortBy">SortBy</span>
+
+<p>按照less函数确定的升序规则对切片进行排序。排序不保证稳定性</p>
+
+<b>函数签名:</b>
+
+```go
+func SortBy[T any](slice []T, less func(a, b T) bool)
+```
+
+<b>例子:</b>
+
+```go
+import (
+	"fmt"
+	"github.com/duke-git/lancet/v2/slice"
+)
+
+func main() {
+	numbers := []int{1, 4, 3, 2, 5}
+
+	slice.SortBy(numbers, func(a, b int) bool {
+		return a < b
+	})
+	fmt.Println(numbers) //{1, 2, 3, 4, 5}
+
+	type User struct {
+		Name string
+		Age  uint
+	}
+
+	users := []User{
+		{Name: "a", Age: 21},
+		{Name: "b", Age: 15},
+		{Name: "c", Age: 100}}
+
+	slice.SortBy(users, func(a, b User) bool {
+		return a.Age < b.Age
+	})
+
+	fmt.Printf("sort users by age: %v", users) 
+
+	// output
+	// [{b 15} {a 21} {c 100}]
+}
+```
+
+
+### <span id="SortByField">SortByField (已弃用: 请使用 Sort或SortBy 代替该方法)</span>
 
 <p>按字段对结构切片进行排序。slice元素应为struct，字段类型应为int、uint、string或bool。 默认排序类型是升序（asc），如果是降序，设置 sortType 为 desc</p>
 
@@ -1115,7 +1286,7 @@ func main() {
 }
 ```
 
-### <span id="StringSlice">StringSlice</span>
+### <span id="StringSlice">StringSlice(已弃用: 使用go1.18+泛型代替)</span>
 
 <p>将接口切片转换为字符串切片</p>
 
@@ -1176,7 +1347,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func ToSlice[T any](value ...T) []T
+func ToSlice[T any](items ...T) []T
 ```
 
 <b>例子:</b>
@@ -1200,7 +1371,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func ToSlicePointer[T any](value ...T) []*T
+func ToSlicePointer[T any](items ...T) []*T
 ```
 
 <b>例子:</b>
@@ -1356,7 +1527,7 @@ func main() {
 <b>函数签名:</b>
 
 ```go
-func Without[T comparable](slice []T, values ...T) []T
+func Without[T comparable](slice []T, items ...T) []T
 ```
 
 <b>例子:</b>

docs/strutil.md

@@ -36,7 +36,6 @@ import (
 - [SnakeCase](#SnakeCase)
 - [SplitEx](#SplitEx)
 - [Wrap](#Wrap)
-  
 - [Unwrap](#Unwrap)
   
 

docs/strutil_zh-CN.md

@@ -36,7 +36,6 @@ import (
 - [SnakeCase](#SnakeCase)
 - [SplitEx](#SplitEx)
 - [Wrap](#Wrap)
-  
 - [Unwrap](#Unwrap)
   
 

docs/validator.md

@@ -34,7 +34,6 @@ import (
 - [IsCreditCard](#IsCreditCard)
 - [IsDns](#IsDns)
 - [IsEmail](#IsEmail)
-  
 - [IsEmptyString](#IsEmptyString)
 - [IsFloatStr](#IsFloatStr)
 - [IsNumberStr](#IsNumberStr)

docs/validator_zh-CN.md

@@ -34,7 +34,6 @@ import (
 - [IsCreditCard](#IsCreditCard)
 - [IsDns](#IsDns)
 - [IsEmail](#IsEmail)
-  
 - [IsEmptyString](#IsEmptyString)
 - [IsFloatStr](#IsFloatStr)
 - [IsNumberStr](#IsNumberStr)

fileutil/file.go

@@ -8,6 +8,7 @@ import (
 	"archive/zip"
 	"bufio"
 	"errors"
+	"fmt"
 	"io"
 	"io/fs"
 	"io/ioutil"
@@ -213,6 +214,7 @@ func Zip(fpath string, destPath string) error {
 
 // UnZip unzip the file and save it to destPath
 func UnZip(zipFile string, destPath string) error {
+
 	zipReader, err := zip.OpenReader(zipFile)
 	if err != nil {
 		return err
@@ -220,7 +222,12 @@ func UnZip(zipFile string, destPath string) error {
 	defer zipReader.Close()
 
 	for _, f := range zipReader.File {
-		path := filepath.Join(destPath, f.Name)
+		//issue#62: fix ZipSlip bug
+		path, err := safeFilepathJoin(destPath, f.Name)
+		if err != nil {
+			return err
+		}
+
 		if f.FileInfo().IsDir() {
 			os.MkdirAll(path, os.ModePerm)
 		} else {
@@ -249,6 +256,17 @@ func UnZip(zipFile string, destPath string) error {
 	return nil
 }
 
+func safeFilepathJoin(path1, path2 string) (string, error) {
+	relPath, err := filepath.Rel(".", path2)
+	if err != nil || strings.HasPrefix(relPath, "..") {
+		return "", fmt.Errorf("(zipslip) filepath is unsafe %q: %v", path2, err)
+	}
+	if path1 == "" {
+		path1 = "."
+	}
+	return filepath.Join(path1, filepath.Join("/", relPath)), nil
+}
+
 // IsLink checks if a file is symbol link or not
 func IsLink(path string) bool {
 	fi, err := os.Lstat(path)

iterator/iterator.go

@@ -0,0 +1,174 @@
+// Copyright 2022 dudaodong@gmail.com. All rights resulterved.
+// Use of this source code is governed by MIT license
+
+// Package iterator provides a way to iterate over values stored in containers.
+// note:
+// 1. Full feature iterator is complicated, this pacakge is just a experiment to explore how iterators could work in Go.
+// 2. The functionality of this package is very simple and limited, may not meet the actual dev needs.
+// 3. It is currently under development, unstable, and will not be completed for some time in the future.
+// So, based on above factors, you may not use it in production. but, anyone is welcome to improve it.
+// Hope that Go can support iterator in future. see https://github.com/golang/go/discussions/54245 and https://github.com/golang/go/discussions/56413
+package iterator
+
+import "github.com/duke-git/lancet/v2/lancetconstraints"
+
+// Iterator supports iterating over a sequence of values of type `E`.
+type Iterator[T any] interface {
+	// Next checks if there is a next value in the iteration or not
+	HasNext() bool
+	// Next returns the next value in the iteration if there is one,
+	// and reports whether the returned value is valid.
+	// Once Next returns ok==false, the iteration is over,
+	// and all subsequent calls will return ok==false.
+	Next() (item T, ok bool)
+}
+
+// StopIterator is an  interface for stopping Iterator.
+type StopIterator[T any] interface {
+	Iterator[T]
+
+	// Stop indicates that the iterator will no longer be used.
+	// After a call to Stop, future calls to Next may panic.
+	// Stop may be called multiple times;
+	// all calls after the first will have no effect.
+	Stop()
+}
+
+// DeleteIter is an Iter that implements a Delete method.
+type DeleteIterator[T any] interface {
+	Iterator[T]
+
+	// Delete deletes the current iterator element;
+	// that is, the one returned by the last call to Next.
+	// Delete should panic if called before Next or after
+	// Next returns false.
+	Delete()
+}
+
+// SetIterator is an Iter that implements a Set method.
+type SetIterator[T any] interface {
+	Iterator[T]
+
+	// Set replaces the current iterator element with v.
+	// Set should panic if called before Next or after
+	// Next returns false.
+	Set(v T)
+}
+
+// PrevIterator is an iterator with a Prev method.
+type PrevIterator[T any] interface {
+	Iterator[T]
+
+	// Prev moves the iterator to the previous position.
+	// After calling Prev, Next will return the value at
+	// that position in the container. For example, after
+	//   it.Next() returning (v, true)
+	//   it.Prev()
+	// another call to it.Next will again return (v, true).
+	// Calling Prev before calling Next may panic.
+	// Calling Prev after Next returns false will move
+	// to the last element, or, if there are no elements,
+	// to the iterator's initial state.
+	Prev()
+}
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+// Functions that create an Iterator from some other type.                                       //
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+// FromSlice returns an iterator over a slice of data.
+func FromSlice[T any](slice []T) Iterator[T] {
+	return &sliceIterator[T]{slice: slice, index: -1}
+}
+
+func ToSlice[T any](iter Iterator[T]) []T {
+	result := []T{}
+	for item, ok := iter.Next(); ok; item, ok = iter.Next() {
+		result = append(result, item)
+	}
+	return result
+}
+
+type sliceIterator[T any] struct {
+	slice []T
+	index int
+}
+
+func (iter *sliceIterator[T]) HasNext() bool {
+	return iter.index < len(iter.slice)-1
+}
+
+func (iter *sliceIterator[T]) Next() (T, bool) {
+	iter.index++
+	ok := iter.index >= 0 && iter.index < len(iter.slice)
+	var item T
+	if ok {
+		item = iter.slice[iter.index]
+	}
+	return item, ok
+
+	// if len(iter.slice) == 0 {
+	// 	var zero T
+	// 	return zero, false
+	// }
+	// iter.index++
+	// item := iter.slice[0]
+	// iter.slice = iter.slice[1:]
+	// return item, true
+}
+
+// Prev implements PrevIterator.
+func (iter *sliceIterator[T]) Prev() {
+	if iter.index == -1 {
+		panic("Next function should be called Prev")
+	}
+	if iter.HasNext() {
+		iter.index--
+	} else {
+		iter.index = len(iter.slice) - 1
+	}
+}
+
+// Set implements SetIterator.
+func (iter *sliceIterator[T]) Set(value T) {
+	if iter.index == -1 {
+		panic("Next function should be called Set")
+	}
+	if iter.index >= len(iter.slice) || len(iter.slice) == 0 {
+		panic("No element in current iterator")
+	}
+	iter.slice[iter.index] = value
+}
+
+// FromRange creates a iterator which returns the numeric range between start inclusive and end
+// exclusive by the step size. start should be less than end, step shoud be positive.
+func FromRange[T lancetconstraints.Number](start, end, step T) Iterator[T] {
+	if end < start {
+		panic("RangeIterator: start should be before end")
+	} else if step <= 0 {
+		panic("RangeIterator: step should be positive")
+	}
+
+	return &rangeIterator[T]{start: start, end: end, step: step}
+}
+
+type rangeIterator[T lancetconstraints.Number] struct {
+	start, end, step T
+}
+
+func (iter *rangeIterator[T]) HasNext() bool {
+	if iter.start >= iter.end {
+		return false
+	}
+	return true
+}
+
+func (iter *rangeIterator[T]) Next() (T, bool) {
+	if iter.start >= iter.end {
+		var zero T
+		return zero, false
+	}
+	num := iter.start
+	iter.start += iter.step
+	return num, true
+}

iterator/iterator_test.go

@@ -0,0 +1,50 @@
+// Copyright 2022 dudaodong@gmail.com. All rights resulterved.
+// Use of this source code is governed by MIT license
+
+// Package iterator implements some feature of C++ STL iterators
+package iterator
+
+import (
+	"testing"
+
+	"github.com/duke-git/lancet/v2/internal"
+)
+
+func TestSliceIterator(t *testing.T) {
+	assert := internal.NewAssert(t, "TestSliceIterator")
+
+	// HashNext
+	t.Run("slice iterator HasNext: ", func(t *testing.T) {
+		iter1 := FromSlice([]int{1, 2, 3, 4})
+		for {
+			item, _ := iter1.Next()
+
+			if item == 4 {
+				assert.Equal(false, iter1.HasNext())
+				break
+			} else {
+				assert.Equal(true, iter1.HasNext())
+			}
+		}
+
+		iter2 := FromSlice([]int{})
+		assert.Equal(false, iter2.HasNext())
+	})
+
+	//Next
+	t.Run("slice iterator Next: ", func(t *testing.T) {
+		iter1 := FromSlice([]int{1, 2, 3, 4})
+		for i := 0; i < 4; i++ {
+			item, ok := iter1.Next()
+			if !ok {
+				break
+			}
+			assert.Equal(i+1, item)
+		}
+
+		iter2 := FromSlice([]int{})
+		_, ok := iter2.Next()
+		assert.Equal(false, ok)
+	})
+
+}

iterator/operation.go

@@ -0,0 +1,61 @@
+// Copyright 2022 dudaodong@gmail.com. All rights resulterved.
+// Use of this source code is governed by MIT license
+
+// Package iterator provides a way to iterate over values stored in containers.
+// note:
+// 1. Full feature iterator is complicated, this pacakge is just a experiment to explore how iterators could work in Go.
+// 2. The functionality of this package is very simple and limited, may not meet the actual dev needs.
+// 3. It is currently under development, unstable, and will not be completed for some time in the future.
+// So, based on above factors, you may not use it in production. but, anyone is welcome to improve it.
+// Hope that Go can support iterator in future. see https://github.com/golang/go/discussions/54245 and https://github.com/golang/go/discussions/56413
+package iterator
+
+// Map creates a new iterator which applies a function to all items of input iterator.
+func Map[T any, U any](iter Iterator[T], iteratee func(item T) U) Iterator[U] {
+	return &mapIterator[T, U]{
+		iter:     iter,
+		iteratee: iteratee,
+	}
+}
+
+type mapIterator[T any, U any] struct {
+	iter     Iterator[T]
+	iteratee func(T) U
+}
+
+func (mr *mapIterator[T, U]) HasNext() bool {
+	return mr.iter.HasNext()
+}
+
+func (mr *mapIterator[T, U]) Next() (U, bool) {
+	var zero U
+	item, ok := mr.iter.Next()
+	if !ok {
+		return zero, false
+	}
+	return mr.iteratee(item), true
+}
+
+// Filter creates a new iterator that returns only the items that pass specified predicate function.
+func Filter[T any](iter Iterator[T], predicateFunc func(item T) bool) Iterator[T] {
+	return &filterIterator[T]{iter: iter, predicateFunc: predicateFunc}
+}
+
+type filterIterator[T any] struct {
+	iter          Iterator[T]
+	predicateFunc func(T) bool
+}
+
+func (fr *filterIterator[T]) Next() (T, bool) {
+	for item, ok := fr.iter.Next(); ok; item, ok = fr.iter.Next() {
+		if fr.predicateFunc(item) {
+			return item, true
+		}
+	}
+	var zero T
+	return zero, false
+}
+
+func (fr *filterIterator[T]) HasNext() bool {
+	return fr.iter.HasNext()
+}

lancetconstraints/constraints.go

@@ -16,3 +16,8 @@ type Comparator interface {
 type Number interface {
 	~int | ~int8 | ~int16 | ~int32 | ~int64 | ~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64 | ~uintptr | ~float32 | ~float64
 }
+
+// Ordered is a constraint that permits any ordered type: any type that supports the operators < <= >= >
+type Ordered interface {
+	Number | ~string
+}

slice/slice.go

@@ -10,22 +10,24 @@ import (
 	"math/rand"
 	"reflect"
 	"sort"
+
+	"github.com/duke-git/lancet/v2/lancetconstraints"
 )
 
-// Contain check if the value is in the slice or not
-func Contain[T comparable](slice []T, value T) bool {
-	set := make(map[T]struct{}, len(slice))
-	for _, v := range slice {
-		set[v] = struct{}{}
+// Contain check if the target value is in the slice or not
+func Contain[T comparable](slice []T, target T) bool {
+	for _, item := range slice {
+		if item == target {
+			return true
+		}
 	}
 
-	_, ok := set[value]
-	return ok
+	return false
 }
 
-// ContainSubSlice check if the slice contain subslice or not
-func ContainSubSlice[T comparable](slice, subslice []T) bool {
-	for _, v := range subslice {
+// ContainSubSlice check if the slice contain a given subslice or not
+func ContainSubSlice[T comparable](slice, subSlice []T) bool {
+	for _, v := range subSlice {
 		if !Contain(slice, v) {
 			return false
 		}
@@ -34,7 +36,7 @@ func ContainSubSlice[T comparable](slice, subslice []T) bool {
 	return true
 }
 
-// Chunk creates an slice of elements split into groups the length of size.
+// Chunk creates a slice of elements split into groups the length of size
 func Chunk[T any](slice []T, size int) [][]T {
 	result := [][]T{}
 
@@ -42,39 +44,27 @@ func Chunk[T any](slice []T, size int) [][]T {
 		return result
 	}
 
-	length := len(slice)
-	if size == 1 || size >= length {
-		for _, v := range slice {
-			var tmp []T
-			tmp = append(tmp, v)
-			result = append(result, tmp)
+	for _, item := range slice {
+		l := len(result)
+		if l == 0 || len(result[l-1]) == size {
+			result = append(result, []T{})
+			l++
 		}
-		return result
-	}
 
-	// divide slice equally
-	divideNum := length/size + 1
-	for i := 0; i < divideNum; i++ {
-		if i == divideNum-1 {
-			if len(slice[i*size:]) > 0 {
-				result = append(result, slice[i*size:])
-			}
-		} else {
-			result = append(result, slice[i*size:(i+1)*size])
-		}
+		result[l-1] = append(result[l-1], item)
 	}
 
 	return result
+
 }
 
 // Compact creates an slice with all falsey values removed. The values false, nil, 0, and "" are falsey
-func Compact[T any](slice []T) []T {
-	result := make([]T, 0)
+func Compact[T comparable](slice []T) []T {
+	var zero T
+
+	result := []T{}
 	for _, v := range slice {
-		if !reflect.DeepEqual(v, nil) &&
-			!reflect.DeepEqual(v, false) &&
-			!reflect.DeepEqual(v, "") &&
-			!reflect.DeepEqual(v, 0) {
+		if v != zero {
 			result = append(result, v)
 		}
 	}
@@ -82,11 +72,11 @@ func Compact[T any](slice []T) []T {
 	return result
 }
 
-// Concat creates a new slice concatenating slice with any additional slices and/or values.
-func Concat[T any](slice []T, values ...[]T) []T {
+// Concat creates a new slice concatenating slice with any additional slices.
+func Concat[T any](slice []T, slices ...[]T) []T {
 	result := append([]T{}, slice...)
 
-	for _, v := range values {
+	for _, v := range slices {
 		result = append(result, v...)
 	}
 
@@ -124,7 +114,7 @@ func DifferenceBy[T comparable](slice []T, comparedSlice []T, iteratee func(inde
 }
 
 //DifferenceWith accepts comparator which is invoked to compare elements of slice to values. The order and references of result values are determined by the first slice. The comparator is invoked with two arguments: (arrVal, othVal).
-func DifferenceWith[T any](slice []T, comparedSlice []T, comparator func(value1, value2 T) bool) []T {
+func DifferenceWith[T any](slice []T, comparedSlice []T, comparator func(item1, item2 T) bool) []T {
 	result := make([]T, 0)
 
 	getIndex := func(arr []T, item T, comparison func(v1, v2 T) bool) int {
@@ -169,9 +159,8 @@ func EqualWith[T, U any](slice1 []T, slice2 []U, comparator func(T, U) bool) boo
 		return false
 	}
 
-	for i, v1 := range slice1 {
-		v2 := slice2[i]
-		if !comparator(v1, v2) {
+	for i, v := range slice1 {
+		if !comparator(v, slice2[i]) {
 			return false
 		}
 	}
@@ -181,33 +170,29 @@ func EqualWith[T, U any](slice1 []T, slice2 []U, comparator func(T, U) bool) boo
 
 // Every return true if all of the values in the slice pass the predicate function.
 func Every[T any](slice []T, predicate func(index int, item T) bool) bool {
-	var currentLength int
-
 	for i, v := range slice {
-		if predicate(i, v) {
-			currentLength++
+		if !predicate(i, v) {
+			return false
 		}
 	}
 
-	return currentLength == len(slice)
+	return true
 }
 
 // None return true if all the values in the slice mismatch the criteria
 func None[T any](slice []T, predicate func(index int, item T) bool) bool {
-
-	var currentLength int
+	l := 0
 	for i, v := range slice {
 		if !predicate(i, v) {
-			currentLength++
+			l++
 		}
 	}
 
-	return currentLength == len(slice)
+	return l == len(slice)
 }
 
 // Some return true if any of the values in the list pass the predicate function.
 func Some[T any](slice []T, predicate func(index int, item T) bool) bool {
-
 	for i, v := range slice {
 		if predicate(i, v) {
 			return true
@@ -220,6 +205,7 @@ func Some[T any](slice []T, predicate func(index int, item T) bool) bool {
 // Filter iterates over elements of slice, returning an slice of all elements pass the predicate function
 func Filter[T any](slice []T, predicate func(index int, item T) bool) []T {
 	result := make([]T, 0)
+
 	for i, v := range slice {
 		if predicate(i, v) {
 			result = append(result, v)
@@ -229,13 +215,23 @@ func Filter[T any](slice []T, predicate func(index int, item T) bool) []T {
 	return result
 }
 
-// Count iterates over elements of slice, returns a count of all matched elements
-func Count[T any](slice []T, predicate func(index int, item T) bool) int {
-	if len(slice) == 0 {
-		return 0
+// Count returns the number of occurrences of the given item in the slice
+func Count[T comparable](slice []T, item T) int {
+	count := 0
+
+	for _, v := range slice {
+		if item == v {
+			count++
+		}
 	}
 
-	var count int
+	return count
+}
+
+// CountBy iterates over elements of slice with predicate function, returns the number of all matched elements
+func CountBy[T any](slice []T, predicate func(index int, item T) bool) int {
+	count := 0
+
 	for i, v := range slice {
 		if predicate(i, v) {
 			count++
@@ -284,11 +280,8 @@ func GroupWith[T any, U comparable](slice []T, iteratee func(item T) U) map[U][]
 // Find iterates over elements of slice, returning the first one that passes a truth test on predicate function.
 // If return T is nil then no items matched the predicate func
 func Find[T any](slice []T, predicate func(index int, item T) bool) (*T, bool) {
-	if len(slice) == 0 {
-		return nil, false
-	}
-
 	index := -1
+
 	for i, v := range slice {
 		if predicate(i, v) {
 			index = i
@@ -306,11 +299,8 @@ func Find[T any](slice []T, predicate func(index int, item T) bool) (*T, bool) {
 // FindLast iterates over elements of slice from end to begin, returning the first one that passes a truth test on predicate function.
 // If return T is nil then no items matched the predicate func
 func FindLast[T any](slice []T, predicate func(index int, item T) bool) (*T, bool) {
-	if len(slice) == 0 {
-		return nil, false
-	}
-
 	index := -1
+
 	for i := len(slice) - 1; i >= 0; i-- {
 		if predicate(i, slice[i]) {
 			index = i
@@ -356,8 +346,11 @@ func Flatten(slice any) any {
 func FlattenDeep(slice any) any {
 	sv := sliceValue(slice)
 	st := sliceElemType(sv.Type())
+
 	tmp := reflect.MakeSlice(reflect.SliceOf(st), 0, 0)
+
 	result := flattenRecursive(sv, tmp)
+
 	return result.Interface()
 }
 
@@ -386,6 +379,7 @@ func ForEach[T any](slice []T, iteratee func(index int, item T)) {
 // Map creates an slice of values by running each element of slice thru iteratee function.
 func Map[T any, U any](slice []T, iteratee func(index int, item T) U) []U {
 	result := make([]U, len(slice), cap(slice))
+
 	for i, v := range slice {
 		result[i] = iteratee(i, v)
 	}
@@ -395,7 +389,6 @@ func Map[T any, U any](slice []T, iteratee func(index int, item T) U) []U {
 
 // Reduce creates an slice of values by running each element of slice thru iteratee function.
 func Reduce[T any](slice []T, iteratee func(index int, item1, item2 T) T, initial T) T {
-
 	if len(slice) == 0 {
 		return initial
 	}
@@ -432,7 +425,19 @@ func ReplaceAll[T comparable](slice []T, old T, new T) []T {
 	return Replace(slice, old, new, -1)
 }
 
+// Repeat creates a slice with length n whose elements are param `item`.
+func Repeat[T any](item T, n int) []T {
+	result := make([]T, n)
+
+	for i := range result {
+		result[i] = item
+	}
+
+	return result
+}
+
 // InterfaceSlice convert param to slice of interface.
+// This function is deprecated, use generics feature of go1.18+ for replacement
 func InterfaceSlice(slice any) []any {
 	sv := sliceValue(slice)
 	if sv.IsNil() {
@@ -448,35 +453,37 @@ func InterfaceSlice(slice any) []any {
 }
 
 // StringSlice convert param to slice of string.
+// This function is deprecated, use generics feature of go1.18+ for replacement
 func StringSlice(slice any) []string {
 	v := sliceValue(slice)
 
-	out := make([]string, v.Len())
+	result := make([]string, v.Len())
 	for i := 0; i < v.Len(); i++ {
 		v, ok := v.Index(i).Interface().(string)
 		if !ok {
 			panic("invalid element type")
 		}
-		out[i] = v
+		result[i] = v
 	}
 
-	return out
+	return result
 }
 
 // IntSlice convert param to slice of int.
+// This function is deprecated, use generics feature of go1.18+ for replacement
 func IntSlice(slice any) []int {
 	sv := sliceValue(slice)
 
-	out := make([]int, sv.Len())
+	result := make([]int, sv.Len())
 	for i := 0; i < sv.Len(); i++ {
 		v, ok := sv.Index(i).Interface().(int)
 		if !ok {
 			panic("invalid element type")
 		}
-		out[i] = v
+		result[i] = v
 	}
 
-	return out
+	return result
 }
 
 // DeleteAt delete the element of slice from start index to end index - 1.
@@ -594,7 +601,7 @@ func UniqueBy[T comparable](slice []T, iteratee func(item T) T) []T {
 	return Unique(result)
 }
 
-// Union creates a slice of unique values, in order, from all given slices.
+// Union creates a slice of unique elements, in order, from all given slices.
 func Union[T comparable](slices ...[]T) []T {
 	result := []T{}
 	contain := map[T]struct{}{}
@@ -629,7 +636,18 @@ func UnionBy[T any, V comparable](predicate func(item T) V, slices ...[]T) []T {
 	return result
 }
 
-// Intersection creates a slice of unique values that included by all slices.
+// Merge all given slices into one slice
+func Merge[T any](slices ...[]T) []T {
+	result := make([]T, 0)
+
+	for _, v := range slices {
+		result = append(result, v...)
+	}
+
+	return result
+}
+
+// Intersection creates a slice of unique elements that included by all slices.
 func Intersection[T comparable](slices ...[]T) []T {
 	if len(slices) == 0 {
 		return []T{}
@@ -640,8 +658,8 @@ func Intersection[T comparable](slices ...[]T) []T {
 
 	reducer := func(sliceA, sliceB []T) []T {
 		hashMap := make(map[T]int)
-		for _, val := range sliceA {
-			hashMap[val] = 1
+		for _, v := range sliceA {
+			hashMap[v] = 1
 		}
 
 		out := make([]T, 0)
@@ -709,9 +727,26 @@ func Shuffle[T any](slice []T) []T {
 	return result
 }
 
+// Sort sorts a slice of any ordered type(number or string), use quick sort algrithm.
+// default sort order is ascending (asc), if want descending order, set param `sortOrder` to `desc`
+func Sort[T lancetconstraints.Ordered](slice []T, sortOrder ...string) {
+	if len(sortOrder) > 0 && sortOrder[0] == "desc" {
+		quickSort(slice, 0, len(slice)-1, "desc")
+	} else {
+		quickSort(slice, 0, len(slice)-1, "asc")
+	}
+}
+
+// SortBy sorts the slice in ascending order as determined by the less function.
+// This sort is not guaranteed to be stable
+func SortBy[T any](slice []T, less func(a, b T) bool) {
+	quickSortBy(slice, 0, len(slice)-1, less)
+}
+
 // SortByField return sorted slice by field
-// Slice element should be struct, field type should be int, uint, string, or bool
+// slice element should be struct, field type should be int, uint, string, or bool
 // default sortType is ascending (asc), if descending order, set sortType to desc
+// This function is deprecated, use Sort and SortBy for replacement
 func SortByField(slice any, field string, sortType ...string) error {
 	sv := sliceValue(slice)
 	t := sv.Type().Elem()
@@ -781,15 +816,15 @@ func SortByField(slice any, field string, sortType ...string) error {
 	return nil
 }
 
-// Without creates a slice excluding all given values
-func Without[T comparable](slice []T, values ...T) []T {
-	if len(values) == 0 || len(slice) == 0 {
+// Without creates a slice excluding all given items
+func Without[T comparable](slice []T, items ...T) []T {
+	if len(items) == 0 || len(slice) == 0 {
 		return slice
 	}
 
 	result := make([]T, 0, len(slice))
 	for _, v := range slice {
-		if !Contain(values, v) {
+		if !Contain(items, v) {
 			result = append(result, v)
 		}
 	}
@@ -797,11 +832,10 @@ func Without[T comparable](slice []T, values ...T) []T {
 	return result
 }
 
-// IndexOf returns the index at which the first occurrence of a value is found in a slice or return -1
-// if the value cannot be found.
-func IndexOf[T comparable](slice []T, value T) int {
+// IndexOf returns the index at which the first occurrence of a item is found in a slice or return -1 if the item cannot be found.
+func IndexOf[T comparable](slice []T, item T) int {
 	for i, v := range slice {
-		if v == value {
+		if v == item {
 			return i
 		}
 	}
@@ -809,11 +843,10 @@ func IndexOf[T comparable](slice []T, value T) int {
 	return -1
 }
 
-// LastIndexOf returns the index at which the last occurrence of a value is found in a slice or return -1
-// if the value cannot be found.
-func LastIndexOf[T comparable](slice []T, value T) int {
+// LastIndexOf returns the index at which the last occurrence of the item is found in a slice or return -1 if the then cannot be found.
+func LastIndexOf[T comparable](slice []T, item T) int {
 	for i := len(slice) - 1; i > 0; i-- {
-		if value == slice[i] {
+		if item == slice[i] {
 			return i
 		}
 	}
@@ -822,27 +855,27 @@ func LastIndexOf[T comparable](slice []T, value T) int {
 }
 
 // ToSlicePointer returns a pointer to the slices of a variable parameter transformation
-func ToSlicePointer[T any](value ...T) []*T {
-	result := make([]*T, len(value))
-	for i := range value {
-		result[i] = &value[i]
+func ToSlicePointer[T any](items ...T) []*T {
+	result := make([]*T, len(items))
+	for i := range items {
+		result[i] = &items[i]
 	}
 
 	return result
 }
 
 // ToSlice returns a slices of a variable parameter transformation
-func ToSlice[T any](value ...T) []T {
-	result := make([]T, len(value))
-	copy(result, value)
+func ToSlice[T any](items ...T) []T {
+	result := make([]T, len(items))
+	copy(result, items)
 
 	return result
 }
 
-// AppendIfAbsent only absent append the value
-func AppendIfAbsent[T comparable](slice []T, value T) []T {
-	if !Contain(slice, value) {
-		slice = append(slice, value)
+// AppendIfAbsent only absent append the item
+func AppendIfAbsent[T comparable](slice []T, item T) []T {
+	if !Contain(slice, item) {
+		slice = append(slice, item)
 	}
 	return slice
 }

slice/slice_internal.go

@@ -3,6 +3,8 @@ package slice
 import (
 	"fmt"
 	"reflect"
+
+	"github.com/duke-git/lancet/v2/lancetconstraints"
 )
 
 // sliceValue return the reflect value of a slice
@@ -24,3 +26,66 @@ func sliceElemType(reflectType reflect.Type) reflect.Type {
 		reflectType = reflectType.Elem()
 	}
 }
+
+func quickSort[T lancetconstraints.Ordered](slice []T, lowIndex, highIndex int, order string) {
+	if lowIndex < highIndex {
+		p := partitionOrderedSlice(slice, lowIndex, highIndex, order)
+		quickSort(slice, lowIndex, p-1, order)
+		quickSort(slice, p+1, highIndex, order)
+	}
+}
+
+// partitionOrderedSlice split ordered slice into two parts for quick sort
+func partitionOrderedSlice[T lancetconstraints.Ordered](slice []T, lowIndex, highIndex int, order string) int {
+	p := slice[highIndex]
+	i := lowIndex
+
+	for j := lowIndex; j < highIndex; j++ {
+		if order == "desc" {
+			if slice[j] > p {
+				swap(slice, i, j)
+				i++
+			}
+		} else {
+			if slice[j] < p {
+				swap(slice, i, j)
+				i++
+			}
+		}
+	}
+
+	swap(slice, i, highIndex)
+
+	return i
+}
+
+func quickSortBy[T any](slice []T, lowIndex, highIndex int, less func(a, b T) bool) {
+	if lowIndex < highIndex {
+		p := partitionAnySlice(slice, lowIndex, highIndex, less)
+		quickSortBy(slice, lowIndex, p-1, less)
+		quickSortBy(slice, p+1, highIndex, less)
+	}
+}
+
+// partitionAnySlice split any slice into two parts for quick sort
+func partitionAnySlice[T any](slice []T, lowIndex, highIndex int, less func(a, b T) bool) int {
+	p := slice[highIndex]
+	i := lowIndex
+
+	for j := lowIndex; j < highIndex; j++ {
+
+		if less(slice[j], p) {
+			swap(slice, i, j)
+			i++
+		}
+	}
+
+	swap(slice, i, highIndex)
+
+	return i
+}
+
+// swap two slice value at index i and j
+func swap[T any](slice []T, i, j int) {
+	slice[i], slice[j] = slice[j], slice[i]
+}

slice/slice_test.go

@@ -31,6 +31,10 @@ func TestChunk(t *testing.T) {
 
 	arr := []string{"a", "b", "c", "d", "e"}
 
+	assert.Equal([][]string{}, Chunk(arr, -1))
+
+	assert.Equal([][]string{}, Chunk(arr, 0))
+
 	r1 := [][]string{{"a"}, {"b"}, {"c"}, {"d"}, {"e"}}
 	assert.Equal(r1, Chunk(arr, 1))
 
@@ -43,8 +47,11 @@ func TestChunk(t *testing.T) {
 	r4 := [][]string{{"a", "b", "c", "d"}, {"e"}}
 	assert.Equal(r4, Chunk(arr, 4))
 
-	r5 := [][]string{{"a"}, {"b"}, {"c"}, {"d"}, {"e"}}
+	r5 := [][]string{{"a", "b", "c", "d", "e"}}
 	assert.Equal(r5, Chunk(arr, 5))
+
+	r6 := [][]string{{"a", "b", "c", "d", "e"}}
+	assert.Equal(r6, Chunk(arr, 6))
 }
 
 func TestCompact(t *testing.T) {
@@ -186,13 +193,22 @@ func TestGroupWith(t *testing.T) {
 }
 
 func TestCount(t *testing.T) {
+	numbers := []int{1, 2, 3, 3, 5, 6}
+
+	assert := internal.NewAssert(t, "TestCountBy")
+
+	assert.Equal(1, Count(numbers, 1))
+	assert.Equal(2, Count(numbers, 3))
+}
+
+func TestCountBy(t *testing.T) {
 	nums := []int{1, 2, 3, 4, 5, 6}
 	evenFunc := func(i, num int) bool {
 		return (num % 2) == 0
 	}
 
-	assert := internal.NewAssert(t, "TestCount")
-	assert.Equal(3, Count(nums, evenFunc))
+	assert := internal.NewAssert(t, "TestCountBy")
+	assert.Equal(3, CountBy(nums, evenFunc))
 }
 
 func TestFind(t *testing.T) {
@@ -439,6 +455,18 @@ func TestUnionBy(t *testing.T) {
 	assert.Equal(result, []int{0, 2, 4, 10})
 }
 
+func TestMerge(t *testing.T) {
+	assert := internal.NewAssert(t, "TestMerge")
+
+	s1 := []int{1, 2, 3, 4}
+	s2 := []int{2, 3, 4, 5}
+	s3 := []int{4, 5, 6}
+
+	assert.Equal([]int{1, 2, 3, 4, 2, 3, 4, 5, 4, 5, 6}, Merge(s1, s2, s3))
+	assert.Equal([]int{1, 2, 3, 4, 2, 3, 4, 5}, Merge(s1, s2))
+	assert.Equal([]int{2, 3, 4, 5, 4, 5, 6}, Merge(s2, s3))
+}
+
 func TestIntersection(t *testing.T) {
 	s1 := []int{1, 2, 2, 3}
 	s2 := []int{1, 2, 3, 4}
@@ -519,6 +547,56 @@ func TestDifferenceBy(t *testing.T) {
 	assert.Equal([]int{1, 2}, DifferenceBy(s1, s2, addOne))
 }
 
+func TestSort(t *testing.T) {
+	assert := internal.NewAssert(t, "TestSort")
+
+	numbers := []int{1, 4, 3, 2, 5}
+
+	Sort(numbers)
+	assert.Equal([]int{1, 2, 3, 4, 5}, numbers)
+
+	Sort(numbers, "desc")
+	assert.Equal([]int{5, 4, 3, 2, 1}, numbers)
+
+	strings := []string{"a", "d", "c", "b", "e"}
+
+	Sort(strings)
+	assert.Equal([]string{"a", "b", "c", "d", "e"}, strings)
+
+	Sort(strings, "desc")
+	assert.Equal([]string{"e", "d", "c", "b", "a"}, strings)
+}
+
+func TestSortBy(t *testing.T) {
+	assert := internal.NewAssert(t, "TestSortBy")
+
+	numbers := []int{1, 4, 3, 2, 5}
+
+	SortBy(numbers, func(a, b int) bool {
+		return a < b
+	})
+	assert.Equal([]int{1, 2, 3, 4, 5}, numbers)
+
+	type User struct {
+		Name string
+		Age  uint
+	}
+
+	users := []User{
+		{Name: "a", Age: 21},
+		{Name: "b", Age: 15},
+		{Name: "c", Age: 100}}
+
+	SortBy(users, func(a, b User) bool {
+		return a.Age < b.Age
+	})
+
+	t.Logf("sort users by age: %v", users)
+
+	// output
+	// [{b 15} {a 21} {c 100}]
+}
+
 func TestSortByFielDesc(t *testing.T) {
 	assert := internal.NewAssert(t, "TestSortByFielDesc")
 
@@ -665,3 +743,11 @@ func TestKeyBy(t *testing.T) {
 
 	assert.Equal(result, map[int]string{1: "a", 2: "ab", 3: "abc"})
 }
+
+func TestRepeat(t *testing.T) {
+	assert := internal.NewAssert(t, "TestRepeat")
+
+	result := Repeat("a", 6)
+
+	assert.Equal(result, []string{"a", "a", "a", "a", "a", "a"})
+}