merge main branch

Fix typos in README (#154 )
add new func & docs error repair (#153 )
2026-02-23 13:52:26 +08:00 · 2023-12-29 10:17:04 +08:00 · 2023-12-29 10:12:29 +08:00 · 2023-12-28 10:27:32 +08:00 · 2023-12-21 10:03:35 +08:00 · 2023-12-21 10:02:23 +08:00
32 changed files with 305 additions and 186 deletions
--- a/README.md
+++ b/README.md
@@ -32,7 +32,7 @@

 ### Note:

-1. <b>For users who use go1.18 and above, it is recommended to install lancet v2.x.x. Cause in v2.x.x all functions was rewriten with generics of go1.18.</b>
+1. <b>For users who use go1.18 and above, it is recommended to install lancet v2.x.x. Cause in v2.x.x all functions were rewritten with generics of go1.18.</b>

 ```go
 go get github.com/duke-git/lancet/v2 // will install latest version of v2.x.x
@@ -201,10 +201,10 @@ import "github.com/duke-git/lancet/v2/concurrency"
 -   **<big>OrDone</big>** : read a channel into another channel, will close until cancel context.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/concurrency.md#OrDone)]
    [[play](https://go.dev/play/p/lm_GoS6aDjo)]
-   **<big>Repeat</big>** : create channel, put values into the channel repeatly until cancel the context.
+-   **<big>Repeat</big>** : create channel, put values into the channel repeatedly until cancel the context.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/concurrency.md#Repeat)]
    [[play](https://go.dev/play/p/k5N_ALVmYjE)]
-   **<big>RepeatFn</big>** : create a channel, excutes fn repeatly, and put the result into the channel, until close context.
+-   **<big>RepeatFn</big>** : create a channel, executes fn repeatedly, and put the result into the channel, until close context.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/concurrency.md#RepeatFn)]
    [[play](https://go.dev/play/p/4J1zAWttP85)]
 -   **<big>Take</big>** : create a channel whose values are taken from another channel with limit number.
@@ -247,7 +247,7 @@ import "github.com/duke-git/lancet/v2/condition"
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/condition.md#TernaryOperator)]
    [[play](https://go.dev/play/p/ElllPZY0guT)]

-<h3 id="convertor"> 5. Convertor package contains some functions for data convertion. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a> </h3>
+<h3 id="convertor"> 5. Convertor package contains some functions for data conversion. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a> </h3>

 ```go
 import "github.com/duke-git/lancet/v2/convertor"
@@ -596,7 +596,7 @@ import "github.com/duke-git/lancet/v2/datetime"
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/datetime.md#TimestampNano)]
    [[play](https://go.dev/play/p/A9Oq_COrcCF)]

-<h3 id="datastructure"> 8. Datastructure package constains some common data structure. eg. list, linklist, stack, queue, set, tree, graph. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a></h3>
+<h3 id="datastructure"> 8. Datastructure package contains some common data structure. eg. list, linklist, stack, queue, set, tree, graph. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a></h3>

 ```go
 import list "github.com/duke-git/lancet/v2/datastructure/list"
@@ -754,10 +754,10 @@ import "github.com/duke-git/lancet/v2/function"

 #### Function list:

-   **<big>After</big>** : return a function that invokes passed funcation once the returned function is called more than n times.
+-   **<big>After</big>** : return a function that invokes passed function once the returned function is called more than n times.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/function.md#After)]
    [[play](https://go.dev/play/p/eRD5k2vzUVX)]
-   **<big>Before</big>** : return a function that invokes passed funcation once the returned function is called less than n times
+-   **<big>Before</big>** : return a function that invokes passed function once the returned function is called less than n times
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/function.md#Before)]
    [[play](https://go.dev/play/p/0HqUDIFZ3IL)]
 -   **<big>CurryFn</big>** : make a curry function.
@@ -778,7 +778,7 @@ import "github.com/duke-git/lancet/v2/function"
 -   **<big>Pipeline</big>** : takes a list of functions and returns a function whose param will be passed into the functions one by one.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/function.md#Pipeline)]
    [[play](https://go.dev/play/p/mPdUVvj6HD6)]
-   **<big>Watcher</big>** : Watcher is used for record code excution time. can start/stop/reset the watch timer. get the elapsed time of function execution.
+-   **<big>Watcher</big>** : Watcher is used for record code execution time. can start/stop/reset the watch timer. get the elapsed time of function execution.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/function.md#Watcher)]
    [[play](https://go.dev/play/p/l2yrOpCLd1I)]

@@ -793,7 +793,7 @@ import "github.com/duke-git/lancet/v2/maputil"
 -   **<big>MapTo</big>** : quick map any value to struct or any base type.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/maputil.md#MapTo)]
    [[play](https://go.dev/play/p/4K7KBEPgS5M)]
-   **<big>ForEach</big>** : executes iteratee funcation for every key and value pair in map.
+-   **<big>ForEach</big>** : executes iteratee function for every key and value pair in map.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/maputil.md#ForEach)]
    [[play](https://go.dev/play/p/OaThj6iNVXK)]
 -   **<big>Filter</big>** : iterates over map, return a new map contains all key and value pairs pass the predicate function.
@@ -811,7 +811,7 @@ import "github.com/duke-git/lancet/v2/maputil"
 -   **<big>OmitByKeys</big>** : the opposite of FilterByKeys, extracts all the map elements which keys are not omitted.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/maputil.md#OmitByKeys)]
    [[play](https://go.dev/play/p/jXGrWDBfSRp)]
-   **<big>OmitByValues</big>** : the opposite of FilterByValues. remov all elements whose value are in the give slice.
+-   **<big>OmitByValues</big>** : the opposite of FilterByValues. remove all elements whose value are in the give slice.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/maputil.md#OmitByValues)]
    [[play](https://go.dev/play/p/XB7Y10uw20_U)]
 -   **<big>Intersect</big>** : iterates over maps, return a new map of key and value pairs in all given maps.
@@ -961,7 +961,7 @@ import "github.com/duke-git/lancet/v2/mathutil"
 -   **<big>Sum</big>** : return sum of passed numbers.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/mathutil.md#Sum)]
    [[play](https://go.dev/play/p/1To2ImAMJA7)]
-   **<big>Abs</big>** : returns the absolute value of param nubmer.
+-   **<big>Abs</big>** : returns the absolute value of param number.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/mathutil.md#Sum)]
    [[play](https://go.dev/play/p/fsyBh1Os-1d)]

@@ -1012,7 +1012,7 @@ import "github.com/duke-git/lancet/v2/netutil"
 -   **<big>DecodeResponse</big>** : decode http response into target object.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/netutil.md#DecodeResponse)]
    [[play](https://go.dev/play/p/jUSgynekH7G)]
-   **<big>StructToUrlValues</big>** : convert struct to url valuse.
+-   **<big>StructToUrlValues</big>** : convert struct to url values.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/netutil.md#StructToUrlValues)]
    [[play](https://go.dev/play/p/pFqMkM40w9z)]
 -   **<big>HttpGet<sup>deprecated</sup></big>** : send http get request.
@@ -1099,10 +1099,16 @@ import "github.com/duke-git/lancet/v2/random"
    [[play](https://go.dev/play/p/uBkRSOz73Ec)]
 -   **<big>RandSymbolChar</big>** : Generate a random symbol char of specified length.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/random.md#RandSymbolChar)]
+    [[play](https://go.dev/play/p/Im6ZJxAykOm)]
+
 -   **<big>RandFloat</big>** : Generate a random float64 number between [min, max) with specific precision.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/random.md#RandFloat)]
+    [[play](https://go.dev/play/p/zbD_tuobJtr)]
+
 -   **<big>RandFloats</big>** : Generate a slice of random float64 numbers of length n that do not repeat.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/random.md#RandFloats)]
+    [[play](https://go.dev/play/p/I3yndUQ-rhh)]
+

 <h3 id="retry"> 17. Retry package is for executing a function repeatedly until it was successful or canceled by the context. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a></h3>

@@ -1151,7 +1157,7 @@ import "github.com/duke-git/lancet/v2/slice"
 -   **<big>Chunk</big>** : creates a slice of elements split into groups the length of size.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/slice.md#Chunk)]
    [[play](https://go.dev/play/p/b4Pou5j2L_C)]
-   **<big>Compact</big>** : creates an slice with all falsey values removed. The values false, nil, 0, and "" are falsey.
+-   **<big>Compact</big>** : creates an slice with all falsy values removed. The values false, nil, 0, and "" are falsy.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/slice.md#Compact)]
    [[play](https://go.dev/play/p/pO5AnxEr3TK)]
 -   **<big>Concat</big>** : creates a new slice concatenating slice with any additional slices.
@@ -1232,7 +1238,7 @@ import "github.com/duke-git/lancet/v2/slice"
 -   **<big>GroupBy</big>** : iterate over elements of the slice, each element will be group by criteria, returns two slices.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/slice.md#GroupBy)]
    [[play](https://go.dev/play/p/QVkPxzPR0iA)]
-   **<big>GroupWith</big>** : return a map composed of keys generated from the resultults of running each element of slice thru iteratee.
+-   **<big>GroupWith</big>** : return a map composed of keys generated from the results of running each element of slice thru iteratee.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/slice.md#GroupWith)]
    [[play](https://go.dev/play/p/ApCvMNTLO8a)]
 -   **<big>IntSlice<sup>deprecated</sup></big>** : convert param to int slice.
@@ -1348,6 +1354,8 @@ import "github.com/duke-git/lancet/v2/slice"
    [[play](https://go.dev/play/p/lkQ3Ri2NQhV)]
 -   **<big>Random</big>** : get a random item of slice, return its index, when slice is empty, return -1. 
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/slice.md#Random)]
+    [[play](https://go.dev/play/p/UzpGQptWppw)]
+

 <h3 id="stream"> 19. Stream package implements a sequence of elements supporting sequential and operations. this package is an experiment to explore if stream in go can work as the way java does. its function is very limited. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a></h3>

@@ -1369,7 +1377,7 @@ import "github.com/duke-git/lancet/v2/stream"
 -   **<big>FromRange</big>** : creates a number stream from start to end. both start and end are included. [start, end]
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/stream.md#FromRange)]
    [[play](https://go.dev/play/p/9Ex1-zcg-B-)]
-   **<big>Generate</big>** : creates a stream where each element is generated by the provided generater function.
+-   **<big>Generate</big>** : creates a stream where each element is generated by the provided generator function.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/stream.md#Generate)]
    [[play](https://go.dev/play/p/rkOWL1yA3j9)]
 -   **<big>Concat</big>** : creates a lazily concatenated stream whose elements are all the elements of the first stream followed by all the elements of the second stream.
@@ -1414,10 +1422,10 @@ import "github.com/duke-git/lancet/v2/stream"
 -   **<big>FindLast</big>** : returns the last element of this stream and true, or zero value and false if the stream is empty.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/stream.md#FindLast)]
    [[play](https://go.dev/play/p/WZD2rDAW-2h)]
-   **<big>Max</big>** : returns the maximum element of this stream according to the provided less function. less fuction: a > b
+-   **<big>Max</big>** : returns the maximum element of this stream according to the provided less function. less function: a > b
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/stream.md#Max)]
    [[play](https://go.dev/play/p/fm-1KOPtGzn)]
-   **<big>Min</big>** : returns the minimum element of this stream according to the provided less function. less fuction: a < b
+-   **<big>Min</big>** : returns the minimum element of this stream according to the provided less function. less function: a < b
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/stream.md#Min)]
    [[play](https://go.dev/play/p/vZfIDgGNRe_0)]
 -   **<big>AllMatch</big>** : returns whether all elements of this stream match the provided predicate.
@@ -1445,29 +1453,31 @@ import "github.com/duke-git/lancet/v2/structs"
 #### Function list:

 -   **<big>New</big>** : creates a `Struct` instance.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/struct.md#New)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#New)]
 -   **<big>ToMap</big>** : converts a valid struct to a map.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/struct.md#ToMap)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#ToMap)]
 -   **<big>Fields</big>** : get all fields of a given struct, that the fields are abstract struct field.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/struct.md#Fields)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#Fields)]
 -   **<big>IsStruct</big>** : check if the struct is valid.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/struct.md#IsStruct)]
-   **<big>Tag</big>** : get a `Tag` of the `Field`, `Tag` is a abstract struct field tag
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#Tag)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#IsStruct)]
+-   **<big>Tag</big>** : get a `Tag` of the `Field`, `Tag` is a abstract struct field tag.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#Tag)]
 -   **<big>Name</big>** : get the field name.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#Name)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#Name)]
 -   **<big>Value</big>** : get the `Field` underlying value.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#Value)]
-   **<big>Kind</big>** : get the field's kind
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#Kind)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#Value)]
+-   **<big>Kind</big>** : get the field's kind.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#Kind)]
 -   **<big>IsEmbedded</big>** : check if the field is an embedded field.
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#IsEmbedded)]
-   **<big>IsExported</big>** : check if the field is exporte
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#IsExported)]
-   **<big>IsZero</big>** : check if the field is zero value
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#IsZero)]
-   **<big>IsSlice</big>** : check if the field is a slice
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/structs/field.md#IsSlice)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#IsEmbedded)]
+-   **<big>IsExported</big>** : check if the field is exported.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#IsExported)]
+-   **<big>IsZero</big>** : check if the field is zero value.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#IsZero)]
+-   **<big>IsSlice</big>** : check if the field is a slice.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#IsSlice)]
+-   **<big>IsTargetType</big>** : check if the field is target type.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/struct.md#IsTargetType)]

 <h3 id="strutil"> 21. Strutil package contains some functions to manipulate string. &nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">index</a></h3>

@@ -1636,7 +1646,7 @@ import "github.com/duke-git/lancet/v2/tuple"

 #### Function list:

-   **<big>Tuple2</big>** : represents a 2 elemnets tuple.
+-   **<big>Tuple2</big>** : represents a 2 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple2)]
    [[play](https://go.dev/play/p/3sHVqBQpLYN)]
 -   **<big>Tuple2_Unbox</big>** : returns values in Tuple2.
@@ -1648,7 +1658,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip2</big>** : create a group of slice from a slice of Tuple2.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip2)]
    [[play](https://go.dev/play/p/KBecr60feXb)]
-   **<big>Tuple3</big>** : represents a 3 elemnets tuple.
+-   **<big>Tuple3</big>** : represents a 3 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple3)]
    [[play](https://go.dev/play/p/FtH2sdCLlCf)]
 -   **<big>Tuple3_Unbox</big>** : returns values in Tuple3.
@@ -1660,7 +1670,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip3</big>** : create a group of slice from a slice of Tuple3.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip3)]
    [[play](https://go.dev/play/p/bba4cpAa7KO)]
-   **<big>Tuple4</big>** : represents a 4 elemnets tuple.
+-   **<big>Tuple4</big>** : represents a 4 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple4)]
    [[play](https://go.dev/play/p/D2EqDz096tk)]
 -   **<big>Tuple4_Unbox</big>** : returns values in Tuple4.
@@ -1672,7 +1682,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip4</big>** : create a group of slice from a slice of Tuple4.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip4)]
    [[play](https://go.dev/play/p/rb8z4gyYSRN)]
-   **<big>Tuple5</big>** : represents a 5 elemnets tuple.
+-   **<big>Tuple5</big>** : represents a 5 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple5)]
    [[play](https://go.dev/play/p/2WndmVxPg-r)]
 -   **<big>Tuple5_Unbox</big>** : returns values in Tuple4.
@@ -1684,7 +1694,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip5</big>** : create a group of slice from a slice of Tuple5.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip5)]
    [[play](https://go.dev/play/p/gyl6vKfhqPb)]
-   **<big>Tuple6</big>** : represents a 6 elemnets tuple.
+-   **<big>Tuple6</big>** : represents a 6 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple6)]
    [[play](https://go.dev/play/p/VjqcCwEJZbs)]
 -   **<big>Tuple6_Unbox</big>** : returns values in Tuple6.
@@ -1696,7 +1706,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip6</big>** : create a group of slice from a slice of Tuple6.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip6)]
    [[play](https://go.dev/play/p/l41XFqCyh5E)]
-   **<big>Tuple7</big>** : represents a 7 elemnets tuple.
+-   **<big>Tuple7</big>** : represents a 7 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple7)]
    [[play](https://go.dev/play/p/dzAgv_Ezub9)]
 -   **<big>Tuple7_Unbox</big>** : returns values in Tuple7.
@@ -1708,7 +1718,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip7</big>** : create a group of slice from a slice of Tuple7.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip7)]
    [[play](https://go.dev/play/p/hws_P1Fr2j3)]
-   **<big>Tuple8</big>** : represents a 8 elemnets tuple.
+-   **<big>Tuple8</big>** : represents a 8 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple8)]
    [[play](https://go.dev/play/p/YA9S0rz3dRz)]
 -   **<big>Tuple8_Unbox</big>** : returns values in Tuple8.
@@ -1720,7 +1730,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip8</big>** : create a group of slice from a slice of Tuple8.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip8)]
    [[play](https://go.dev/play/p/1SndOwGsZB4)]
-   **<big>Tuple9</big>** : represents a 9 elemnets tuple.
+-   **<big>Tuple9</big>** : represents a 9 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple9)]
    [[play](https://go.dev/play/p/yS2NGGtZpQr)]
 -   **<big>Tuple9_Unbox</big>** : returns values in Tuple9.
@@ -1732,7 +1742,7 @@ import "github.com/duke-git/lancet/v2/tuple"
 -   **<big>Unzip9</big>** : create a group of slice from a slice of Tuple9.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Unzip9)]
    [[play](https://go.dev/play/p/91-BU_KURSA)]
-   **<big>Tuple10</big>** : represents a 10 elemnets tuple.
+-   **<big>Tuple10</big>** : represents a 10 elements tuple.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/tuple.md#Tuple10)]
    [[play](https://go.dev/play/p/799qqZg0hUv)]
 -   **<big>Tuple10_Unbox</big>** : returns values in Tuple10.
@@ -1864,19 +1874,19 @@ import "github.com/duke-git/lancet/v2/validator"
 -   **<big>IsJWT</big>** : check if a give string is a valid JSON Web Token (JWT).
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/validator.md#IsJWT)]
    [[play](https://go.dev/play/p/R6Op7heJbKI)]
-   **<big>IsVisa</big>** : check if a give string is a valid visa card nubmer or not.
+-   **<big>IsVisa</big>** : check if a give string is a valid visa card number or not.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/validator.md#IsVisa)]
    [[play](https://go.dev/play/p/SdS2keOyJsl)]
-   **<big>IsMasterCard</big>** : check if a give string is a valid master card nubmer or not.
+-   **<big>IsMasterCard</big>** : check if a give string is a valid master card number or not.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/validator.md#IsMasterCard)]
    [[play](https://go.dev/play/p/CwWBFRrG27b)]
-   **<big>IsAmericanExpress</big>** : check if a give string is a valid american expression card nubmer or not.
+-   **<big>IsAmericanExpress</big>** : check if a give string is a valid american expression card number or not.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/validator.md#IsAmericanExpress)]
    [[play](https://go.dev/play/p/HIDFpcOdpkd)]
-   **<big>IsUnionPay</big>** : check if a give string is a valid union pay nubmer or not.
+-   **<big>IsUnionPay</big>** : check if a give string is a valid union pay number or not.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/validator.md#IsUnionPay)]
    [[play](https://go.dev/play/p/CUHPEwEITDf)]
-   **<big>IsChinaUnionPay</big>** : check if a give string is a valid china union pay nubmer or not.
+-   **<big>IsChinaUnionPay</big>** : check if a give string is a valid china union pay number or not.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/en/api/packages/validator.md#IsChinaUnionPay)]
    [[play](https://go.dev/play/p/yafpdxLiymu)]

--- a/README_zh-CN.md
+++ b/README_zh-CN.md
@@ -1100,12 +1100,14 @@ import "github.com/duke-git/lancet/v2/random"
    [[play](https://go.dev/play/p/uBkRSOz73Ec)]
 -   **<big>RandSymbolChar</big>** : 生成给定长度的随机符号字符串。
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/random.md#RandSymbolChar)]
-    [[play](https://go.dev/play/p/uBkRSOz73Ec)]
+    [[play](https://go.dev/play/p/Im6ZJxAykOm)]
 -   **<big>RandFloat</big>** : 生成随机float64数字，可以指定范围和精度。
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/random.md#RandFloat)]
-    [[play](https://go.dev/play/p/uBkRSOz73Ec)]
+    [[play](https://go.dev/play/p/zbD_tuobJtr)]
 -   **<big>RandFloats</big>** : 生成随机float64数字切片，可以指定长度，范围和精度.
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/random.md#RandFloats)]
+    [[play](https://go.dev/play/p/uBkRSOz73Ec)]
+

 <h3 id="retry"> 17. retry 重试执行函数直到函数运行成功或被 context cancel。&nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">回到目录</a></h3>

@@ -1340,7 +1342,6 @@ import "github.com/duke-git/lancet/v2/slice"
 -   **<big>Without</big>** : 创建一个不包括所有给定值的切片。
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/slice.md#Without)]
    [[play](https://go.dev/play/p/bwhEXEypThg)]
-   **<big>KeyBy</big>** :将切片每个元素调用函数后转为 map。
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/slice.md#KeyBy)]
    [[play](https://go.dev/play/p/uXod2LWD1Kg)]
 -   **<big>Join</big>** : 用指定的分隔符链接切片元素。
@@ -1351,6 +1352,8 @@ import "github.com/duke-git/lancet/v2/slice"
    [[play](https://go.dev/play/p/lkQ3Ri2NQhV)]
 -   **<big>Random</big>** : 随机返回切片中元素以及下标, 当切片长度为0时返回下标-1。
    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/slice.md#Random)]
+    [[play](https://go.dev/play/p/UzpGQptWppw)]
+


 <h3 id="stream"> 19. stream 流，该包仅验证简单的 stream 实现，功能有限。&nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">回到目录</a></h3>
@@ -1449,31 +1452,33 @@ import "github.com/duke-git/lancet/v2/structs"
 #### 函数列表:

 -   **<big>New</big>** : `Struct`结构体的构造函数。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/struct.md#New)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#New)]
 -   **<big>ToMap</big>** : 将一个合法的 struct 对象转换为 map[string]any。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/struct.md#ToMap)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#ToMap)]
 -   **<big>Fields</big>** : 获取一个 struct 对象的属性列表。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/struct.md#Fields)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#Fields)]
 -   **<big>Field</big>** : 根据属性名获取一个 struct 对象的属性。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/struct.md#Fields)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#Fields)]
 -   **<big>IsStruct</big>** : 判断是否为一个合法的 struct 对象。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/struct.md#IsStruct)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#IsStruct)]
 -   **<big>Tag</big>** : 获取`Field`的`Tag`，默认的 tag key 是 json。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#Tag)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#Tag)]
 -   **<big>Name</big>** : 获取属性名。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#Name)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#Name)]
 -   **<big>Value</big>** : 获取`Field`属性的值。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#Value)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#Value)]
 -   **<big>Kind</big>** : 获取属性 Kind。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#Kind)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#Kind)]
 -   **<big>IsEmbedded</big>** : 判断属性是否为嵌入。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#IsEmbedded)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#IsEmbedded)]
 -   **<big>IsExported</big>** : 判断属性是否导出。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#IsExported)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#IsExported)]
 -   **<big>IsZero</big>** : 判断属性是否为零值。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#IsZero)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#IsZero)]
 -   **<big>IsSlice</big>** : 判断属性是否是切片。
-    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/structs/field.md#IsSlice)]
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#IsSlice)]
+-   **<big>IsTargetType</big>** : 判断属性是否是目标类型。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/api/packages/struct.md#IsTargetType)]

 <h3 id="strutil"> 21. strutil 包含字符串处理的相关函数。&nbsp; &nbsp; &nbsp; &nbsp;<a href="#index">回到目录</a></h3>

--- a/algorithm/search.go
+++ b/algorithm/search.go
@@ -4,7 +4,7 @@
 // Package algorithm contain some basic algorithm functions. eg. sort, search, list, linklist, stack, queue, tree, graph.
 package algorithm

-import "github.com/duke-git/lancet/v2/lancetconstraints"
+import "github.com/duke-git/lancet/v2/constraints"

 // Search algorithms see https://github.com/TheAlgorithms/Go/tree/master/search

@@ -23,7 +23,7 @@ func LinearSearch[T any](slice []T, target T, equal func(a, b T) bool) int {
 // BinarySearch return the index of target within a sorted slice, use binary search (recursive call itself).
 // If not found return -1.
 // Play: https://go.dev/play/p/t6MeGiUSN47
-func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int {
+func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int {
 	if highIndex < lowIndex || len(sortedSlice) == 0 {
 		return -1
 	}
@@ -44,7 +44,7 @@ func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, com
 // BinaryIterativeSearch return the index of target within a sorted slice, use binary search (no recursive).
 // If not found return -1.
 // Play: https://go.dev/play/p/Anozfr8ZLH3
-func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int {
+func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int {
 	startIndex := lowIndex
 	endIndex := highIndex

--- a/algorithm/sort.go
+++ b/algorithm/sort.go
@@ -3,24 +3,29 @@

 package algorithm

-import "github.com/duke-git/lancet/v2/lancetconstraints"
+import "github.com/duke-git/lancet/v2/constraints"

 // BubbleSort applys the bubble sort algorithm to sort the collection, will change the original collection data.
 // Play: https://go.dev/play/p/GNdv7Jg2Taj
-func BubbleSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func BubbleSort[T any](slice []T, comparator constraints.Comparator) {
 	for i := 0; i < len(slice); i++ {
+		breakTag := false
 		for j := 0; j < len(slice)-1-i; j++ {
 			isCurrGreatThanNext := comparator.Compare(slice[j], slice[j+1]) == 1
 			if isCurrGreatThanNext {
 				swap(slice, j, j+1)
+				breakTag = true
 			}
 		}
+		if !breakTag {
+			break
+		}
 	}
 }

 // InsertionSort applys the insertion sort algorithm to sort the collection, will change the original collection data.
 // Play: https://go.dev/play/p/G5LJiWgJJW6
-func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func InsertionSort[T any](slice []T, comparator constraints.Comparator) {
 	for i := 0; i < len(slice); i++ {
 		for j := i; j > 0; j-- {
 			isPreLessThanCurrent := comparator.Compare(slice[j], slice[j-1]) == -1
@@ -35,7 +40,7 @@ func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator) {

 // SelectionSort applys the selection sort algorithm to sort the collection, will change the original collection data.
 // Play: https://go.dev/play/p/oXovbkekayS
-func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func SelectionSort[T any](slice []T, comparator constraints.Comparator) {
 	for i := 0; i < len(slice); i++ {
 		min := i
 		for j := i + 1; j < len(slice); j++ {
@@ -49,7 +54,7 @@ func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator) {

 // ShellSort applys the shell sort algorithm to sort the collection, will change the original collection data.
 // Play: https://go.dev/play/p/3ibkszpJEu3
-func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func ShellSort[T any](slice []T, comparator constraints.Comparator) {
 	size := len(slice)

 	gap := 1
@@ -69,11 +74,11 @@ func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator) {

 // QuickSort quick sorting for slice, lowIndex is 0 and highIndex is len(slice)-1.
 // Play: https://go.dev/play/p/7Y7c1Elk3ax
-func QuickSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func QuickSort[T any](slice []T, comparator constraints.Comparator) {
 	quickSort(slice, 0, len(slice)-1, comparator)
 }

-func quickSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) {
+func quickSort[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) {
 	if lowIndex < highIndex {
 		p := partition(slice, lowIndex, highIndex, comparator)
 		quickSort(slice, lowIndex, p-1, comparator)
@@ -82,7 +87,7 @@ func quickSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconst
 }

 // partition split slice into two parts
-func partition[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int {
+func partition[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) int {
 	p := slice[highIndex]
 	i := lowIndex
 	for j := lowIndex; j < highIndex; j++ {
@@ -99,7 +104,7 @@ func partition[T any](slice []T, lowIndex, highIndex int, comparator lancetconst

 // HeapSort applys the heap sort algorithm to sort the collection, will change the original collection data.
 // Play: https://go.dev/play/p/u6Iwa1VZS_f
-func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func HeapSort[T any](slice []T, comparator constraints.Comparator) {
 	size := len(slice)

 	for i := size/2 - 1; i >= 0; i-- {
@@ -111,7 +116,7 @@ func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator) {
 	}
 }

-func sift[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) {
+func sift[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) {
 	i := lowIndex
 	j := 2*i + 1

@@ -133,11 +138,11 @@ func sift[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraint

 // MergeSort applys the merge sort algorithm to sort the collection, will change the original collection data.
 // Play: https://go.dev/play/p/ydinn9YzUJn
-func MergeSort[T any](slice []T, comparator lancetconstraints.Comparator) {
+func MergeSort[T any](slice []T, comparator constraints.Comparator) {
 	mergeSort(slice, 0, len(slice)-1, comparator)
 }

-func mergeSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) {
+func mergeSort[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) {
 	if lowIndex < highIndex {
 		mid := (lowIndex + highIndex) / 2
 		mergeSort(slice, lowIndex, mid, comparator)
@@ -146,7 +151,7 @@ func mergeSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconst
 	}
 }

-func merge[T any](slice []T, lowIndex, midIndex, highIndex int, comparator lancetconstraints.Comparator) {
+func merge[T any](slice []T, lowIndex, midIndex, highIndex int, comparator constraints.Comparator) {
 	i := lowIndex
 	j := midIndex + 1
 	temp := []T{}
@@ -175,7 +180,7 @@ func merge[T any](slice []T, lowIndex, midIndex, highIndex int, comparator lance

 // CountSort applys the count sort algorithm to sort the collection, don't change the original collection data.
 // Play: https://go.dev/play/p/tB-Umgm0DrP
-func CountSort[T any](slice []T, comparator lancetconstraints.Comparator) []T {
+func CountSort[T any](slice []T, comparator constraints.Comparator) []T {
 	size := len(slice)
 	out := make([]T, size)

--- a/algorithm/sort_test.go
+++ b/algorithm/sort_test.go
@@ -16,7 +16,7 @@ type people struct {
 // PeopleAageComparator sort people slice by age field
 type peopleAgeComparator struct{}

-// Compare implements github.com/duke-git/lancet/v2/lancetconstraints/constraints.go/Comparator
+// Compare implements github.com/duke-git/lancet/v2/constraints/constraints.go/Comparator
 func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
 	p1, _ := v1.(people)
 	p2, _ := v2.(people)
--- a/lancetconstraints/constraints.go
+++ b/lancetconstraints/constraints.go
@@ -1,8 +1,8 @@
 // Copyright 2021 dudaodong@gmail.com. All rights reserved.
 // Use of this source code is governed by MIT license

-// Package lancetconstraints contain some comstomer constraints.
-package lancetconstraints
+// Package constraints contain some custom interface.
+package constraints

 // Comparator is for comparing two values
 type Comparator interface {
--- a/datastructure/heap/maxheap.go
+++ b/datastructure/heap/maxheap.go
@@ -7,18 +7,18 @@ package datastructure
 import (
 	"fmt"

-	"github.com/duke-git/lancet/v2/lancetconstraints"
+	"github.com/duke-git/lancet/v2/constraints"
 )

 // MaxHeap implements a binary max heap
-// type T should implements Compare function in lancetconstraints.Comparator interface.
+// type T should implements Compare function in constraints.Comparator interface.
 type MaxHeap[T any] struct {
 	data       []T
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }

 // NewMaxHeap returns a MaxHeap instance with the given comparator.
-func NewMaxHeap[T any](comparator lancetconstraints.Comparator) *MaxHeap[T] {
+func NewMaxHeap[T any](comparator constraints.Comparator) *MaxHeap[T] {
 	return &MaxHeap[T]{
 		data:       make([]T, 0),
 		comparator: comparator,
@@ -26,7 +26,7 @@ func NewMaxHeap[T any](comparator lancetconstraints.Comparator) *MaxHeap[T] {
 }

 // BuildMaxHeap builds a MaxHeap instance with data and given comparator.
-func BuildMaxHeap[T any](data []T, comparator lancetconstraints.Comparator) *MaxHeap[T] {
+func BuildMaxHeap[T any](data []T, comparator constraints.Comparator) *MaxHeap[T] {
 	heap := &MaxHeap[T]{
 		data:       make([]T, 0, len(data)),
 		comparator: comparator,
--- a/datastructure/queue/priorityqueue.go
+++ b/datastructure/queue/priorityqueue.go
@@ -8,20 +8,20 @@ package datastructure
 import (
 	"errors"

-	"github.com/duke-git/lancet/v2/lancetconstraints"
+	"github.com/duke-git/lancet/v2/constraints"
 )

 // PriorityQueue is a priority queue implemented by binary heap tree
-// type T should implements Compare function in lancetconstraints.Comparator interface.
+// type T should implements Compare function in constraints.Comparator interface.
 type PriorityQueue[T any] struct {
 	items      []T
 	size       int
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }

 // NewPriorityQueue return a pointer of PriorityQueue
 // param `comparator` is used to compare values in the queue
-func NewPriorityQueue[T any](capacity int, comparator lancetconstraints.Comparator) *PriorityQueue[T] {
+func NewPriorityQueue[T any](capacity int, comparator constraints.Comparator) *PriorityQueue[T] {
 	return &PriorityQueue[T]{
 		items:      make([]T, capacity+1),
 		size:       0,
--- a/datastructure/tree/bstree.go
+++ b/datastructure/tree/bstree.go
@@ -7,22 +7,22 @@ package datastructure
 import (
 	"math"

+	"github.com/duke-git/lancet/v2/constraints"
 	"github.com/duke-git/lancet/v2/datastructure"
-	"github.com/duke-git/lancet/v2/lancetconstraints"
 )

 // BSTree is a binary search tree data structure in which each node has at most two children,
 // which are referred to as the left child and the right child.
 // In BSTree: leftNode < rootNode < rightNode
-// type T should implements Compare function in lancetconstraints.Comparator interface.
+// type T should implements Compare function in constraints.Comparator interface.
 type BSTree[T any] struct {
 	root       *datastructure.TreeNode[T]
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }

 // NewBSTree create a BSTree pointer
 // param `comparator` is used to compare values in the tree
-func NewBSTree[T any](rootData T, comparator lancetconstraints.Comparator) *BSTree[T] {
+func NewBSTree[T any](rootData T, comparator constraints.Comparator) *BSTree[T] {
 	root := datastructure.NewTreeNode(rootData)
 	return &BSTree[T]{root, comparator}
 }
@@ -87,7 +87,7 @@ func (t *BSTree[T]) HasSubTree(subTree *BSTree[T]) bool {
 }

 func hasSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T],
-	comparator lancetconstraints.Comparator) bool {
+	comparator constraints.Comparator) bool {
 	result := false

 	if superTreeRoot != nil && subTreeRoot != nil {
--- a/datastructure/tree/tree_internal.go
+++ b/datastructure/tree/tree_internal.go
@@ -4,8 +4,8 @@ import (
 	"fmt"
 	"math"

+	"github.com/duke-git/lancet/v2/constraints"
 	"github.com/duke-git/lancet/v2/datastructure"
-	"github.com/duke-git/lancet/v2/lancetconstraints"
 )

 func preOrderTraverse[T any](node *datastructure.TreeNode[T]) []T {
@@ -86,7 +86,7 @@ func levelOrderTraverse[T any](root *datastructure.TreeNode[T], traversal *[]T)
 	}
 }

-func insertTreeNode[T any](rootNode, newNode *datastructure.TreeNode[T], comparator lancetconstraints.Comparator) {
+func insertTreeNode[T any](rootNode, newNode *datastructure.TreeNode[T], comparator constraints.Comparator) {
 	if comparator.Compare(newNode.Value, rootNode.Value) == -1 {
 		if rootNode.Left == nil {
 			rootNode.Left = newNode
@@ -103,7 +103,7 @@ func insertTreeNode[T any](rootNode, newNode *datastructure.TreeNode[T], compara
 }

 // todo, delete root node failed
-func deleteTreeNode[T any](node *datastructure.TreeNode[T], data T, comparator lancetconstraints.Comparator) *datastructure.TreeNode[T] {
+func deleteTreeNode[T any](node *datastructure.TreeNode[T], data T, comparator constraints.Comparator) *datastructure.TreeNode[T] {
 	if node == nil {
 		return nil
 	}
@@ -216,7 +216,7 @@ func calculateDepth[T any](node *datastructure.TreeNode[T], depth int) int {
 	return max(calculateDepth(node.Left, depth+1), calculateDepth(node.Right, depth+1))
 }

-func isSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T], comparator lancetconstraints.Comparator) bool {
+func isSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T], comparator constraints.Comparator) bool {
 	if subTreeRoot == nil {
 		return true
 	}
--- a/docs/api/packages/algorithm.md
+++ b/docs/api/packages/algorithm.md
@@ -43,12 +43,12 @@ import (

 ### <span id="BubbleSort">BubbleSort</span>

-<p>冒泡排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>冒泡排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func BubbleSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func BubbleSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/GNdv7Jg2Taj)</span></b>
@@ -91,12 +91,12 @@ func main() {

 ### <span id="InsertionSort">InsertionSort</span>

-<p>插入排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>插入排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func InsertionSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/G5LJiWgJJW6)</span></b>
@@ -117,7 +117,7 @@ type people struct {
 // PeopleAageComparator sort people slice by age field
 type peopleAgeComparator struct{}

-// Compare implements github.com/duke-git/lancet/lancetconstraints/constraints.go/Comparator
+// Compare implements github.com/duke-git/lancet/constraints/constraints.go/Comparator
 func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
    p1, _ := v1.(people)
    p2, _ := v2.(people)
@@ -154,12 +154,12 @@ func main() {

 ### <span id="SelectionSort">SelectionSort</span>

-<p>选择排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>选择排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func SelectionSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/oXovbkekayS)</span></b>
@@ -202,12 +202,12 @@ func main() {

 ### <span id="ShellSort">ShellSort</span>

-<p>希尔排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>希尔排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func ShellSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/3ibkszpJEu3)</span></b>
@@ -250,12 +250,12 @@ func main() {

 ### <span id="QuickSort">QuickSort</span>

-<p>快速排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>快速排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func QuickSort[T any](slice []T comparator lancetconstraints.Comparator)
+func QuickSort[T any](slice []T comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/7Y7c1Elk3ax)</span></b>
@@ -298,12 +298,12 @@ func main() {

 ### <span id="HeapSort">HeapSort</span>

-<p>堆排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>堆排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func HeapSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/u6Iwa1VZS_f)</span></b>
@@ -346,12 +346,12 @@ func main() {

 ### <span id="MergeSort">MergeSort</span>

-<p>归并排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>归并排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func MergeSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func MergeSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ydinn9YzUJn)</span></b>
@@ -394,12 +394,12 @@ func main() {

 ### <span id="CountSort">CountSort</span>

-<p>计数排序，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>计数排序，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func CountSort[T any](slice []T, comparator lancetconstraints.Comparator) []T
+func CountSort[T any](slice []T, comparator constraints.Comparator) []T
 ```

 <b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/tB-Umgm0DrP)</span></b>
@@ -443,12 +443,12 @@ func main() {

 ### <span id="BinarySearch">BinarySearch</span>

-<p>二分递归查找，返回元素索引，未找到元素返回-1，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>二分递归查找，返回元素索引，未找到元素返回-1，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int
+func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int
 ```

 <b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/t6MeGiUSN47)</span></b>
@@ -494,12 +494,12 @@ func main() {

 ### <span id="BinaryIterativeSearch">BinaryIterativeSearch</span>

-<p>二分迭代查找，返回元素索引，未找到元素返回-1，参数comparator需要实现包lancetconstraints.Comparator。</p>
+<p>二分迭代查找，返回元素索引，未找到元素返回-1，参数comparator需要实现包constraints.Comparator。</p>

 <b>函数签名:</b>

 ```go
-func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int
+func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int
 ```

 <b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/Anozfr8ZLH3)</span></b>
--- a/docs/api/packages/datastructure/heap.md
+++ b/docs/api/packages/datastructure/heap.md
@@ -44,9 +44,9 @@ MaxHeap是通过slice实现的二叉堆树，根节点的key既大于等于左
 ```go
 type MaxHeap[T any] struct {
 	data       []T
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }
-func NewMaxHeap[T any](comparator lancetconstraints.Comparator) *MaxHeap[T]
+func NewMaxHeap[T any](comparator constraints.Comparator) *MaxHeap[T]
 ```
 <b>示例:</b>

--- a/docs/api/packages/datastructure/queue.md
+++ b/docs/api/packages/datastructure/queue.md
@@ -1100,12 +1100,12 @@ func main() {
 <b>函数签名:</b>

 ```go
-func NewPriorityQueue[T any](capacity int, comparator lancetconstraints.Comparator) *PriorityQueue[T]
+func NewPriorityQueue[T any](capacity int, comparator constraints.Comparator) *PriorityQueue[T]

 type PriorityQueue[T any] struct {
 	items      []T
 	size       int
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }
 ```
 <b>示例:</b>
--- a/docs/api/packages/datastructure/tree.md
+++ b/docs/api/packages/datastructure/tree.md
@@ -41,7 +41,7 @@ import (
 ## 文档

 ## 1. BSTree
-BSTree是一种二叉搜索树数据结构，其中每个节点有两个孩子，分别称为左孩子和右孩子。 在 BSTree 中：leftNode < rootNode < rightNode。 T类型应该实现lancetconstraints.Comparator。
+BSTree是一种二叉搜索树数据结构，其中每个节点有两个孩子，分别称为左孩子和右孩子。 在 BSTree 中：leftNode < rootNode < rightNode。 T类型应该实现constraints.Comparator。

 ### <span id="NewBSTree">NewBSTree</span>
 <p>返回BSTree指针实例</p>
@@ -49,11 +49,11 @@ BSTree是一种二叉搜索树数据结构，其中每个节点有两个孩子
 <b>函数签名:</b>

 ```go
-func NewBSTree[T any](rootData T, comparator lancetconstraints.Comparator) *BSTree[T]
+func NewBSTree[T any](rootData T, comparator constraints.Comparator) *BSTree[T]

 type BSTree[T any] struct {
 	root       *datastructure.TreeNode[T]
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }

 type TreeNode[T any] struct {
--- a/docs/api/packages/random.md
+++ b/docs/api/packages/random.md
@@ -223,7 +223,7 @@ func main() {

 ### <span id="RandSymbolChar">RandSymbolChar</span>

-<p>生成给定长度的随机符号字符串. 符号字符包括: !@#$%^&*()_+-=[]{}|;':\",./<>?。</p>
+<p>生成给定长度的随机符号字符串。</p>

 <b>函数签名:</b>

@@ -231,7 +231,7 @@ func main() {
 func RandSymbolChar(length int) string
 ```

-<b>示例:</b>
+<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/Im6ZJxAykOm)</span></b>

 ```go
 package main
@@ -243,7 +243,7 @@ import (

 func main() {
    randStr := random.RandSymbolChar(6)
-    fmt.Println(randStr) //@#(_")
+    fmt.Println(randStr) // 随机特殊字符字符串，例如: @#(_")
 }
 ```

@@ -312,7 +312,7 @@ func main() {
 func RandFloat(min, max float64, precision int) float64
 ```

-<b>实例:</b>
+<b>实例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/zbD_tuobJtr)</span></b>

 ```go
 package main
@@ -338,7 +338,7 @@ func main() {
 func RandFloats(n int, min, max float64, precision int) []float64
 ```

-<b>实例:</b>
+<b>实例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/I3yndUQ-rhh)</span></b>

 ```go
 package main
--- a/docs/api/packages/slice.md
+++ b/docs/api/packages/slice.md
@@ -2501,7 +2501,7 @@ func main() {
 func Random[T any](slice []T) (val T, idx int)
 ```

-<b>示例:<span style="float:right;display:inline-block;">[运行](TODO)</span></b>
+<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/UzpGQptWppw)</span></b>

 ```go
 import (
--- a/docs/api/packages/struct.md
+++ b/docs/api/packages/struct.md
@@ -37,6 +37,7 @@ import (
 -   [IsExported](#IsExported)
 -   [IsZero](#IsZero)
 -   [IsSlice](#IsSlice)
+-   [IsTargetType](#IsTargetType)

 <div STYLE="page-break-after: always;"></div>

@@ -531,4 +532,45 @@ func main() {
    // Output: 
    // true
 }
+```
+
+### <span id="IsTargetType">IsTargetType</span>
+
+<p>判断属性是否是目标类型</p>
+
+<b>函数签名:</b>
+
+```go
+func (f *Field) IsTargetType(targetType reflect.Kind) bool
+```
+
+<b>示例:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    "reflect"
+    "github.com/duke-git/lancet/v2/structs"
+)
+
+func main() {
+    type Parent struct {
+        Name string
+        arr  []int
+    }
+
+    p1 := &Parent{arr: []int{1, 2, 3}}
+    s := structs.New(p1)
+    n, _ := s.Field("Name")
+	a, _ := s.Field("arr")
+    
+    fmt.Println(n.IsTargetType(reflect.String))
+    fmt.Println(a.IsTargetType(reflect.Slice))
+    
+    // Output: 
+    // true
+    // true
+}
 ```
--- a/docs/en/api/packages/algorithm.md
+++ b/docs/en/api/packages/algorithm.md
@@ -43,12 +43,12 @@ import (

 ### <span id="BubbleSort">BubbleSort</span>

-<p>Sort slice with bubble sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with bubble sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func BubbleSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func BubbleSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/GNdv7Jg2Taj)</span></b>
@@ -91,12 +91,12 @@ func main() {

 ### <span id="InsertionSort">InsertionSort</span>

-<p>Sort slice with insertion sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with insertion sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func InsertionSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/G5LJiWgJJW6)</span></b>
@@ -117,7 +117,7 @@ type people struct {
 // PeopleAageComparator sort people slice by age field
 type peopleAgeComparator struct{}

-// Compare implements github.com/duke-git/lancet/lancetconstraints/constraints.go/Comparator
+// Compare implements github.com/duke-git/lancet/constraints/constraints.go/Comparator
 func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
    p1, _ := v1.(people)
    p2, _ := v2.(people)
@@ -154,12 +154,12 @@ func main() {

 ### <span id="SelectionSort">SelectionSort</span>

-<p>Sort slice with selection sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with selection sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func SelectionSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/oXovbkekayS)</span></b>
@@ -202,12 +202,12 @@ func main() {

 ### <span id="ShellSort">ShellSort</span>

-<p>Sort slice with shell sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with shell sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func ShellSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/3ibkszpJEu3)</span></b>
@@ -250,12 +250,12 @@ func main() {

 ### <span id="QuickSort">QuickSort</span>

-<p>Sort slice with quick sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with quick sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func QuickSort[T any](slice []T comparator lancetconstraints.Comparator)
+func QuickSort[T any](slice []T comparator constraints.Comparator)
 ```

 <b>Example:<span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/7Y7c1Elk3ax)</span></b>
@@ -298,12 +298,12 @@ func main() {

 ### <span id="HeapSort">HeapSort</span>

-<p>Sort slice with heap sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with heap sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func HeapSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/u6Iwa1VZS_f)</span></b>
@@ -346,12 +346,12 @@ func main() {

 ### <span id="MergeSort">MergeSort</span>

-<p>Sort slice with merge sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with merge sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func MergeSort[T any](slice []T, comparator lancetconstraints.Comparator)
+func MergeSort[T any](slice []T, comparator constraints.Comparator)
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/ydinn9YzUJn)</span></b>
@@ -394,12 +394,12 @@ func main() {

 ### <span id="CountSort">CountSort</span>

-<p>Sort slice with count sort algorithm. Param comparator should implements lancetconstraints.Comparator.</p>
+<p>Sort slice with count sort algorithm. Param comparator should implements constraints.Comparator.</p>

 <b>Signature:</b>

 ```go
-func CountSort[T any](slice []T, comparator lancetconstraints.Comparator) []T
+func CountSort[T any](slice []T, comparator constraints.Comparator) []T
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/tB-Umgm0DrP)</span></b>
@@ -448,7 +448,7 @@ func main() {
 <b>Signature:</b>

 ```go
-func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int
+func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/t6MeGiUSN47)</span></b>
@@ -499,7 +499,7 @@ func main() {
 <b>Signature:</b>

 ```go
-func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int
+func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int
 ```

 <b>Example: <span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/Anozfr8ZLH3)</span></b>
--- a/docs/en/api/packages/datastructure/heap.md
+++ b/docs/en/api/packages/datastructure/heap.md
@@ -44,9 +44,9 @@ MaxHeap is a binary heap tree implemented by slice, The key of the root node is
 ```go
 type MaxHeap[T any] struct {
 	data       []T
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }
-func NewMaxHeap[T any](comparator lancetconstraints.Comparator) *MaxHeap[T]
+func NewMaxHeap[T any](comparator constraints.Comparator) *MaxHeap[T]
 ```
 <b>Example:</b>

--- a/docs/en/api/packages/datastructure/queue.md
+++ b/docs/en/api/packages/datastructure/queue.md
@@ -1100,12 +1100,12 @@ Common queue implemented by slice.
 <b>Signature:</b>

 ```go
-func NewPriorityQueue[T any](capacity int, comparator lancetconstraints.Comparator) *PriorityQueue[T]
+func NewPriorityQueue[T any](capacity int, comparator constraints.Comparator) *PriorityQueue[T]

 type PriorityQueue[T any] struct {
 	items      []T
 	size       int
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }
 ```
 <b>Example:</b>
--- a/docs/en/api/packages/datastructure/tree.md
+++ b/docs/en/api/packages/datastructure/tree.md
@@ -41,7 +41,7 @@ import (
 ## Documentation

 ## 1. BSTree
-BSTree is a binary search tree data structure in which each node has at two children, which are referred to as the left child and the right child. In BSTree: leftNode < rootNode < rightNode. Type T should implements Compare function in lancetconstraints.Comparator interface.
+BSTree is a binary search tree data structure in which each node has at two children, which are referred to as the left child and the right child. In BSTree: leftNode < rootNode < rightNode. Type T should implements Compare function in constraints.Comparator interface.

 ### <span id="NewBSTree">NewBSTree</span>
 <p>Make a BSTree pointer instance</p>
@@ -49,11 +49,11 @@ BSTree is a binary search tree data structure in which each node has at two chil
 <b>Signature:</b>

 ```go
-func NewBSTree[T any](rootData T, comparator lancetconstraints.Comparator) *BSTree[T]
+func NewBSTree[T any](rootData T, comparator constraints.Comparator) *BSTree[T]

 type BSTree[T any] struct {
 	root       *datastructure.TreeNode[T]
-	comparator lancetconstraints.Comparator
+	comparator constraints.Comparator
 }

 type TreeNode[T any] struct {
--- a/docs/en/api/packages/random.md
+++ b/docs/en/api/packages/random.md
@@ -223,7 +223,7 @@ func main() {

 ### <span id="RandSymbolChar">RandSymbolChar</span>

-<p>Generate a random symbol char of specified length. Symbol chars: !@#$%^&*()_+-=[]{}|;':\",./<>?.</p>
+<p>Generate a random symbol char of specified length.</p>

 <b>Signature:</b>

@@ -231,7 +231,7 @@ func main() {
 func RandSymbolChar(length int) string
 ```

-<b>Example:</b>
+<b>Example:<span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/Im6ZJxAykOm)</span></b>

 ```go
 package main
@@ -243,7 +243,7 @@ import (

 func main() {
    randStr := random.RandSymbolChar(6)
-    fmt.Println(randStr) //@#(_")
+    fmt.Println(randStr) // random string like: @#(_")
 }
 ```

@@ -313,7 +313,7 @@ func main() {
 func RandFloat(min, max float64, precision int) float64
 ```

-<b>Example:</b>
+<b>Example:<span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/zbD_tuobJtr)</span></b>

 ```go
 package main
@@ -339,7 +339,7 @@ func main() {
 func RandFloats(n int, min, max float64, precision int) []float64
 ```

-<b>Example:</b>
+<b>Example:<span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/I3yndUQ-rhh)</span></b>

 ```go
 package main
@@ -351,6 +351,6 @@ import (

 func main() {
    floatNumbers := random.RandFloats(5, 1.0, 5.0, 2)
-    fmt.Println(floatNumber) //[3.42 3.99 1.3 2.38 4.23] (random)
+    fmt.Println(floatNumbers) //[3.42 3.99 1.3 2.38 4.23] (random)
 }
 ```
--- a/docs/en/api/packages/slice.md
+++ b/docs/en/api/packages/slice.md
@@ -2498,7 +2498,7 @@ func main() {
 func Random[T any](slice []T) (val T, idx int)
 ```

-<b>Example:<span style="float:right;display:inline-block;">[Run](TODO)</span></b>
+<b>Example:<span style="float:right;display:inline-block;">[Run](https://go.dev/play/p/UzpGQptWppw)</span></b>

 ```go
 import (
--- a/docs/en/api/packages/struct.md
+++ b/docs/en/api/packages/struct.md
@@ -37,6 +37,7 @@ import (
 -   [IsExported](#IsExported)
 -   [IsZero](#IsZero)
 -   [IsSlice](#IsSlice)
+-   [IsTargetType](#IsTargetType)

 <div STYLE="page-break-after: always;"></div>

@@ -533,3 +534,44 @@ func main() {
    // true
 }
 ```
+
+### <span id="IsTargetType">IsTargetType</span>
+
+<p>check if a struct field type is target type or not</p>
+
+<b>Signature:</b>
+
+```go
+func (f *Field) IsTargetType(targetType reflect.Kind) bool
+```
+
+<b>Example:</b>
+
+```go
+package main
+
+import (
+    "fmt"
+    "reflect"
+    "github.com/duke-git/lancet/v2/structs"
+)
+
+func main() {
+    type Parent struct {
+        Name string
+        arr  []int
+    }
+
+    p1 := &Parent{arr: []int{1, 2, 3}}
+    s := structs.New(p1)
+    n, _ := s.Field("Name")
+	a, _ := s.Field("arr")
+    
+    fmt.Println(n.IsTargetType(reflect.String))
+    fmt.Println(a.IsTargetType(reflect.Slice))
+    
+    // Output: 
+    // true
+    // true
+}
+```
--- a/fileutil/file_test.go
+++ b/fileutil/file_test.go
@@ -27,7 +27,7 @@ func TestCreateFile(t *testing.T) {

 	assert := internal.NewAssert(t, "TestCreateFile")

-	f := "./text.txt"
+	f := "./testdata/text.txt"
 	if CreateFile(f) {
 		file, err := os.Open(f)
 		assert.IsNil(err)
--- a/mathutil/mathutil.go
+++ b/mathutil/mathutil.go
@@ -330,10 +330,10 @@ func Cos(radian float64, precision ...int) float64 {
 	return TruncRound(radian, 3)
 }

-// Cos returns the sine of the radian argument.
+// Sin returns the sine of the radian argument.
 // Play: https://go.dev/play/p/TWMQlMywDsP
 func Sin(radian float64, precision ...int) float64 {
-	return Cos((math.Pi / 2) - radian)
+	return Cos((math.Pi/2)-radian, precision...)
 }

 // Log returns the logarithm of base n.
--- a/netutil/net.go
+++ b/netutil/net.go
@@ -230,7 +230,6 @@ func UploadFile(filepath string, server string) (bool, error) {
 }

 // DownloadFile will download the file exist in url to a local file.
-// Play: todo
 func DownloadFile(filepath string, url string) error {
 	resp, err := http.Get(url)
 	if err != nil {
--- a/random/random.go
+++ b/random/random.go
@@ -41,7 +41,7 @@ func RandInt(min, max int) int {
 }

 // RandFloat generate random float64 number between [min, max) with specific precision.
-// Play: todo
+// Play: https://go.dev/play/p/zbD_tuobJtr
 func RandFloat(min, max float64, precision int) float64 {
 	if min == max {
 		return min
@@ -103,7 +103,7 @@ func RandNumeralOrLetter(length int) string {

 // RandSymbolChar generate a random symbol char of specified length.
 // symbol chars: !@#$%^&*()_+-=[]{}|;':\",./<>?.
-// Play: todo
+// Play: https://go.dev/play/p/Im6ZJxAykOm
 func RandSymbolChar(length int) string {
 	return random(SymbolChars, length)
 }
@@ -164,7 +164,7 @@ func RandUniqueIntSlice(n, min, max int) []int {
 }

 // RandFloats generate a slice of random float64 numbers of length n that do not repeat.
-// Play: todo
+// Play: https://go.dev/play/p/I3yndUQ-rhh
 func RandFloats(n int, min, max float64, precision int) []float64 {
 	nums := make([]float64, n)
 	used := make(map[float64]struct{}, n)
--- a/slice/slice.go
+++ b/slice/slice.go
@@ -1232,7 +1232,7 @@ func Partition[T any](slice []T, predicates ...func(item T) bool) [][]T {
 }

 // Random get a random item of slice, return idx=-1 when slice is empty
-// Play: todo
+// Play: https://go.dev/play/p/UzpGQptWppw
 func Random[T any](slice []T) (val T, idx int) {
 	if len(slice) == 0 {
 		return val, -1
--- a/structs/field.go
+++ b/structs/field.go
@@ -68,6 +68,11 @@ func (f *Field) IsSlice() bool {
 	return k == reflect.Slice
 }

+// IsTargetType check if a struct field type is target type or not
+func (f *Field) IsTargetType(targetType reflect.Kind) bool {
+	return f.rvalue.Kind() == targetType
+}
+
 // mapValue covert field value to map
 func (f *Field) mapValue(value any) any {
 	val := pointer.ExtractPointer(value)
--- a/structs/field_test.go
+++ b/structs/field_test.go
@@ -154,6 +154,25 @@ func TestField_IsSlice(t *testing.T) {
 	assert.Equal(true, a.IsSlice())
 }

+func TestField_IsTargetType(t *testing.T) {
+	t.Parallel()
+
+	assert := internal.NewAssert(t, "TestField_IsTargetType")
+
+	type Parent struct {
+		Name string
+		arr  []int
+	}
+
+	p1 := &Parent{Name: "test", arr: []int{1, 2, 3}}
+	s := New(p1)
+	n, _ := s.Field("Name")
+	a, _ := s.Field("arr")
+
+	assert.Equal(true, n.IsTargetType(reflect.String))
+	assert.Equal(true, a.IsTargetType(reflect.Slice))
+}
+
 func TestField_MapValue(t *testing.T) {
 	t.Parallel()

--- a/xerror/xerror_test.go
+++ b/xerror/xerror_test.go
@@ -14,12 +14,6 @@ func TestTryUnwrap(t *testing.T) {

 	assert := internal.NewAssert(t, "TestTryUnwrap")
 	assert.Equal(42, TryUnwrap(strconv.Atoi("42")))
-}
-
-func TestTryUnwrapFail(t *testing.T) {
-	t.Parallel()
-
-	assert := internal.NewAssert(t, "TestTryUnwrapFail")

 	_, err := strconv.Atoi("4o2")
 	defer func() {
@@ -76,8 +70,6 @@ func TestXError_Unwrap(t *testing.T) {
 }

 func TestXError_StackTrace(t *testing.T) {
-	// t.Parallel()
-
 	assert := internal.NewAssert(t, "TestXError_StackTrace")

 	err := New("error")
@@ -86,7 +78,7 @@ func TestXError_StackTrace(t *testing.T) {

 	assert.Equal(3, len(stacks))
 	assert.Equal("github.com/duke-git/lancet/v2/xerror.TestXError_StackTrace", stacks[0].Func)
-	assert.Equal(83, stacks[0].Line)
+	assert.Equal(75, stacks[0].Line)
 	assert.Equal(true, strings.Contains(stacks[0].File, "xerror_test.go"))
 }
Author	SHA1	Message	Date
dudaodong	1b1b10d0ee	merge main branch	2023-12-29 10:17:04 +08:00
Gregory Koganovskiy	c5c3888ffc	Fix typos in README (#154 )	2023-12-29 10:12:29 +08:00
duckjiangwei	11214986cc	add new func & docs error repair (#153 ) * feat: add method IsTargetType() * docs:document error repair	2023-12-28 10:27:32 +08:00
dudaodong	0bc7b83e59	Merge branch 'main' into v2	2023-12-21 10:03:35 +08:00
duckjiangwei	6225418074	improvement:optimize bubble sort (#152 )	2023-12-21 10:02:23 +08:00
dudaodong	ddd265de78	fix: fix comment error	2023-12-19 15:36:07 +08:00
dudaodong	80e48f06ca	refactor: rename lancetconstraints package name to constraints	2023-12-16 19:29:06 +08:00
dudaodong	0b976e9a4c	fix: fix failed unit test	2023-12-11 15:45:02 +08:00
dudaodong	96320069f4	doc: update for release v2.2.8	2023-12-11 15:30:33 +08:00