#1 pond
Minimalistic and High-performance goroutine worker pool written in Go.
Package goworker is a Resque-compatible, Go-based background worker.
Health score 48/100, confidence 80/100.
| Latest version | v0.1.3 |
| Imported by | 108 packages |
| Stars | 0 |
| Forks | 0 |
| Last activity | 9 years ago |
| Latest release | Unknown |
| License | Unknown |
| Known vuln records | 0 |
| Symbol | Kind | Synopsis |
|---|---|---|
| Job | Type | type Job struct{ ... } |
| Job.Payload | Field | Payload Payload |
| Job.Queue | Field | Queue string |
| Payload | Type | type Payload struct{ ... } |
| Payload.Args | Field | Args []interface{} |
| Payload.Class | Field | Class string |
| RedisConn | Type | type RedisConn struct{ ... } |
| GetConn | Function | func GetConn() (*RedisConn, error) |
| RedisConn.Close | Method | func (r *RedisConn) Close() |
| WorkerSettings | Type | type WorkerSettings struct{ ... } |
| WorkerSettings.Concurrency | Field | Concurrency int |
| WorkerSettings.Connections | Field | Connections int |
Minimalistic and High-performance goroutine worker pool written in Go.
Package asynq provides a framework for Redis based distrubted task queue.
Package queue provides multiple thread-safe generic queue implementations.
Package gocelery is Celery Distributed Task Queue in Go Celery distributed tasks are used heavily in many python web applications and this library allows you to implement celery workers in Go as well as being able to submit celery tasks in Go.
Package deheap provides a doubly-ended heap (min-max heap).
Minimalistic and High-performance goroutine worker pool written in Go.
Package asynq provides a framework for Redis based distrubted task queue.
Package queue provides multiple thread-safe generic queue implementations.
Package gocelery is Celery Distributed Task Queue in Go Celery distributed tasks are used heavily in many python web applications and this library allows you to implement celery workers in Go as well as being able to submit celery tasks in Go.
Package deheap provides a doubly-ended heap (min-max heap).