(predicateList []*eskip.Predicate)
| 445 | } |
| 446 | |
| 447 | func validTreePredicates(predicateList []*eskip.Predicate) bool { |
| 448 | var has bool |
| 449 | for _, p := range predicateList { |
| 450 | switch p.Name { |
| 451 | case predicates.PathName, predicates.PathSubtreeName: |
| 452 | if has { |
| 453 | return false |
| 454 | } |
| 455 | has = true |
| 456 | } |
| 457 | } |
| 458 | return true |
| 459 | } |
| 460 | |
| 461 | // processes path tree relevant predicates |
| 462 | func processTreePredicates(r *Route, predicateList []*eskip.Predicate) error { |
no outgoing calls
no test coverage detected
searching dependent graphs…