/* Real-time Online/Offline Charging System (OCS) for Telecom & ISP environments Copyright (C) ITsysCOM GmbH 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 */ package engine import ( "strings" "github.com/cgrates/cgrates/utils" ) func NewDestinationFromTPDestination(tpDst *utils.TPDestination) *Destination { return &Destination{Id: tpDst.ID, Prefixes: tpDst.Prefixes} } /* Structure that gathers multiple destination prefixes under a common id. */ type Destination struct { Id string Prefixes []string } // returns prefix precision func (d *Destination) containsPrefix(prefix string) int { if d == nil { return 0 } for _, p := range d.Prefixes { if strings.Index(prefix, p) == 0 { return len(p) } } return 0 } func (d *Destination) String() (result string) { result = d.Id + ": " for _, k := range d.Prefixes { result += k + ", " } result = strings.TrimRight(result, ", ") return result } func (d *Destination) AddPrefix(pfx string) { d.Prefixes = append(d.Prefixes, pfx) } // Reverse search in cache to see if prefix belongs to destination id func CachedDestHasPrefix(destId, prefix string) bool { if cached, err := dm.DataDB().GetReverseDestination(prefix, false, utils.NonTransactional); err == nil { return utils.IsSliceMember(cached, destId) } return false } /*func CleanStalePrefixes(destIds []string) { utils.Logger.Info("Cleaning stale dest prefixes: " + utils.ToJSON(destIds)) prefixMap := cache.GetAllEntries(utils.REVERSE_DESTINATION_PREFIX) for prefix, idIDs := range prefixMap { dIDs := idIDs.(map[string]struct{}) changed := false for _, searchedDID := range destIds { if _, found := dIDs[searchedDID]; found { if len(dIDs) == 1 { // remove de prefix from cache cache.RemKey(utils.REVERSE_DESTINATION_PREFIX + prefix) } else { // delete the destination from list and put the new list in chache delete(dIDs, searchedDID) changed = true } } } if changed { cache.Set(utils.REVERSE_DESTINATION_PREFIX+prefix, dIDs) } } } */