/
scribe.go
86 lines (71 loc) · 1.77 KB
/
scribe.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
/*
Rating system designed to be used in VoIP Carriers World
Copyright (C) 2013 ITsysCOM
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed 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 this program. If not, see <http://www.gnu.org/licenses/>
*/
package history
import (
"sort"
)
const (
RATING_PLAN_PREFIX = "rpl_"
RATING_PROFILE_PREFIX = "rpf_"
DESTINATION_PREFIX = "dst_"
)
type Scribe interface {
Record(record *Record, out *int) error
}
type Record struct {
Key string
Object interface{}
}
type records []*Record
func (rs records) Len() int {
return len(rs)
}
func (rs records) Swap(i, j int) {
rs[i], rs[j] = rs[j], rs[i]
}
func (rs records) Less(i, j int) bool {
return rs[i].Key < rs[j].Key
}
func (rs records) Sort() {
sort.Sort(rs)
}
func (rs records) SetOrAdd(rec *Record) records {
//rs.Sort()
n := len(rs)
i := sort.Search(n, func(i int) bool { return rs[i].Key >= rec.Key })
if i < n && rs[i].Key == rec.Key {
rs[i].Object = rec.Object
} else {
// i is the index where it would be inserted.
rs = append(rs, nil)
copy(rs[i+1:], rs[i:])
rs[i] = rec
}
return rs
}
func (rs records) SetOrAddOld(rec *Record) records {
found := false
for _, r := range rs {
if r.Key == rec.Key {
found = true
r.Object = rec.Object
return rs
}
}
if !found {
rs = append(rs, rec)
}
return rs
}