/
mix_sort_strategy.go
226 lines (184 loc) · 4.86 KB
/
mix_sort_strategy.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
217
218
219
220
221
222
223
224
225
226
package sort
import (
"math/rand"
"github.com/alibaba/pairec/module"
"github.com/alibaba/pairec/recconf"
"github.com/alibaba/pairec/utils"
)
type MixSortStrategyType int
const (
FixPositionStrategyType MixSortStrategyType = 1
RandomPositionStrategyType MixSortStrategyType = 2
DefaultStrategyType MixSortStrategyType = 3
)
type MixSortStrategy interface {
ContainsRecallName(name string) bool
AppendItem(item *module.Item)
IsFull() bool
GetStrategyType() MixSortStrategyType
BuildItems(items []*module.Item) []*module.Item
Evaluate(properties map[string]interface{}) (bool, error)
EvaluateByDomain(userProperties, itemProperties map[string]interface{}) (bool, error)
IsUseCondition() bool
}
type mixSortStrategy struct {
number int
totalSize int
index int
strategyType MixSortStrategyType
recallNameMap map[string]bool
items []*module.Item
filterParam *module.FilterParam
}
func (s *mixSortStrategy) ContainsRecallName(name string) bool {
if s.strategyType == DefaultStrategyType {
return true
}
if _, ok := s.recallNameMap[name]; ok {
return true
}
return false
}
func (s *mixSortStrategy) Evaluate(properties map[string]interface{}) (bool, error) {
ok, err := s.filterParam.Evaluate(properties)
if err != nil {
return false, err
}
return ok, nil
}
func (s *mixSortStrategy) EvaluateByDomain(userProperties, itemProperties map[string]interface{}) (bool, error) {
ok, err := s.filterParam.EvaluateByDomain(userProperties, itemProperties)
if err != nil {
return false, err
}
return ok, nil
}
func (s *mixSortStrategy) AppendItem(item *module.Item) {
if len(s.items) == s.number {
return
}
s.items = append(s.items, item)
}
func (s *mixSortStrategy) IsFull() bool {
return len(s.items) >= s.number
}
func (s *mixSortStrategy) IsUseCondition() bool {
/**
if s.filterParam != nil {
return true
}
return false
**/
return s.filterParam != nil
}
func (s *mixSortStrategy) GetStrategyType() MixSortStrategyType {
return s.strategyType
}
func newMixSortStrategy(config *recconf.MixSortConfig) *mixSortStrategy {
strategy := mixSortStrategy{
number: 0,
index: 0,
recallNameMap: make(map[string]bool),
}
if config != nil {
for _, name := range config.RecallNames {
strategy.recallNameMap[name] = true
}
}
if config != nil {
if len(config.Conditions) > 0 {
filterParam := module.NewFilterParamWithConfig(config.Conditions)
strategy.filterParam = filterParam
}
}
return &strategy
}
type fixPositionStrategy struct {
*mixSortStrategy
positions []int
positionField string
}
func newFixPositionStrategy(config *recconf.MixSortConfig) *fixPositionStrategy {
strategy := fixPositionStrategy{
positions: config.Positions,
positionField: config.PositionField,
mixSortStrategy: newMixSortStrategy(config),
}
strategy.number = len(strategy.positions)
if strategy.number == 0 && config.Number > 0 {
strategy.number = config.Number
}
strategy.strategyType = FixPositionStrategyType
return &strategy
}
func (s *fixPositionStrategy) BuildItems(items []*module.Item) []*module.Item {
if len(s.positions) == 0 && s.positionField != "" {
for i := 0; i < s.number; i++ {
if i < len(s.items) {
if p := utils.ToInt(s.items[i].GetProperty(s.positionField), -1); p > 0 {
s.positions = append(s.positions, p)
}
}
}
}
for _, pos := range s.positions {
if pos <= s.totalSize && s.index < len(s.items) {
items[pos-1] = s.items[s.index]
s.index++
}
}
return items
}
type randomPositionStrategy struct {
*mixSortStrategy
}
func newRandomPositionStrategy(config *recconf.MixSortConfig, size int) *randomPositionStrategy {
strategy := randomPositionStrategy{
mixSortStrategy: newMixSortStrategy(config),
}
if config.NumberRate > float64(0) {
strategy.number = int(float64(size) * config.NumberRate)
} else if config.Number > 0 {
strategy.number = config.Number
}
strategy.strategyType = RandomPositionStrategyType
return &strategy
}
func (s *randomPositionStrategy) BuildItems(items []*module.Item) []*module.Item {
start := 0
end := 0
for _, item := range s.items {
end = start + rand.Intn(s.totalSize/s.number)
if end >= s.totalSize {
end = s.totalSize - 1
}
for items[end] != nil {
end++
end = end % s.totalSize
}
items[end] = item
start += s.totalSize / s.number
}
return items
}
type defaultStrategy struct {
*mixSortStrategy
}
func newDefaultStrategy(config *recconf.MixSortConfig, size int) *defaultStrategy {
strategy := defaultStrategy{
mixSortStrategy: newMixSortStrategy(config),
}
strategy.totalSize = size
strategy.number = size
strategy.strategyType = DefaultStrategyType
return &strategy
}
func (s *defaultStrategy) BuildItems(items []*module.Item) []*module.Item {
for i, item := range items {
if item == nil && s.index < len(s.items) {
items[i] = s.items[s.index]
s.index++
}
}
return items
}