Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
ReduceScopeVisitor |
|
| 1.5;1.5 |
1 | package org.apache.maven.archiva.dependency.graph.tasks; | |
2 | ||
3 | /* | |
4 | * Licensed to the Apache Software Foundation (ASF) under one | |
5 | * or more contributor license agreements. See the NOTICE file | |
6 | * distributed with this work for additional information | |
7 | * regarding copyright ownership. The ASF licenses this file | |
8 | * to you under the Apache License, Version 2.0 (the | |
9 | * "License"); you may not use this file except in compliance | |
10 | * with the License. You may obtain a copy of the License at | |
11 | * | |
12 | * http://www.apache.org/licenses/LICENSE-2.0 | |
13 | * | |
14 | * Unless required by applicable law or agreed to in writing, | |
15 | * software distributed under the License is distributed on an | |
16 | * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | |
17 | * KIND, either express or implied. See the License for the | |
18 | * specific language governing permissions and limitations | |
19 | * under the License. | |
20 | */ | |
21 | ||
22 | import org.apache.commons.collections.Predicate; | |
23 | import org.apache.maven.archiva.dependency.graph.DependencyGraphEdge; | |
24 | import org.apache.maven.archiva.dependency.graph.functors.EdgeWithinScopePredicate; | |
25 | import org.apache.maven.archiva.dependency.graph.walk.DependencyGraphVisitor; | |
26 | ||
27 | /** | |
28 | * ReduceScopeVisitor | |
29 | * | |
30 | * @version $Id: ReduceScopeVisitor.java 718864 2008-11-19 06:33:35Z brett $ | |
31 | */ | |
32 | public class ReduceScopeVisitor | |
33 | extends AbstractReduceEdgeVisitor | |
34 | implements DependencyGraphVisitor | |
35 | { | |
36 | private Predicate scopedPredicate; | |
37 | ||
38 | public ReduceScopeVisitor( String scope ) | |
39 | 0 | { |
40 | 0 | scopedPredicate = new EdgeWithinScopePredicate( scope ); |
41 | 0 | } |
42 | ||
43 | public void discoverEdge( DependencyGraphEdge edge ) | |
44 | { | |
45 | 0 | if ( !scopedPredicate.evaluate( edge ) ) |
46 | { | |
47 | 0 | super.graph.removeEdge( edge ); |
48 | } | |
49 | 0 | } |
50 | } |