KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > soot > toolkits > graph > MemoryEfficientGraph


1 /* Soot - a J*va Optimization Framework
2  * Copyright (C) 2001 Felix Kwok
3  *
4  * This library is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU Lesser General Public
6  * License as published by the Free Software Foundation; either
7  * version 2.1 of the License, or (at your option) any later version.
8  *
9  * This library is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12  * Lesser General Public License for more details.
13  *
14  * You should have received a copy of the GNU Lesser General Public
15  * License along with this library; if not, write to the
16  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17  * Boston, MA 02111-1307, USA.
18  */
19
20 /*
21  * Modified by the Sable Research Group and others 1997-1999.
22  * See the 'credits' file distributed with Soot for the complete list of
23  * contributors. (Soot is distributed at http://www.sable.mcgill.ca/soot)
24  */
25
26
27 package soot.toolkits.graph;
28
29
30 import java.util.*;
31 import soot.*;
32 import soot.util.*;
33
34
35
36
37 /**
38  * A memory efficient version of HashMutableDirectedGraph, in the sense
39  * that throw-away objects passed as arguments will not be kept in the
40  * process of adding edges.
41  */
42
43 public class MemoryEfficientGraph extends HashMutableDirectedGraph
44 {
45
46     HashMap self = new HashMap();
47
48     public void addNode(Object JavaDoc o) {
49         super.addNode(o);
50         self.put(o,o);
51     }
52
53     public void removeNode(Object JavaDoc o) {
54         super.removeNode(o);
55         self.remove(o);
56     }
57
58     public void addEdge(Object JavaDoc from, Object JavaDoc to) {
59         if (containsNode(from) && containsNode(to))
60             super.addEdge(self.get(from), self.get(to));
61         else if (!containsNode(from))
62             throw new RuntimeException JavaDoc(from.toString() + " not in graph!");
63         else
64             throw new RuntimeException JavaDoc(to.toString() + " not in graph!");
65     }
66
67     public void removeEdge(Object JavaDoc from, Object JavaDoc to) {
68         if (containsNode(from) && containsNode(to))
69             super.removeEdge(self.get(from), self.get(to));
70         else if (!containsNode(from))
71             throw new RuntimeException JavaDoc(from.toString() + " not in graph!");
72         else
73             throw new RuntimeException JavaDoc(to.toString() + " not in graph!");
74     }
75
76 }
77
78     
79
Popular Tags