-
Notifications
You must be signed in to change notification settings - Fork 0
/
chain.go
50 lines (41 loc) · 1.32 KB
/
chain.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
package loader
import (
"context"
"github.com/graph-gophers/dataloader"
"github.com/O1MaGnUmO1/erinaceus-vrf/core/chains"
"github.com/O1MaGnUmO1/erinaceus-vrf/core/services/erinaceus"
"github.com/O1MaGnUmO1/erinaceus-vrf/core/services/relay"
)
type chainBatcher struct {
app erinaceus.Application
}
func (b *chainBatcher) loadByIDs(_ context.Context, keys dataloader.Keys) []*dataloader.Result {
// Create a map for remembering the order of keys passed in
keyOrder := make(map[string]int, len(keys))
// Collect the keys to search for
var chainIDs []relay.ChainID
for ix, key := range keys {
chainIDs = append(chainIDs, relay.ChainID(key.String()))
keyOrder[key.String()] = ix
}
// Fetch the chains
cs, _, err := b.app.EVMORM().Chains(chainIDs...)
if err != nil {
return []*dataloader.Result{{Data: nil, Error: err}}
}
// Construct the output array of dataloader results
results := make([]*dataloader.Result, len(keys))
for _, c := range cs {
ix, ok := keyOrder[c.ID]
// if found, remove from index lookup map, so we know elements were found
if ok {
results[ix] = &dataloader.Result{Data: c, Error: nil}
delete(keyOrder, c.ID)
}
}
// fill array positions without any nodes
for _, ix := range keyOrder {
results[ix] = &dataloader.Result{Data: nil, Error: chains.ErrNotFound}
}
return results
}