Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
BaseVisitor |
|
| 1.0;1 |
1 | package org.apache.maven.archiva.dependency.graph.walk; | |
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.maven.archiva.dependency.graph.DependencyGraph; | |
23 | import org.apache.maven.archiva.dependency.graph.DependencyGraphEdge; | |
24 | import org.apache.maven.archiva.dependency.graph.DependencyGraphNode; | |
25 | ||
26 | /** | |
27 | * The Baseline Visitor. | |
28 | * | |
29 | * @version $Id: BaseVisitor.java 718864 2008-11-19 06:33:35Z brett $ | |
30 | */ | |
31 | 0 | public class BaseVisitor |
32 | implements DependencyGraphVisitor | |
33 | { | |
34 | 0 | private static DependencyGraphVisitor INSTANCE = new BaseVisitor(); |
35 | ||
36 | protected DependencyGraph graph; | |
37 | ||
38 | public static DependencyGraphVisitor getInstance() | |
39 | { | |
40 | 0 | return INSTANCE; |
41 | } | |
42 | ||
43 | public void discoverEdge( DependencyGraphEdge edge ) | |
44 | { | |
45 | /* do nothing */ | |
46 | 0 | } |
47 | ||
48 | public void discoverGraph( DependencyGraph graph ) | |
49 | { | |
50 | 0 | this.graph = graph; |
51 | 0 | } |
52 | ||
53 | public void discoverNode( DependencyGraphNode node ) | |
54 | { | |
55 | /* do nothing */ | |
56 | 0 | } |
57 | ||
58 | public void finishEdge( DependencyGraphEdge edge ) | |
59 | { | |
60 | /* do nothing */ | |
61 | 0 | } |
62 | ||
63 | public void finishGraph( DependencyGraph graph ) | |
64 | { | |
65 | /* do nothing */ | |
66 | 0 | } |
67 | ||
68 | public void finishNode( DependencyGraphNode node ) | |
69 | { | |
70 | /* do nothing */ | |
71 | 0 | } |
72 | } |