+0
Daily
+0
Weekly
+0
Monthly
5,300
stars
518
forks
43
watchers
217
prs
133
issues
100
releases
README
!Go version
Lancet is a comprehensive, efficient, and reusable util function library of go. Inspired by the java apache common package and lodash.js.
Website | 简体中文
Features
- 👏 Comprehensive, efficient and reusable.
- 💪 700+ go util functions, support string, slice, datetime, net, crypt...
- 💅 Only depends on two kinds of libraries: go standard library and golang.org/x.
- 🌍 Unit test for every exported function.
Installation
Note:
1. 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.
go
go get github.com/duke-git/lancet/v2 // will install latest version of v2.x.x
2. For users who use version below go1.18, you should install v1.x.x. The latest of v1.x.x is v1.4.6.
go
go get github.com/duke-git/lancet // below go1.18, install latest version of v1.x.x
Usage
Lancet organizes the code into package structure, and you need to import the corresponding package name when use it. For example, if you use string-related functions,import the strutil package like below:
go
import "github.com/duke-git/lancet/v2/strutil"
Example
Here takes the string function Reverse (reverse order string) as an example, and the strutil package needs to be imported.
go
package main
import (
"fmt"
"github.com/duke-git/lancet/v2/strutil"
)
func main() {
s := "hello"
rs := strutil.Reverse(s)
fmt.Println(rs) //olleh
}
Documentation
Index
- Algorithm
- Compare
- Concurrency
- Condition
- Convertor
- Cryptor
- Datetime
- Datastructure
- EventBus
- Enum
- Fileutil
- Formatter
- Function
- Maputil
- Mathutil
- Netutil
- Pointer
- Random
- Retry
- Slice
- Stream
- Structs
- Strutil
- System
- Tuple
- Validator
- Xerror
1. Algorithm package implements some basic algorithm. eg. sort, search. index
go
import "github.com/duke-git/lancet/v2/algorithm"
Function list:
- BubbleSort : sorts slice with bubble sort algorithm, will change the original slice.
[doc]
[play]
- CountSort : sorts slice with bubble sort algorithm, don't change original slice.
[doc]
[play]
- HeapSort : sorts slice with heap sort algorithm, will change the original slice.
[doc]
[play]
- InsertionSort : sorts slice with insertion sort algorithm, will change the original slice.
[doc]
[play]
- MergeSort : sorts slice with merge sort algorithm, will change the original slice.
[doc]
[play]
- QuickSort : sorts slice with quick sort algorithm, will change the original slice.
[doc]
[play]
- SelectionSort : sorts slice with selection sort algorithm, will change the original slice.
[doc]
[play]
- ShellSort : sorts slice with shell sort algorithm, will change the original slice.
[doc]
[play]
- BinarySearch : returns the index of target within a sorted slice, use binary search (recursive call itself).
[doc]
[play]
- BinaryIterativeSearch : returns the index of target within a sorted slice, use binary