KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > proguard > classfile > visitor > MultiMemberVisitor


1 /*
2  * ProGuard -- shrinking, optimization, obfuscation, and preverification
3  * of Java bytecode.
4  *
5  * Copyright (c) 2002-2007 Eric Lafortune (eric@graphics.cornell.edu)
6  *
7  * This program is free software; you can redistribute it and/or modify it
8  * under the terms of the GNU General Public License as published by the Free
9  * Software Foundation; either version 2 of the License, or (at your option)
10  * any later version.
11  *
12  * This program is distributed in the hope that it will be useful, but WITHOUT
13  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14  * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15  * more details.
16  *
17  * You should have received a copy of the GNU General Public License along
18  * with this program; if not, write to the Free Software Foundation, Inc.,
19  * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20  */
21 package proguard.classfile.visitor;
22
23 import proguard.classfile.*;
24
25
26 /**
27  * This MemberVisitor delegates all visits to each MemberVisitor
28  * in a given list.
29  *
30  * @author Eric Lafortune
31  */
32 public class MultiMemberVisitor implements MemberVisitor
33 {
34     private static final int ARRAY_SIZE_INCREMENT = 5;
35
36     private MemberVisitor[] memberVisitors;
37     private int memberVisitorCount;
38
39
40     public MultiMemberVisitor()
41     {
42     }
43
44
45     public MultiMemberVisitor(MemberVisitor[] memberVisitors)
46     {
47         this.memberVisitors = memberVisitors;
48         this.memberVisitorCount = memberVisitors.length;
49     }
50
51
52     public void addMemberVisitor(MemberVisitor memberVisitor)
53     {
54         ensureArraySize();
55
56         memberVisitors[memberVisitorCount++] = memberVisitor;
57     }
58
59
60     private void ensureArraySize()
61     {
62         if (memberVisitors == null)
63         {
64             memberVisitors = new MemberVisitor[ARRAY_SIZE_INCREMENT];
65         }
66         else if (memberVisitors.length == memberVisitorCount)
67         {
68             MemberVisitor[] newMemberVisitors =
69                 new MemberVisitor[memberVisitorCount +
70                                          ARRAY_SIZE_INCREMENT];
71             System.arraycopy(memberVisitors, 0,
72                              newMemberVisitors, 0,
73                              memberVisitorCount);
74             memberVisitors = newMemberVisitors;
75         }
76     }
77
78
79     public void visitProgramField(ProgramClass programClass, ProgramField programField)
80     {
81         for (int index = 0; index < memberVisitorCount; index++)
82         {
83             memberVisitors[index].visitProgramField(programClass, programField);
84         }
85     }
86
87
88     public void visitProgramMethod(ProgramClass programClass, ProgramMethod programMethod)
89     {
90         for (int index = 0; index < memberVisitorCount; index++)
91         {
92             memberVisitors[index].visitProgramMethod(programClass, programMethod);
93         }
94     }
95
96
97     public void visitLibraryField(LibraryClass libraryClass, LibraryField libraryField)
98     {
99         for (int index = 0; index < memberVisitorCount; index++)
100         {
101             memberVisitors[index].visitLibraryField(libraryClass, libraryField);
102         }
103     }
104
105
106     public void visitLibraryMethod(LibraryClass libraryClass, LibraryMethod libraryMethod)
107     {
108         for (int index = 0; index < memberVisitorCount; index++)
109         {
110             memberVisitors[index].visitLibraryMethod(libraryClass, libraryMethod);
111         }
112     }
113 }
114
Popular Tags