mirror of https://github.com/panjf2000/ants.git
Bump up go version to test
This commit is contained in:
parent
2a6afefa00
commit
2b08f9fb1b
|
@ -4,9 +4,13 @@ on:
|
|||
push:
|
||||
branches:
|
||||
- master
|
||||
paths-ignore:
|
||||
- '**.md'
|
||||
pull_request:
|
||||
branches:
|
||||
- master
|
||||
paths-ignore:
|
||||
- '**.md'
|
||||
|
||||
env:
|
||||
GO111MODULE: on
|
||||
|
@ -18,7 +22,7 @@ jobs:
|
|||
strategy:
|
||||
fail-fast: false
|
||||
matrix:
|
||||
go: [1.14.x, 1.15.x]
|
||||
go: [1.15.x, 1.16.x]
|
||||
os: [ubuntu-latest, macos-latest, windows-latest]
|
||||
runs-on: ${{ matrix.os}}
|
||||
steps:
|
||||
|
|
|
@ -3,8 +3,12 @@ name: CodeQL
|
|||
on:
|
||||
push:
|
||||
branches: [master]
|
||||
paths-ignore:
|
||||
- '**.md'
|
||||
pull_request:
|
||||
branches: [master]
|
||||
paths-ignore:
|
||||
- '**.md'
|
||||
schedule:
|
||||
- cron: '0 5 * * 6'
|
||||
|
||||
|
|
|
@ -4,9 +4,13 @@ on:
|
|||
push:
|
||||
branches:
|
||||
- master
|
||||
paths-ignore:
|
||||
- '**.md'
|
||||
pull_request:
|
||||
branches:
|
||||
- master
|
||||
paths-ignore:
|
||||
- '**.md'
|
||||
|
||||
jobs:
|
||||
golangci:
|
||||
|
|
10
README.md
10
README.md
|
@ -29,15 +29,9 @@ Library `ants` implements a goroutine pool with fixed capacity, managing and rec
|
|||
- Efficient in memory usage and it even achieves [higher performance](#-performance-summary) than unlimited goroutines in Golang
|
||||
- Nonblocking mechanism
|
||||
|
||||
## ⚔️ Tested in the following Golang versions:
|
||||
## ⚔️ Tested in the following Golang releases:
|
||||
|
||||
- 1.8.x
|
||||
- 1.9.x
|
||||
- 1.10.x
|
||||
- 1.11.x
|
||||
- 1.12.x
|
||||
- 1.13.x
|
||||
- 1.14.x
|
||||
All releases from **Go1.8.x** to **Go1.16.x**.
|
||||
|
||||
## 💡 How `ants` works
|
||||
|
||||
|
|
|
@ -31,13 +31,7 @@
|
|||
|
||||
## ⚔️ 目前测试通过的 Golang 版本:
|
||||
|
||||
- 1.8.x
|
||||
- 1.9.x
|
||||
- 1.10.x
|
||||
- 1.11.x
|
||||
- 1.12.x
|
||||
- 1.13.x
|
||||
- 1.14.x
|
||||
从 **Go 1.8.x** 到 **Go 1.16.x** 的所有版本。
|
||||
|
||||
## 💡 `ants` 是如何运行的
|
||||
|
||||
|
|
Loading…
Reference in New Issue