mirror of
https://github.com/cgrates/cgrates.git
synced 2026-02-11 18:16:24 +05:00
59 lines
1.8 KiB
Go
59 lines
1.8 KiB
Go
/*
|
|
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 Affero 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 Affero General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Affero General Public License
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>
|
|
*/
|
|
|
|
package engine
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/cgrates/cgrates/utils"
|
|
)
|
|
|
|
func NewLeastCostSorter(rS *RouteService) *LeastCostSorter {
|
|
return &LeastCostSorter{rS: rS,
|
|
sorting: utils.MetaLC}
|
|
}
|
|
|
|
// LeastCostSorter sorts routes based on their cost
|
|
type LeastCostSorter struct {
|
|
sorting string
|
|
rS *RouteService
|
|
}
|
|
|
|
func (lcs *LeastCostSorter) SortRoutes(prflID string, routes map[string]*Route,
|
|
ev *utils.CGREvent, extraOpts *optsGetRoutes) (sortedRoutes *SortedRoutes, err error) {
|
|
sortedRoutes = &SortedRoutes{ProfileID: prflID,
|
|
Sorting: lcs.sorting,
|
|
Routes: make([]*SortedRoute, 0)}
|
|
for _, s := range routes {
|
|
if len(s.RatingPlanIDs) == 0 && len(s.AccountIDs) == 0 {
|
|
utils.Logger.Warning(
|
|
fmt.Sprintf("<%s> supplier: <%s> - empty RatingPlanIDs or AccountIDs",
|
|
utils.RouteS, s.ID))
|
|
return nil, utils.NewErrMandatoryIeMissing("RatingPlanIDs or AccountIDs")
|
|
}
|
|
if srtSpl, pass, err := lcs.rS.populateSortingData(ev, s, extraOpts); err != nil {
|
|
return nil, err
|
|
} else if pass && srtSpl != nil {
|
|
sortedRoutes.Routes = append(sortedRoutes.Routes, srtSpl)
|
|
}
|
|
}
|
|
sortedRoutes.SortLeastCost()
|
|
return
|
|
}
|