CRISPY - 1.1.1

Clover coverage report - CRISPY - 1.1.1

Coverage timestamp: Mi Nov 15 2006 13:09:46 CET

FRAMES NO FRAMES

file stats:	LOC:	76		Methods:	7
	NCLOC:	49		Classes:	1

Source file

Conditionals

Statements

Methods

TOTAL

Graph.java

100%

100%

1		package net.sf.crispy.util;
2
3		import java.util.HashMap;
4		import java.util.Hashtable;
5		import java.util.Iterator;
6		import java.util.Map;
7
8		public class Graph { // extends Hashtable {
9
10		private static final long serialVersionUID = 7523758252776765521L;
11		private Map vertexs = new HashMap();
12		private Map edges = new HashMap();
13
14		/** All edges, map key is the from vertex */
15		private Map fromEdge = new Hashtable();
16		/** All edges, map key is the to vertex */
17		private Map toEdge = new Hashtable();
18
19
20	895	public Object put(Object pvKey, Object pvValue) {
21	895	Edge lvEdge = (Edge) pvKey;
22	895	fromEdge.put(lvEdge.getFrom(), lvEdge);
23	895	toEdge.put(lvEdge.getTo(), lvEdge);
24		// return super.put(pvKey, pvValue);
25	895	return edges.put(pvKey, pvValue);
26		}
27	881	public void addVertex(Object pvVertexObj) {
28	881	vertexs.put(pvVertexObj, Integer.valueOf("1"));
29		}
30
31	1078	public boolean getVertexCount(Object pvVertexObj) {
32	7	if (pvVertexObj == null) { return false; }
33	1071	return (vertexs.get(pvVertexObj) == null ? false : true);
34		}
35
36	3	public Edge isToContains(Object pvObject) {
37	1	if (pvObject == null) { return null; }
38	2	return (Edge) toEdge.get(pvObject);
39		}
40
41	2412	public Edge isFromContains(Object pvObject) {
42	1	if (pvObject == null) { return null; }
43
44		// System.out.println("- " + pvObject + " " + pvObject.getClass().getName());
45		// Iterator it = fromEdge.keySet().iterator();
46		// while (it.hasNext()) {
47		// System.out.println("" + it.next());
48		// }
49	2411	Edge lvFindEdgeFrom = (Edge) fromEdge.get(pvObject);
50		// System.out.println("--- > " + lvFindEdgeFrom);
51
52	2411	return lvFindEdgeFrom;
53		}
54
55	3	public Edge getProblemEdge(Object pvObject) {
56	1	if (pvObject == null) { return null; }
57		// Enumeration lvEnumeration = this.keys();
58	2	Iterator it = edges.keySet().iterator();
59		// while (lvEnumeration.hasMoreElements()) {
60	2	while (it.hasNext()) {
61		// Edge lvEdge = (Edge) lvEnumeration.nextElement();
62	2	Edge lvEdge = (Edge) it.next();
63	2	if ((lvEdge.getTo() != null) && (lvEdge.getTo().equals(pvObject)) && (lvEdge.getMethodName() != null)) {
64	1	return lvEdge;
65		}
66		}
67	1	return null;
68		}
69
70	2411	public synchronized boolean containsKey(Object pvKey) {
71		// boolean b = super.contains(pvKey);
72	2411	boolean b = edges.containsKey(pvKey);
73	2411	return b;
74		}
75
76		}