Mega Code Archive
Debug Utilities
<![CDATA[
/*
** Copyright (c) 1998 by Timothy Gerard Endres
** <mailto:time@ice.com> <http://www.ice.com>
**
** This program is free software.
**
** You may redistribute it and/or modify it under the terms of the GNU
** General Public License as published by the Free Software Foundation.
** Version 2 of the license should be included with this distribution in
** the file LICENSE, as well as License.html. If the license is not
** included with this distribution, you may find a copy at the FSF web
** site at 'www.gnu.org' or 'www.fsf.org', or you may write to the
** Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139 USA.
**
** THIS SOFTWARE IS PROVIDED AS-IS WITHOUT WARRANTY OF ANY KIND,
** NOT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY. THE AUTHOR
** OF THIS SOFTWARE, ASSUMES _NO_ RESPONSIBILITY FOR ANY
** CONSEQUENCE RESULTING FROM THE USE, MODIFICATION, OR
** REDISTRIBUTION OF THIS SOFTWARE.
**
*/
import java.io.PrintWriter;
public class DebugUtilities {
public static void printClassHierarchy(Class aClass, PrintWriter writer, String prefix) {
String subPrefix = "-->";
for (int i = 0;; ++i) {
writer.println(prefix + " " + subPrefix + " " + aClass.getName());
aClass = aClass.getSuperclass();
if (aClass == Object.class)
break;
subPrefix = "--" + subPrefix;
}
}
public static void printContainerComponents(java.awt.Container cont, PrintWriter writer,
String prefix, boolean recurse) {
java.awt.Component[] comps = cont.getComponents();
if (comps.length < 1) {
writer.println(prefix + "Contains no components.");
}
for (int i = 0; i < comps.length; ++i) {
DebugUtilities.printClassHierarchy(comps[i].getClass(), writer, prefix + "[" + i + "]");
if (recurse) {
Class c = java.awt.Container.class;
if (c.isAssignableFrom(comps[i].getClass())) {
DebugUtilities.printContainerComponents((java.awt.Container) comps[i], writer, (prefix
+ "[" + i + "] "), recurse);
}
}
}
}
}
]]>