Coverage Report

Coverage Report - org.apache.maven.archiva.dependency.graph.walk.DependencyGraphVisitor

Classes in this File

 package org.apache.maven.archiva.dependency.graph.walk;
 
 /*
  * Licensed to the Apache Software Foundation (ASF) under one
  * or more contributor license agreements.  See the NOTICE file
  * distributed with this work for additional information
  * regarding copyright ownership.  The ASF licenses this file
  * to you under the Apache License, Version 2.0 (the
  * "License"); you may not use this file except in compliance
  * with the License.  You may obtain a copy of the License at
  *
  *  http://www.apache.org/licenses/LICENSE-2.0
  *
  * Unless required by applicable law or agreed to in writing,
  * software distributed under the License is distributed on an
  * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
  * KIND, either express or implied.  See the License for the
  * specific language governing permissions and limitations
  * under the License.
  */
 
 import org.apache.maven.archiva.dependency.graph.DependencyGraph;
 import org.apache.maven.archiva.dependency.graph.DependencyGraphEdge;
 import org.apache.maven.archiva.dependency.graph.DependencyGraphNode;
 
 /**
  * Interface for progress during search.
  *
  * @version $Id: DependencyGraphVisitor.java 718864 2008-11-19 06:33:35Z brett $
  */
 public interface DependencyGraphVisitor
 {
     /**
      * Called once, for when the graph itself is discovered.
      * 
      * @param graph the graph that was discovered.
      */
     public void discoverGraph( DependencyGraph graph );
 
     /**
      * Called for each node, when that node is visited.
      * 
      * @param node the node that is being visited.
      */
     public void discoverNode( DependencyGraphNode node );
 
     /**
      * Called for each edge, when that edge is visited.
      * 
      * @param edge the edge that is being visited.
      */
     public void discoverEdge( DependencyGraphEdge edge );
 
     /**
      * Called for each edge, when that edge has been fully visited.
      * 
      * @param edge the edge that was finished being visited.
      */
     public void finishEdge( DependencyGraphEdge edge );
 
     /**
      * Called for each node, when the node has been fully visited.
      * 
      * @param node the node that was finished being visited.
      */
     public void finishNode( DependencyGraphNode node );
 
     /**
      * Called once, for when the graph is finished being visited.
      * 
      * @param graph the graph that finished being visited.
      */
     public void finishGraph( DependencyGraph graph );
 
 }

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		* Interface for progress during search.
28		*
29		* @version $Id: DependencyGraphVisitor.java 718864 2008-11-19 06:33:35Z brett $
30		*/
31		public interface DependencyGraphVisitor
32		{
33		/**
34		* Called once, for when the graph itself is discovered.
35		*
36		* @param graph the graph that was discovered.
37		*/
38		public void discoverGraph( DependencyGraph graph );
39
40		/**
41		* Called for each node, when that node is visited.
42		*
43		* @param node the node that is being visited.
44		*/
45		public void discoverNode( DependencyGraphNode node );
46
47		/**
48		* Called for each edge, when that edge is visited.
49		*
50		* @param edge the edge that is being visited.
51		*/
52		public void discoverEdge( DependencyGraphEdge edge );
53
54		/**
55		* Called for each edge, when that edge has been fully visited.
56		*
57		* @param edge the edge that was finished being visited.
58		*/
59		public void finishEdge( DependencyGraphEdge edge );
60
61		/**
62		* Called for each node, when the node has been fully visited.
63		*
64		* @param node the node that was finished being visited.
65		*/
66		public void finishNode( DependencyGraphNode node );
67
68		/**
69		* Called once, for when the graph is finished being visited.
70		*
71		* @param graph the graph that finished being visited.
72		*/
73		public void finishGraph( DependencyGraph graph );
74
75		}