645a817685
Go 1.22 introduced a new [for-range](https://go.dev/ref/spec#For_range) construct that looks a tad better than the usual `for i := 0; i < N; i++` construct. I also tool the liberty of replacing some `for i := 0; i < len(myitemsarray); i++ { … myitemsarray[i] …}` with `for item := range myitemsarray` when `myitemsarray` contains only pointers.
35 lines
770 B
Go
35 lines
770 B
Go
// SPDX-FileCopyrightText: Copyright The Miniflux Authors. All rights reserved.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
package worker // import "miniflux.app/v2/internal/worker"
|
|
|
|
import (
|
|
"miniflux.app/v2/internal/model"
|
|
"miniflux.app/v2/internal/storage"
|
|
)
|
|
|
|
// Pool handles a pool of workers.
|
|
type Pool struct {
|
|
queue chan model.Job
|
|
}
|
|
|
|
// Push send a list of jobs to the queue.
|
|
func (p *Pool) Push(jobs model.JobList) {
|
|
for _, job := range jobs {
|
|
p.queue <- job
|
|
}
|
|
}
|
|
|
|
// NewPool creates a pool of background workers.
|
|
func NewPool(store *storage.Storage, nbWorkers int) *Pool {
|
|
workerPool := &Pool{
|
|
queue: make(chan model.Job),
|
|
}
|
|
|
|
for i := range nbWorkers {
|
|
worker := &Worker{id: i, store: store}
|
|
go worker.Run(workerPool.queue)
|
|
}
|
|
|
|
return workerPool
|
|
}
|