mirror of
https://github.com/cgrates/cgrates.git
synced 2026-02-17 14:19:54 +05:00
87 lines
1.8 KiB
Go
87 lines
1.8 KiB
Go
/*
|
|
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
|
|
}
|