-
Notifications
You must be signed in to change notification settings - Fork 1
/
lifestyle.go
216 lines (185 loc) · 4.22 KB
/
lifestyle.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
package miruken
import (
"fmt"
"math"
"reflect"
"sync"
"sync/atomic"
"github.com/miruken-go/miruken/internal"
"github.com/miruken-go/miruken/promise"
)
type (
// Lifestyle provides common lifestyle functionality.
Lifestyle struct{}
// LifestyleProvider is a FilterProvider of lifestyles.
LifestyleProvider struct {
filters []Filter
}
// LifestyleInit initializes a Lifestyle from Binding info.
LifestyleInit interface {
InitLifestyle(Binding) error
}
)
// Lifestyle
func (l *Lifestyle) Order() int {
return math.MaxInt32 - 1000
}
// LifestyleProvider
func (l *LifestyleProvider) Required() bool {
return true
}
func (l *LifestyleProvider) AppliesTo(
callback Callback,
) bool {
_, ok := callback.(*Provides)
return ok
}
func (l *LifestyleProvider) Filters(
binding Binding,
callback any,
composer Handler,
) ([]Filter, error) {
return l.filters, nil
}
func (l *LifestyleProvider) FiltersAssigned() bool {
return l.filters != nil
}
func (l *LifestyleProvider) SetFilters(filters ...Filter) {
l.filters = filters
}
// Single
type (
// Single LifestyleProvider providing same instance.
Single struct {
LifestyleProvider
covar bool
}
// singleEntry stores a lazy instance.
singleEntry struct {
instance []any
once *sync.Once
}
// singleCache maintains a cache of singleEntry's.
singleCache map[any]*singleEntry
// single is a Filter that caches a known instance.
single struct {
Lifestyle
entry singleEntry
}
// singleCovar is a Filter that caches covariant instances.
// When a Handler provides covariant results, a map of key to
// instance is maintained using copy-on-write idiom.
singleCovar struct {
Lifestyle
keys atomic.Pointer[singleCache]
lock sync.Mutex
}
)
// Single
func (s *Single) InitWithTag(tag reflect.StructTag) error {
if mode, ok := tag.Lookup("mode"); ok {
s.covar = mode == "covariant"
}
return nil
}
func (s *Single) InitLifestyle(binding Binding) error {
if !s.FiltersAssigned() {
covar := s.covar
if !covar {
typ, ok := binding.Key().(reflect.Type)
covar = ok && internal.IsAny(typ)
}
if covar {
s.SetFilters(&singleCovar{})
} else {
s.SetFilters(&single{entry: singleEntry{once: new(sync.Once)}})
}
}
return nil
}
// single
func (s *single) Next(
self Filter,
next Next,
ctx HandleContext,
provider FilterProvider,
) (out []any, po *promise.Promise[[]any], err error) {
return s.entry.get(next)
}
// singleCovar
func (s *singleCovar) Next(
self Filter,
next Next,
ctx HandleContext,
provider FilterProvider,
) (out []any, po *promise.Promise[[]any], err error) {
key := ctx.Callback.(*Provides).Key()
var entry *singleEntry
if keys := s.keys.Load(); keys != nil {
if e, ok := (*keys)[key]; ok {
entry = e
}
}
// Use copy-on-write idiom since reads should be more frequent than writes.
if entry == nil {
s.lock.Lock()
if keys := s.keys.Load(); keys != nil {
if entry = (*keys)[key]; entry == nil {
kc := make(singleCache, len(*keys)+1)
typ, assignable := key.(reflect.Type)
// If the key is not found, check if any existing instances
// can satisfy the key before a new instance is provided.
for k, v := range *keys {
kc[k] = v
if assignable {
if instance := v.instance; len(instance) > 0 {
if o := instance[0]; o != nil {
if ot := reflect.TypeOf(o); ot.AssignableTo(typ) {
entry = v
kc[key] = v
break
}
}
}
}
}
if entry == nil {
entry = &singleEntry{once: new(sync.Once)}
kc[key] = entry
}
s.keys.Store(&kc)
}
} else {
entry = &singleEntry{once: new(sync.Once)}
s.keys.Store(&singleCache{key: entry})
}
s.lock.Unlock()
}
return entry.get(next)
}
// singleEntry
func (s *singleEntry) get(
next Next,
) (out []any, po *promise.Promise[[]any], err error) {
s.once.Do(func() {
defer func() {
if r := recover(); r != nil {
if e, ok := r.(error); ok {
err = e
} else {
err = fmt.Errorf("single: panic: %v", r)
}
s.once = new(sync.Once)
}
}()
if out, po, err = next.Pipe(); err == nil && po != nil {
out, err = po.Await()
}
if err != nil || len(out) == 0 {
s.once = new(sync.Once)
} else {
s.instance = out
}
})
return s.instance, nil, err
}