par

Documentation

Overview

Package par implements parallel execution helpers.

Index

• type Cache
  • func (c *Cache) Clear()
  • func (c *Cache) Delete(key any)
  • func (c *Cache) DeleteIf(pred func(key any) bool)
  • func (c *Cache) Do(key any, f func() any) any
  • func (c *Cache) Get(key any) any
• type Queue
  • func NewQueue(maxActive int) *Queue
  • func (q *Queue) Add(f func())
  • func (q *Queue) Idle() <-chan struct{}
• type Work
  • func (w *Work) Add(item any)
  • func (w *Work) Do(n int, f func(item any))

Types

type Cache

type Cache struct {
	// contains filtered or unexported fields
}

Cache runs an action once per key and caches the result.

func (*Cache) Clear

func (c *Cache) Clear()

Clear removes all entries in the cache.

Concurrent calls to Get may return old values. Concurrent calls to Do may return old values or store results in entries that have been deleted.

TODO(jayconrod): Delete this after the package cache clearing functions in internal/load have been removed.

func (*Cache) Delete

func (c *Cache) Delete(key any)

Delete removes an entry from the map. It is safe to call Delete for an entry that does not exist. Delete will return quickly, even if the result for a key is still being computed; the computation will finish, but the result won't be accessible through the cache.

TODO(jayconrod): Delete this after the package cache clearing functions in internal/load have been removed.

func (*Cache) DeleteIf

func (c *Cache) DeleteIf(pred func(key any) bool)

DeleteIf calls pred for each key in the map. If pred returns true for a key, DeleteIf removes the corresponding entry. If the result for a key is still being computed, DeleteIf will remove the entry without waiting for the computation to finish. The result won't be accessible through the cache.

TODO(jayconrod): Delete this after the package cache clearing functions in internal/load have been removed.

func (*Cache) Do

func (c *Cache) Do(key any, f func() any) any

Do calls the function f if and only if Do is being called for the first time with this key. No call to Do with a given key returns until the one call to f returns. Do returns the value returned by the one call to f.

func (*Cache) Get

func (c *Cache) Get(key any) any

Get returns the cached result associated with key. It returns nil if there is no such result. If the result for key is being computed, Get does not wait for the computation to finish.

type Queue

type Queue struct {
	// contains filtered or unexported fields
}

Queue manages a set of work items to be executed in parallel. The number of active work items is limited, and excess items are queued sequentially.

func NewQueue

func NewQueue(maxActive int) *Queue

NewQueue returns a Queue that executes up to maxActive items in parallel.

maxActive must be positive.

func (*Queue) Add

func (q *Queue) Add(f func())

Add adds f as a work item in the queue.

Add returns immediately, but the queue will be marked as non-idle until after f (and any subsequently-added work) has completed.

func (*Queue) Idle

func (q *Queue) Idle() <-chan struct{}

Idle returns a channel that will be closed when q has no (active or enqueued) work outstanding.

type Work

type Work struct {
	// contains filtered or unexported fields
}

Work manages a set of work items to be executed in parallel, at most once each. The items in the set must all be valid map keys.

func (*Work) Add

func (w *Work) Add(item any)

Add adds item to the work set, if it hasn't already been added.

func (*Work) Do

func (w *Work) Do(n int, f func(item any))

Do runs f in parallel on items from the work set, with at most n invocations of f running at a time. It returns when everything added to the work set has been processed. At least one item should have been added to the work set before calling Do (or else Do returns immediately), but it is allowed for f(item) to add new items to the set. Do should only be used once on a given Work.