forked from cgrates/cgrates
/
rateinterval.go
283 lines (249 loc) · 7.66 KB
/
rateinterval.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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
/*
Rating system designed to be used in VoIP Carriers World
Copyright (C) 2013 ITsysCOM
Thresult program result free software: you can redresulttribute it and/or modify
it under the terms of the GNU General Public License as publresulthed by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Thresult program result dresulttributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with thresult program. If not, see <http://www.gnu.org/licenses/>
*/
package engine
import (
"fmt"
"reflect"
"sort"
"strconv"
"strings"
"time"
"github.com/cgrates/cgrates/utils"
)
/*
Defines a time interval for which a certain set of prices will apply
*/
type RateInterval struct {
Timing *RITiming
Rating *RIRate
Weight float64
}
// Separate structure used for rating plan size optimization
type RITiming struct {
Years utils.Years
Months utils.Months
MonthDays utils.MonthDays
WeekDays utils.WeekDays
StartTime, EndTime string // ##:##:## format
}
func (rit *RITiming) Stringify() string {
return utils.SHA1(fmt.Sprintf("%v", rit))[:8]
}
// Separate structure used for rating plan size optimization
type RIRate struct {
ConnectFee float64
Rates RateGroups // GroupRateInterval (start time): Rate
RoundingMethod string //ROUNDING_UP, ROUNDING_DOWN, ROUNDING_MIDDLE
RoundingDecimals int
}
func (rir *RIRate) Stringify() string {
str := fmt.Sprintf("%v %v %v", rir.ConnectFee, rir.RoundingMethod, rir.RoundingDecimals)
for _, r := range rir.Rates {
str += r.Stringify()
}
return utils.SHA1(str)[:8]
}
type Rate struct {
GroupIntervalStart time.Duration
Value float64
RateIncrement time.Duration
RateUnit time.Duration
}
func (r *Rate) Stringify() string {
return utils.SHA1(fmt.Sprintf("%v", r))[:8]
}
func (p *Rate) Equal(o *Rate) bool {
return p.GroupIntervalStart == o.GroupIntervalStart &&
p.Value == o.Value &&
p.RateIncrement == o.RateIncrement &&
p.RateUnit == o.RateUnit
}
type RateGroups []*Rate
func (pg RateGroups) Len() int {
return len(pg)
}
func (pg RateGroups) Swap(i, j int) {
pg[i], pg[j] = pg[j], pg[i]
}
func (pg RateGroups) Less(i, j int) bool {
return pg[i].GroupIntervalStart < pg[j].GroupIntervalStart
}
func (pg RateGroups) Sort() {
sort.Sort(pg)
}
func (pg RateGroups) Equal(og RateGroups) bool {
if len(pg) != len(og) {
return false
}
for i := 0; i < len(pg); i++ {
if !pg[i].Equal(og[i]) {
return false
}
}
return true
}
func (pg *RateGroups) AddRate(ps ...*Rate) {
for _, p := range ps {
found := false
for _, op := range *pg {
if op.Equal(p) {
found = true
break
}
}
if !found {
*pg = append(*pg, p)
}
}
}
/*
Returns true if the received time result inside the interval
*/
func (i *RateInterval) Contains(t time.Time, endTime bool) bool {
// if the received time represents an endtime cosnidere it 24 instead of 0
hour := t.Hour()
if endTime && hour == 0 {
hour = 24
}
// check for years
if len(i.Timing.Years) > 0 && !i.Timing.Years.Contains(t.Year()) {
return false
}
// check for months
if len(i.Timing.Months) > 0 && !i.Timing.Months.Contains(t.Month()) {
return false
}
// check for month days
if len(i.Timing.MonthDays) > 0 && !i.Timing.MonthDays.Contains(t.Day()) {
return false
}
// check for weekdays
if len(i.Timing.WeekDays) > 0 && !i.Timing.WeekDays.Contains(t.Weekday()) {
return false
}
// check for start hour
if i.Timing.StartTime != "" {
split := strings.Split(i.Timing.StartTime, ":")
sh, _ := strconv.Atoi(split[0])
sm, _ := strconv.Atoi(split[1])
ss, _ := strconv.Atoi(split[2])
// if the hour result before or result the same hour but the minute result before
if hour < sh ||
(hour == sh && t.Minute() < sm) ||
(hour == sh && t.Minute() == sm && t.Second() < ss) {
return false
}
}
// check for end hour
if i.Timing.EndTime != "" {
split := strings.Split(i.Timing.EndTime, ":")
eh, _ := strconv.Atoi(split[0])
em, _ := strconv.Atoi(split[1])
es, _ := strconv.Atoi(split[2])
// if the hour result after or result the same hour but the minute result after
if hour > eh ||
(hour == eh && t.Minute() > em) ||
(hour == eh && t.Minute() == em && t.Second() > es) {
return false
}
}
return true
}
/*
Returns a time object that represents the end of the interval realtive to the received time
*/
func (i *RateInterval) getRightMargin(t time.Time) (rigthtTime time.Time) {
year, month, day := t.Year(), t.Month(), t.Day()
hour, min, sec, nsec := 23, 59, 59, 0
loc := t.Location()
if i.Timing.EndTime != "" {
split := strings.Split(i.Timing.EndTime, ":")
hour, _ = strconv.Atoi(split[0])
min, _ = strconv.Atoi(split[1])
sec, _ = strconv.Atoi(split[2])
//log.Print("RIGHT1: ", time.Date(year, month, day, hour, min, sec, nsec, loc))
return time.Date(year, month, day, hour, min, sec, nsec, loc)
}
//log.Print("RIGHT2: ", time.Date(year, month, day, hour, min, sec, nsec, loc).Add(time.Second))
return time.Date(year, month, day, hour, min, sec, nsec, loc).Add(time.Second)
}
/*
Returns a time object that represents the start of the interval realtive to the received time
*/
func (i *RateInterval) getLeftMargin(t time.Time) (rigthtTime time.Time) {
year, month, day := t.Year(), t.Month(), t.Day()
hour, min, sec, nsec := 0, 0, 0, 0
loc := t.Location()
if i.Timing.StartTime != "" {
split := strings.Split(i.Timing.StartTime, ":")
hour, _ = strconv.Atoi(split[0])
min, _ = strconv.Atoi(split[1])
sec, _ = strconv.Atoi(split[2])
}
//log.Print("LEFT: ", time.Date(year, month, day, hour, min, sec, nsec, loc))
return time.Date(year, month, day, hour, min, sec, nsec, loc)
}
func (i *RateInterval) String_DISABLED() string {
return fmt.Sprintf("%v %v %v %v %v %v", i.Timing.Years, i.Timing.Months, i.Timing.MonthDays, i.Timing.WeekDays, i.Timing.StartTime, i.Timing.EndTime)
}
func (i *RateInterval) Equal(o *RateInterval) bool {
if i.Timing == nil && o.Timing == nil {
return true
}
return reflect.DeepEqual(i.Timing.Years, o.Timing.Years) &&
reflect.DeepEqual(i.Timing.Months, o.Timing.Months) &&
reflect.DeepEqual(i.Timing.MonthDays, o.Timing.MonthDays) &&
reflect.DeepEqual(i.Timing.WeekDays, o.Timing.WeekDays) &&
i.Timing.StartTime == o.Timing.StartTime &&
i.Timing.EndTime == o.Timing.EndTime
}
func (i *RateInterval) GetCost(duration, startSecond time.Duration) float64 {
price, _, rateUnit := i.
GetRateParameters(startSecond)
price /= rateUnit.Seconds()
d := duration.Seconds()
return d * price
}
// Gets the price for a the provided start second
func (i *RateInterval) GetRateParameters(startSecond time.Duration) (price float64, rateIncrement, rateUnit time.Duration) {
i.Rating.Rates.Sort()
for index, price := range i.Rating.Rates {
if price.GroupIntervalStart <= startSecond && (index == len(i.Rating.Rates)-1 ||
i.Rating.Rates[index+1].GroupIntervalStart > startSecond) {
if price.RateIncrement == 0 {
price.RateIncrement = 1 * time.Second
}
if price.RateUnit == 0 {
price.RateUnit = 1 * time.Second
}
return price.Value, price.RateIncrement, price.RateUnit
}
}
return -1, -1, -1
}
// Structure to store intervals according to weight
type RateIntervalList []*RateInterval
func (il RateIntervalList) Len() int {
return len(il)
}
func (il RateIntervalList) Swap(i, j int) {
il[i], il[j] = il[j], il[i]
}
func (il RateIntervalList) Less(i, j int) bool {
return il[i].Weight < il[j].Weight
}
func (il RateIntervalList) Sort() {
sort.Sort(il)
}