todo.sr.ht/api/loaders/participantsbyuseridloader_...

225 lines
6.1 KiB
Go

// Code generated by github.com/vektah/dataloaden, DO NOT EDIT.
package loaders
import (
"sync"
"time"
"git.sr.ht/~sircmpwn/todo.sr.ht/api/graph/model"
)
// ParticipantsByUserIDLoaderConfig captures the config to create a new ParticipantsByUserIDLoader
type ParticipantsByUserIDLoaderConfig struct {
// Fetch is a method that provides the data for the loader
Fetch func(keys []int) ([]*model.Participant, []error)
// Wait is how long wait before sending a batch
Wait time.Duration
// MaxBatch will limit the maximum number of keys to send in one batch, 0 = not limit
MaxBatch int
}
// NewParticipantsByUserIDLoader creates a new ParticipantsByUserIDLoader given a fetch, wait, and maxBatch
func NewParticipantsByUserIDLoader(config ParticipantsByUserIDLoaderConfig) *ParticipantsByUserIDLoader {
return &ParticipantsByUserIDLoader{
fetch: config.Fetch,
wait: config.Wait,
maxBatch: config.MaxBatch,
}
}
// ParticipantsByUserIDLoader batches and caches requests
type ParticipantsByUserIDLoader struct {
// this method provides the data for the loader
fetch func(keys []int) ([]*model.Participant, []error)
// how long to done before sending a batch
wait time.Duration
// this will limit the maximum number of keys to send in one batch, 0 = no limit
maxBatch int
// INTERNAL
// lazily created cache
cache map[int]*model.Participant
// the current batch. keys will continue to be collected until timeout is hit,
// then everything will be sent to the fetch method and out to the listeners
batch *participantsByUserIDLoaderBatch
// mutex to prevent races
mu sync.Mutex
}
type participantsByUserIDLoaderBatch struct {
keys []int
data []*model.Participant
error []error
closing bool
done chan struct{}
}
// Load a Participant by key, batching and caching will be applied automatically
func (l *ParticipantsByUserIDLoader) Load(key int) (*model.Participant, error) {
return l.LoadThunk(key)()
}
// LoadThunk returns a function that when called will block waiting for a Participant.
// This method should be used if you want one goroutine to make requests to many
// different data loaders without blocking until the thunk is called.
func (l *ParticipantsByUserIDLoader) LoadThunk(key int) func() (*model.Participant, error) {
l.mu.Lock()
if it, ok := l.cache[key]; ok {
l.mu.Unlock()
return func() (*model.Participant, error) {
return it, nil
}
}
if l.batch == nil {
l.batch = &participantsByUserIDLoaderBatch{done: make(chan struct{})}
}
batch := l.batch
pos := batch.keyIndex(l, key)
l.mu.Unlock()
return func() (*model.Participant, error) {
<-batch.done
var data *model.Participant
if pos < len(batch.data) {
data = batch.data[pos]
}
var err error
// its convenient to be able to return a single error for everything
if len(batch.error) == 1 {
err = batch.error[0]
} else if batch.error != nil {
err = batch.error[pos]
}
if err == nil {
l.mu.Lock()
l.unsafeSet(key, data)
l.mu.Unlock()
}
return data, err
}
}
// LoadAll fetches many keys at once. It will be broken into appropriate sized
// sub batches depending on how the loader is configured
func (l *ParticipantsByUserIDLoader) LoadAll(keys []int) ([]*model.Participant, []error) {
results := make([]func() (*model.Participant, error), len(keys))
for i, key := range keys {
results[i] = l.LoadThunk(key)
}
participants := make([]*model.Participant, len(keys))
errors := make([]error, len(keys))
for i, thunk := range results {
participants[i], errors[i] = thunk()
}
return participants, errors
}
// LoadAllThunk returns a function that when called will block waiting for a Participants.
// This method should be used if you want one goroutine to make requests to many
// different data loaders without blocking until the thunk is called.
func (l *ParticipantsByUserIDLoader) LoadAllThunk(keys []int) func() ([]*model.Participant, []error) {
results := make([]func() (*model.Participant, error), len(keys))
for i, key := range keys {
results[i] = l.LoadThunk(key)
}
return func() ([]*model.Participant, []error) {
participants := make([]*model.Participant, len(keys))
errors := make([]error, len(keys))
for i, thunk := range results {
participants[i], errors[i] = thunk()
}
return participants, errors
}
}
// Prime the cache with the provided key and value. If the key already exists, no change is made
// and false is returned.
// (To forcefully prime the cache, clear the key first with loader.clear(key).prime(key, value).)
func (l *ParticipantsByUserIDLoader) Prime(key int, value *model.Participant) bool {
l.mu.Lock()
var found bool
if _, found = l.cache[key]; !found {
// make a copy when writing to the cache, its easy to pass a pointer in from a loop var
// and end up with the whole cache pointing to the same value.
cpy := *value
l.unsafeSet(key, &cpy)
}
l.mu.Unlock()
return !found
}
// Clear the value at key from the cache, if it exists
func (l *ParticipantsByUserIDLoader) Clear(key int) {
l.mu.Lock()
delete(l.cache, key)
l.mu.Unlock()
}
func (l *ParticipantsByUserIDLoader) unsafeSet(key int, value *model.Participant) {
if l.cache == nil {
l.cache = map[int]*model.Participant{}
}
l.cache[key] = value
}
// keyIndex will return the location of the key in the batch, if its not found
// it will add the key to the batch
func (b *participantsByUserIDLoaderBatch) keyIndex(l *ParticipantsByUserIDLoader, key int) int {
for i, existingKey := range b.keys {
if key == existingKey {
return i
}
}
pos := len(b.keys)
b.keys = append(b.keys, key)
if pos == 0 {
go b.startTimer(l)
}
if l.maxBatch != 0 && pos >= l.maxBatch-1 {
if !b.closing {
b.closing = true
l.batch = nil
go b.end(l)
}
}
return pos
}
func (b *participantsByUserIDLoaderBatch) startTimer(l *ParticipantsByUserIDLoader) {
time.Sleep(l.wait)
l.mu.Lock()
// we must have hit a batch limit and are already finalizing this batch
if b.closing {
l.mu.Unlock()
return
}
l.batch = nil
l.mu.Unlock()
b.end(l)
}
func (b *participantsByUserIDLoaderBatch) end(l *ParticipantsByUserIDLoader) {
b.data, b.error = l.fetch(b.keys)
close(b.done)
}