What this is
Other links
The source code/*
* Sun Public License Notice
*
* The contents of this file are subject to the Sun Public License
* Version 1.0 (the "License"). You may not use this file except in
* compliance with the License. A copy of the License is available at
* http://www.sun.com/
*
* The Original Code is NetBeans. The Initial Developer of the Original
* Code is Sun Microsystems, Inc. Portions Copyright 1997-2003 Sun
* Microsystems, Inc. All Rights Reserved.
*/
package org.openide.util;
import java.awt.*;
import java.awt.event.KeyEvent;
import java.awt.event.ActionListener;
import java.awt.event.ActionEvent;
import java.awt.event.FocusListener;
import java.beans.PropertyChangeListener;
import java.beans.VetoableChangeListener;
import java.util.*;
import java.util.List;
import java.lang.reflect.*;
import java.lang.ref.Reference;
import java.lang.ref.SoftReference;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.lang.ref.ReferenceQueue;
import java.net.*;
import java.text.BreakIterator;
import javax.swing.Action;
import javax.swing.JMenuItem;
import javax.swing.KeyStroke;
import javax.swing.Timer;
import javax.swing.event.ChangeListener;
import javax.swing.event.DocumentListener;
import org.openide.ErrorManager;
import org.openide.util.ContextAwareAction;
/** Otherwise uncategorized useful static methods.
*
* @author Jan Palka, Ian Formanek, Jaroslav Tulach
*/
public final class Utilities {
private Utilities() {}
/** Operating system is Windows NT. */
public static final int OS_WINNT = 1;
/** Operating system is Windows 95. */
public static final int OS_WIN95 = 2;
/** Operating system is Windows 98. */
public static final int OS_WIN98 = 4;
/** Operating system is Solaris. */
public static final int OS_SOLARIS = 8;
/** Operating system is Linux. */
public static final int OS_LINUX = 16;
/** Operating system is HP-UX. */
public static final int OS_HP = 32;
/** Operating system is IBM AIX. */
public static final int OS_AIX = 64;
/** Operating system is SGI IRIX. */
public static final int OS_IRIX = 128;
/** Operating system is Sun OS. */
public static final int OS_SUNOS = 256;
/** Operating system is Compaq TRU64 Unix */
public static final int OS_TRU64 = 512;
/** @deprecated please use OS_TRU64 instead */
public static final int OS_DEC = OS_TRU64;
/** Operating system is OS/2. */
public static final int OS_OS2 = 1024;
/** Operating system is Mac. */
public static final int OS_MAC = 2048;
/** Operating system is Windows 2000. */
public static final int OS_WIN2000 = 4096;
/** Operating system is Compaq OpenVMS */
public static final int OS_VMS = 8192;
/**
*Operating system is one of the Windows variants but we don't know which
*one it is
*/
public static final int OS_WIN_OTHER = 16384;
/** Operating system is unknown. */
public static final int OS_OTHER = 65536;
//TODO: reavaluate OS_OS2 addition into the OS_WINDOWS_MASK
//OS_OS2 added cause #44136: Filesystem support has been broken under OS/2
/** A mask for Windows platforms. */
public static final int OS_WINDOWS_MASK = OS_WINNT | OS_WIN95 | OS_WIN98 | OS_WIN2000 | OS_WIN_OTHER | OS_OS2;
/** A mask for Unix platforms. */
public static final int OS_UNIX_MASK = OS_SOLARIS | OS_LINUX | OS_HP | OS_AIX | OS_IRIX | OS_SUNOS | OS_TRU64 | OS_MAC;
/** A height of the windows's taskbar */
public static final int TYPICAL_WINDOWS_TASKBAR_HEIGHT = 27;
/** A height of the Mac OS X's menu */
private static final int TYPICAL_MACOSX_MENU_HEIGHT = 24;
/** variable holding the activeReferenceQueue */
private static ReferenceQueue activeReferenceQueue;
/** Useful queue for all parts of system that use
null-safe, so if one of the parameters is true and the second not,
* it returns false.
* @param o1 the first object to compare
* @param o2 the second object to compare
* @return true if the objects are equal
*/
public static boolean compareObjects (Object o1, Object o2) {
return compareObjectsImpl (o1, o2, 1);
}
/** Safe equality check with array recursion.
* @param o1 the first object to compare
* @param o2 the second object to compare
* @param checkArraysDepth the depth to which arrays should be compared for equality (negative for infinite depth, zero for no comparison of elements, one for shallow, etc.)
* @return true if the objects are equal
* @see #compareObjects(Object, Object)
*/
public static boolean compareObjectsImpl (Object o1, Object o2, int checkArraysDepth) {
// handle null values
if (o1 == null)
return (o2 == null);
else if (o2 == null) return false;
// handle arrays
if (checkArraysDepth > 0) {
if ((o1 instanceof Object[]) && (o2 instanceof Object[])) {
// Note: also handles multidimensional arrays of primitive types correctly.
// I.e. new int[0][] instanceof Object[]
Object[] o1a = (Object[]) o1;
Object[] o2a = (Object[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++) {
if (! compareObjectsImpl (o1a[i], o2a[i], checkArraysDepth - 1)) {
return false;
}
}
return true;
} else if ((o1 instanceof byte[]) && (o2 instanceof byte[])) {
byte[] o1a = (byte[]) o1;
byte[] o2a = (byte[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof short[]) && (o2 instanceof short[])) {
short[] o1a = (short[]) o1;
short[] o2a = (short[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof int[]) && (o2 instanceof int[])) {
int[] o1a = (int[]) o1;
int[] o2a = (int[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof long[]) && (o2 instanceof long[])) {
long[] o1a = (long[]) o1;
long[] o2a = (long[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof float[]) && (o2 instanceof float[])) {
float[] o1a = (float[]) o1;
float[] o2a = (float[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof double[]) && (o2 instanceof double[])) {
double[] o1a = (double[]) o1;
double[] o2a = (double[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof char[]) && (o2 instanceof char[])) {
char[] o1a = (char[]) o1;
char[] o2a = (char[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
} else if ((o1 instanceof boolean[]) && (o2 instanceof boolean[])) {
boolean[] o1a = (boolean[]) o1;
boolean[] o2a = (boolean[]) o2;
int l1 = o1a.length;
int l2 = o2a.length;
if (l1 != l2) return false;
for (int i = 0; i < l1; i++)
if (o1a[i] != o2a[i]) return false;
return true;
}
// else not array type
}
// handle common objects--non-arrays, or arrays when depth == 0
return o1.equals (o2);
}
/** Assemble a human-presentable class name for a specified class.
* Arrays are represented as e.g. java.lang.String[].
* @param clazz the class to name
* @return the human-presentable name
*/
public static String getClassName (Class clazz) {
// if it is an array, get short name of element type and append []
if (clazz.isArray ())
return getClassName (clazz.getComponentType ()) + "[]"; // NOI18N
else
return clazz.getName ();
}
/** Assemble a human-presentable class name for a specified class (omitting the package).
* Arrays are represented as e.g. String[].
* @param clazz the class to name
* @return the human-presentable name
*/
public static String getShortClassName (Class clazz) {
// if it is an array, get short name of element type and append []
if (clazz.isArray ())
return getShortClassName (clazz.getComponentType ()) + "[]"; // NOI18N
String name = clazz.getName ().replace ('$', '.');
return name.substring (name.lastIndexOf (".") + 1, name.length ()); // NOI18N
}
/**
* Convert an array of objects to an array of primitive types.
* E.g. an Integer[] would be changed to an int[].
* @param array the wrapper array
* @return a primitive array
* @throws IllegalArgumentException if the array element type is not a primitive wrapper
*/
public static Object toPrimitiveArray (Object[] array) {
if (array instanceof Integer[]) {
int[] r = new int [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Integer)array[i]) == null) ? 0 : ((Integer)array[i]).intValue ();
return r;
}
if (array instanceof Boolean[]) {
boolean[] r = new boolean [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Boolean)array[i]) == null) ? false : ((Boolean)array[i]).booleanValue ();
return r;
}
if (array instanceof Byte[]) {
byte[] r = new byte [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Byte)array[i]) == null) ? 0 : ((Byte)array[i]).byteValue ();
return r;
}
if (array instanceof Character[]) {
char[] r = new char [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Character)array[i]) == null) ? 0 : ((Character)array[i]).charValue ();
return r;
}
if (array instanceof Double[]) {
double[] r = new double [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Double)array[i]) == null) ? 0 : ((Double)array[i]).doubleValue ();
return r;
}
if (array instanceof Float[]) {
float[] r = new float [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Float)array[i]) == null) ? 0 : ((Float)array[i]).floatValue ();
return r;
}
if (array instanceof Long[]) {
long[] r = new long [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Long)array[i]) == null) ? 0 : ((Long)array[i]).longValue ();
return r;
}
if (array instanceof Short[]) {
short[] r = new short [array.length];
int i, k = array.length;
for (i = 0; i < k; i++) r [i] = (((Short)array[i]) == null) ? 0 : ((Short)array[i]).shortValue ();
return r;
}
throw new IllegalArgumentException ();
}
/**
* Convert an array of primitive types to an array of objects.
* E.g. an int[] would be turned into an Integer[].
* @param array the primitive array
* @return a wrapper array
* @throws IllegalArgumentException if the array element type is not primitive
*/
public static Object[] toObjectArray (Object array) {
if (array instanceof Object[]) return (Object[]) array;
if (array instanceof int[]) {
int i, k = ((int[])array).length;
Integer[] r = new Integer [k];
for (i = 0; i < k; i++) r [i] = new Integer (((int[]) array)[i]);
return r;
}
if (array instanceof boolean[]) {
int i, k = ((boolean[])array).length;
Boolean[] r = new Boolean [k];
for (i = 0; i < k; i++) r [i] = ((boolean[]) array)[i] ? Boolean.TRUE : Boolean.FALSE;
return r;
}
if (array instanceof byte[]) {
int i, k = ((byte[])array).length;
Byte[] r = new Byte [k];
for (i = 0; i < k; i++) r [i] = new Byte (((byte[]) array)[i]);
return r;
}
if (array instanceof char[]) {
int i, k = ((char[])array).length;
Character[] r = new Character [k];
for (i = 0; i < k; i++) r [i] = new Character (((char[]) array)[i]);
return r;
}
if (array instanceof double[]) {
int i, k = ((double[])array).length;
Double[] r = new Double [k];
for (i = 0; i < k; i++) r [i] = new Double (((double[]) array)[i]);
return r;
}
if (array instanceof float[]) {
int i, k = ((float[])array).length;
Float[] r = new Float [k];
for (i = 0; i < k; i++) r [i] = new Float (((float[]) array)[i]);
return r;
}
if (array instanceof long[]) {
int i, k = ((long[])array).length;
Long[] r = new Long [k];
for (i = 0; i < k; i++) r [i] = new Long (((long[]) array)[i]);
return r;
}
if (array instanceof short[]) {
int i, k = ((short[])array).length;
Short[] r = new Short [k];
for (i = 0; i < k; i++) r [i] = new Short (((short[]) array)[i]);
return r;
}
throw new IllegalArgumentException ();
}
/**
* Get the object type for given primitive type.
*
* @param c primitive type (e.g. int)
* @return object type (e.g. Integer)
*/
public static Class getObjectType (Class c) {
if (!c.isPrimitive ()) return c;
if (c == Integer.TYPE) return Integer.class;
if (c == Boolean.TYPE) return Boolean.class;
if (c == Byte.TYPE) return Byte.class;
if (c == Character.TYPE) return Character.class;
if (c == Double.TYPE) return Double.class;
if (c == Float.TYPE) return Float.class;
if (c == Long.TYPE) return Long.class;
if (c == Short.TYPE) return Short.class;
throw new IllegalArgumentException ();
}
/**
* Get the primitive type for given object type.
*
* @param c object type (e.g. Integer)
* @return primitive type (e.g. int)
*/
public static Class getPrimitiveType (Class c) {
if (!c.isPrimitive ()) return c;
if (c == Integer.class) return Integer.TYPE;
if (c == Boolean.class) return Boolean.TYPE;
if (c == Byte.class) return Byte.TYPE;
if (c == Character.class) return Character.TYPE;
if (c == Double.class) return Double.TYPE;
if (c == Float.class) return Float.TYPE;
if (c == Long.class) return Long.TYPE;
if (c == Short.class) return Short.TYPE;
throw new IllegalArgumentException ();
}
/** Find a focus-traverable component.
* @param c the component to look in
* @return the same component if traversable, else a child component if present, else null
* @see Component#isFocusTraversable
*/
public static Component getFocusTraversableComponent (Component c) {
if (c.isFocusTraversable ()) return c;
if (!(c instanceof Container)) return null;
int i, k = ((Container)c).getComponentCount ();
for (i = 0; i < k; i++) {
Component v = ((Container)c).getComponent (i);
if (v != null) return v;
}
return null;
}
/** Parses parameters from a given string in shell-like manner.
* Users of the Bourne shell (e.g. on Unix) will already be familiar with the behavior.
* For example, when using org.openide.execution.NbProcessDescriptor (Execution API)
* you should be able to:
*
CS-F1 for control-shift-function key one)
* @see #stringToKey
*/
public static String keyToString (KeyStroke stroke) {
StringBuffer sb = new StringBuffer ();
// add modifiers that must be pressed
if (addModifiers (sb, stroke.getModifiers ())) {
sb.append ('-');
}
HashMap[] namesAndValues = initNameAndValues ();
String c = (String)namesAndValues[1].get (new Integer (stroke.getKeyCode ()));
if (c == null) {
sb.append (stroke.getKeyChar ());
} else {
sb.append (c);
}
return sb.toString ();
}
/** Construct a new key description from a given universal string
* description.
* Provides mapping between Emacs-like textual key descriptions and the
* KeyStroke object used in Swing.
* * This format has following form: *
Where: *
VK_ characters. So {@link KeyEvent#VK_ENTER} is described as
* ENTER.
*
* @param s the string with the description of the key
* @return key description object, or null if the string does not represent any valid key
*/
public static KeyStroke stringToKey (String s) {
StringTokenizer st = new StringTokenizer (s.toUpperCase (), "-", true); // NOI18N
int needed = 0;
HashMap names = initNameAndValues ()[0];
int lastModif = -1;
try {
for (;;) {
String el = st.nextToken ();
// required key
if (el.equals ("-")) { // NOI18N
if (lastModif != -1) {
needed |= lastModif;
lastModif = -1;
}
continue;
}
// if there is more elements
if (st.hasMoreElements ()) {
// the text should describe modifiers
lastModif = readModifiers (el);
} else {
// last text must be the key code
Integer i = (Integer)names.get (el);
if (i != null) {
return KeyStroke.getKeyStroke (i.intValue (), needed);
} else {
return null;
}
}
}
} catch (NoSuchElementException ex) {
return null;
}
}
/** Convert a space-separated list of user-friendly key binding names to a list of Swing key strokes.
* @param s the string with keys
* @return array of key strokes, or null if the string description is not valid
* @see #stringToKey
*/
public static KeyStroke[] stringToKeys (String s) {
StringTokenizer st = new StringTokenizer (s.toUpperCase (), " "); // NOI18N
ArrayList arr = new ArrayList ();
while (st.hasMoreElements ()) {
s = st.nextToken ();
KeyStroke k = stringToKey (s);
if (k == null) return null;
arr.add (k);
}
return (KeyStroke[])arr.toArray (new KeyStroke[arr.size ()]);
}
/** Adds characters for modifiers to the buffer.
* @param buf buffer to add to
* @param modif modifiers to add (KeyEvent.XXX_MASK)
* @return true if something has been added
*/
private static boolean addModifiers (StringBuffer buf, int modif) {
boolean b = false;
if ((modif & KeyEvent.CTRL_MASK) != 0) {
buf.append("C"); // NOI18N
b = true;
}
if ((modif & KeyEvent.ALT_MASK) != 0) {
buf.append("A"); // NOI18N
b = true;
}
if ((modif & KeyEvent.SHIFT_MASK) != 0) {
buf.append("S"); // NOI18N
b = true;
}
if ((modif & KeyEvent.META_MASK) != 0) {
buf.append("M"); // NOI18N
b = true;
}
return b;
}
/** Reads for modifiers and creates integer with required mask.
* @param s string with modifiers
* @return integer with mask
* @exception NoSuchElementException if some letter is not modifier
*/
private static int readModifiers (String s) throws NoSuchElementException {
int m = 0;
for (int i = 0; i < s.length (); i++) {
switch (s.charAt (i)) {
case 'C':
m |= KeyEvent.CTRL_MASK;
break;
case 'A':
m |= KeyEvent.ALT_MASK;
break;
case 'M':
m |= KeyEvent.META_MASK;
break;
case 'S':
m |= KeyEvent.SHIFT_MASK;
break;
default:
throw new NoSuchElementException ();
}
}
return m;
}
/**
* Finds out the monitor where the user currently has the input focus.
* This method is usually used to help the client code to figure out on
* which monitor it should place newly created windows/frames/dialogs.
*
* @return the GraphicsConfiguration of the monitor which currently has the
* input focus
*/
private static GraphicsConfiguration getCurrentGraphicsConfiguration() {
Frame[] frames = Frame.getFrames();
for (int i = 0; i < frames.length; i++) {
if (javax.swing.SwingUtilities.findFocusOwner(frames[i]) != null) {
return frames[i].getGraphicsConfiguration();
}
}
return GraphicsEnvironment.getLocalGraphicsEnvironment().getDefaultScreenDevice().getDefaultConfiguration();
}
/**
* Returns the usable area of the screen where applications can place its
* windows. The method subtracts from the screen the area of taskbars,
* system menus and the like. The screen this method applies to is the one
* which is considered current, ussually the one where the current input
* focus is.
*
* @return the rectangle of the screen where one can place windows
*
* @since 2.5
*/
public static Rectangle getUsableScreenBounds() {
return getUsableScreenBounds(getCurrentGraphicsConfiguration());
}
/**
* Returns the usable area of the screen where applications can place its
* windows. The method subtracts from the screen the area of taskbars,
* system menus and the like.
*
* @param gconf the GraphicsConfiguration of the monitor
* @return the rectangle of the screen where one can place windows
*
* @since 2.5
*/
public static Rectangle getUsableScreenBounds(GraphicsConfiguration gconf) {
if (gconf == null)
gconf = GraphicsEnvironment.getLocalGraphicsEnvironment().getDefaultScreenDevice().getDefaultConfiguration();
Rectangle bounds = new Rectangle(gconf.getBounds());
String str;
str = System.getProperty("netbeans.screen.insets"); // NOI18N
if (str != null) {
StringTokenizer st = new StringTokenizer(str, ", "); // NOI18N
if (st.countTokens() == 4) {
try {
bounds.y = Integer.parseInt(st.nextToken());
bounds.x = Integer.parseInt(st.nextToken());
bounds.height -= bounds.y + Integer.parseInt(st.nextToken());
bounds.width -= bounds.x + Integer.parseInt(st.nextToken());
}
catch (NumberFormatException ex) {
ErrorManager.getDefault().notify(ErrorManager.WARNING, ex);
}
}
return bounds;
}
str = System.getProperty("netbeans.taskbar.height"); // NOI18N
if (str != null) {
bounds.height -= Integer.getInteger(str, 0).intValue();
return bounds;
}
try {
Toolkit toolkit = Toolkit.getDefaultToolkit();
Insets insets = toolkit.getScreenInsets (gconf);
bounds.y += insets.top;
bounds.x += insets.left;
bounds.height -= insets.top + insets.bottom;
bounds.width -= insets.left + insets.right;
}
catch (Exception ex) {
ErrorManager.getDefault().notify(ErrorManager.WARNING, ex);
}
return bounds;
}
/**
* Helps client code place components on the center of the screen. It
* handles multiple monitor configuration correctly
*
* @param componentSize the size of the component
* @return bounds of the centered component
*
* @since 2.5
*/
public static Rectangle findCenterBounds(Dimension componentSize) {
return findCenterBounds(getCurrentGraphicsConfiguration(),
componentSize);
}
/**
* Helps client code place components on the center of the screen. It
* handles multiple monitor configuration correctly
*
* @param gconf the GraphicsConfiguration of the monitor
* @param componentSize the size of the component
* @return bounds of the centered component
*/
private static Rectangle findCenterBounds(GraphicsConfiguration gconf,
Dimension componentSize) {
if (gconf == null)
gconf = GraphicsEnvironment.getLocalGraphicsEnvironment().getDefaultScreenDevice().getDefaultConfiguration();
Rectangle bounds = gconf.getBounds();
return new Rectangle(bounds.x + (bounds.width - componentSize.width) / 2,
bounds.y + (bounds.height - componentSize.height) / 2,
componentSize.width,
componentSize.height);
}
/** @return size of the screen. The size is modified for Windows OS
* - some pointes are subtracted to reflect a presence of the taskbar
*
* @deprecated this method is almost useless in multiple monitor configuration
*
* @see #getUsableScreenBounds()
* @see #findCenterBounds(Dimension)
*/
public static final Dimension getScreenSize() {
Dimension screenSize = Toolkit.getDefaultToolkit().getScreenSize();
if (isWindows() && !Boolean.getBoolean ("netbeans.no.taskbar")) {
screenSize.height -= TYPICAL_WINDOWS_TASKBAR_HEIGHT;
} else if ((getOperatingSystem() & OS_MAC) != 0)
screenSize.height -= TYPICAL_MACOSX_MENU_HEIGHT;
return screenSize;
}
/** Utility method for avoiding of memory leak in JDK 1.3 / JFileChooser.showDialog(...)
* @param parent
* @param approveButtonText
* @deprecated Not needed in JDK 1.4.
*/
public static final int showJFileChooser(javax.swing.JFileChooser chooser, java.awt.Component parent, java.lang.String approveButtonText) {
if(approveButtonText != null) {
chooser.setApproveButtonText(approveButtonText);
chooser.setDialogType(javax.swing.JFileChooser.CUSTOM_DIALOG);
}
Frame frame = null;
Dialog parentDlg = null;
if (parent instanceof Dialog)
parentDlg = (Dialog) parent;
else
frame = parent instanceof java.awt.Frame ? (Frame) parent
: (Frame)javax.swing.SwingUtilities.getAncestorOfClass(Frame.class, parent);
String title = chooser.getDialogTitle();
if (title == null) {
title = chooser.getUI().getDialogTitle(chooser);
}
final javax.swing.JDialog dialog;
if (parentDlg != null)
dialog = new javax.swing.JDialog(parentDlg, title, true);
else
dialog = new javax.swing.JDialog(frame, title, true);
dialog.setDefaultCloseOperation(javax.swing.WindowConstants.DISPOSE_ON_CLOSE);
Container contentPane = dialog.getContentPane();
contentPane.setLayout(new BorderLayout());
contentPane.add(chooser, BorderLayout.CENTER);
dialog.pack();
dialog.setBounds(findCenterBounds(parent.getGraphicsConfiguration(),
dialog.getSize()));
chooser.rescanCurrentDirectory();
final int[] retValue = new int[] { javax.swing.JFileChooser.CANCEL_OPTION };
java.awt.event.ActionListener l = new java.awt.event.ActionListener() {
public void actionPerformed(java.awt.event.ActionEvent ev) {
if (ev.getActionCommand() == javax.swing.JFileChooser.APPROVE_SELECTION) {
retValue[0] = javax.swing.JFileChooser.APPROVE_OPTION;
}
dialog.setVisible(false);
dialog.dispose();
}
};
chooser.addActionListener(l);
dialog.show();
return retValue[0];
}
/** Exception indicating that a given list could not be partially-ordered.
* @see #partialSort
* @deprecated Used only by the deprecated {@link #partialSort}
*/
public static class UnorderableException extends RuntimeException {
private Collection unorderable;
private Map deps;
static final long serialVersionUID =6749951134051806661L;
/** Create a new unorderable-list exception with no detail message.
* @param unorderable a collection of list elements which could not be ordered
* (because there was some sort of cycle)
* @param deps dependencies associated with the list; a map from list elements
* to sets of list elements which that element must appear after
*/
public UnorderableException (Collection unorderable, Map deps) {
super (/* "Cannot be ordered: " + unorderable */); // NOI18N
this.unorderable = unorderable;
this.deps = deps;
}
/** Create a new unorderable-list exception with a specified detail message.
* @param message the detail message
* @param unorderable a collection of list elements which could not be ordered
* (because there was some sort of cycle)
* @param deps dependencies associated with the list; a map from list elements
* to sets of list elements which that element must appear after
*/
public UnorderableException (String message, Collection unorderable, Map deps) {
super (message);
this.unorderable = unorderable;
this.deps = deps;
}
/** Get the unorderable elements.
* @return the elements
* @see Utilities.UnorderableException#Utilities.UnorderableException(Collection,Map)
*/
public Collection getUnorderable () {
return unorderable;
}
/** Get the dependencies.
* @return the dependencies
* @see Utilities.UnorderableException#Utilities.UnorderableException(Collection,Map)
*/
public Map getDeps () {
return deps;
}
}
/** Sort a list according to a specified partial order.
* Note that in the current implementation, the comparator will be called
* exactly once for each distinct pair of list elements, ignoring order,
* so caching its results is a waste of time.
* @param l the list to sort (will not be modified)
* @param c a comparator to impose the partial order; "equal" means that the elements
* are not ordered with respect to one another, i.e. may be only a partial order
* @param stable whether to attempt a stable sort, meaning that the position of elements
* will be disturbed as little as possible; might be slightly slower
* @return the partially-sorted list
* @throws UnorderableException if the specified partial order is inconsistent on this list
* @deprecated Deprecated in favor of the potentially much faster (and possibly more correct) {@link #topologicalSort}.
*/
public static List partialSort (List l, Comparator c, boolean stable) throws UnorderableException {
// map from objects in the list to null or sets of objects they are greater than
// (i.e. must appear after):
Map deps = new HashMap (); // MapThere may not be any nulls among the objects, nor duplicates * (as per hash/equals), nor duplicates among the edge lists. * The edge map need not contain an entry for every object, only if it * has some outgoing edges (empty but not null map values are permitted). * The edge map may contain neither keys nor value entries for objects not * in the collection to be sorted. * The incoming parameters will not be modified; they must not be changed * during the call and possible calls to TopologicalSortException methods. * The returned list will support modifications. * There is a weak stability guarantee: if there are no edges
* which contradict the incoming order, the resulting list will be in the same
* order as the incoming elements. However if some elements need to be rearranged,
* it is not guaranteed that others will not also be rearranged, even
* if they did not strictly speaking need to be.
* @param c a collection of objects to be topologically sorted
* @param edges constraints among those objects, of type
* Often class names (especially package names) changes during lifecycle
* of a module. When some piece of the system stores the name of a class
* in certain point of a time and wants to find the correct * For such purposes this method has been created. It allows modules to * register their classes that changed names and other parts of system that * deal with class names to find the correct names. *
* To register a mapping from old class names to new ones create a file
* * #
* # Mapping of legacy classes to new ones
* #
*
* org.oldpackage.MyClass=org.newpackage.MyClass # rename of package for one class
* org.mypackage.OldClass=org.mypackage.NewClass # rename of class in a package
*
* # rename of class and package
* org.oldpackage.OldClass=org.newpackage.NewClass
*
* # rename of whole package
* org.someoldpackage=org.my.new.package.structure
*
*
* Btw. one can use spaces instead of = sign.
* For a real world example
* check the
*
* xml module.
*
*
* For purposes of org.openide.util.io.NbObjectInputStream there is
* a following special convention:
* If the
* className is not listed as one that is to be renamed, the returned
* string == className, if the className is registered to be renamed
* than the className != returned value, even in a case when className.equals (retValue)
*
* @param className fully qualified name of a class to translate
* @return new name of the class according to renaming rules.
*/
public static String translate(final String className) {
checkMapping ();
RE exp;
synchronized (TRANS_LOCK) {
exp = transExp;
}
if (exp == null) {
// no transition table found
return className;
}
synchronized (exp) {
// refusing convertions as fast as possible
return exp.convert (className);
}
}
/** Loads all resources that contain renaming information.
* @param l classloader to load packages from
*/
private static void checkMapping () {
// test if we run in test mode
if (transLoader == TRANS_LOCK) {
// no check
return;
}
ClassLoader current = (ClassLoader)Lookup.getDefault ().lookup (ClassLoader.class);
if (current == null) {
current = ClassLoader.getSystemClassLoader();
}
if (transLoader == current) {
// no change, no rescan
return;
}
initForLoader (current, current);
}
/* Initializes the content of transition table from a classloader.
* @param loader loader to read data from
* @param set loader to set as the transLoader or null if we run in test mode
*/
static void initForLoader (ClassLoader current, Object set) {
if (set == null) {
set = TRANS_LOCK;
}
Enumeration en;
try {
en = current.getResources("META-INF/netbeans/translate.names");
} catch (IOException ex) {
ErrorManager.getDefault ().notify (ErrorManager.INFORMATIONAL, ex);
en = null;
}
if (en == null || !en.hasMoreElements()) {
synchronized (TRANS_LOCK) {
transLoader = set;
transExp = null;
}
return;
}
// format of line in the meta files
//
// # comments are allowed
// a.name.in.a.Package=another.Name # with comment is allowed
// for.compatibility.one.can.use.Space instead.of.Equal
//
RE re = null;
// [pnejedly:perf] commented out. The RegExp based translation was way slower
// than the hand-written RE13
// if (Dependency.JAVA_SPEC.compareTo(new SpecificationVersion("1.4")) >= 0) { // NOI18N
// try {
// re = (RE)Class.forName ("org.openide.util.RE14").newInstance ();
// } catch (ThreadDeath t) {
// throw t;
// } catch (Throwable t) {
// }
// }
// if (re == null) {
re = new RE13 ();
// }
TreeSet list = new TreeSet (new Comparator () {
public int compare (Object o1, Object o2) {
String s1 = ((String[])o1)[0];
String s2 = ((String[])o2)[0];
int i1 = s1.length ();
int i2 = s2.length ();
if (i1 != i2) return i2 - i1;
return s2.compareTo (s1);
}
});
while (en.hasMoreElements ()) {
URL u = (URL)en.nextElement();
try {
BufferedReader reader = new BufferedReader(
new InputStreamReader (u.openStream(), "UTF8") // use explicit encoding //NOI18N
);
loadTranslationFile (re, reader, list);
reader.close ();
} catch (IOException ex) {
ErrorManager.getDefault ().annotate(ex, ErrorManager.UNKNOWN,
"Problematic file: " + u, null, null, null);
ErrorManager.getDefault ().notify (ErrorManager.INFORMATIONAL, ex);
}
}
// construct a regular expression of following form. Let "1", "2", "3", "4"
// be the keys:
// "^
// thus if 4 is matched five groups will be created
String[] arr = new String[list.size ()];
String[] pattern = new String[arr.length];
int i = 0;
Iterator it = list.iterator ();
while (it.hasNext ()) {
String[] pair = (String[])it.next ();
arr[i] = pair[1].intern (); // name of the track
pattern[i] = pair[0]; // original object
i++;
}
synchronized (TRANS_LOCK) {
// last check
if (arr.length == 0) {
transExp = null;
} else {
transExp = re;
transExp.init (pattern, arr);
}
transLoader = set;
}
}
/**
* Load single translation file.
* @param resource URL identifiing transaction table
* @param results will be filled with String[2]
*/
private static void loadTranslationFile(
RE re,
BufferedReader reader, Set results
) throws IOException {
for (;;) {
String line = reader.readLine ();
if (line == null) {
break;
}
if (line.length () == 0 || line.startsWith ("#")) { // NOI18N
continue;
}
String[] pair = re.readPair (line);
if (pair == null) {
throw new java.io.InvalidObjectException ("Line is invalid: " + line);
}
results.add (pair);
}
}
/** This method merges two images into the new one. The second image is drawn
* over the first one with its top-left corner at x, y. Images mustn't be of the same size.
* New image will have a size of max(second image size + top-left corner, first image size).
* Method is used mostly when second image contains transparent pixels (e.g. for badging).
* If both images are Typically you will set the cursor only temporarily: * * * // code is running in other then event dispatch thread
* currentComponent.setCursor(Utilities.createProgressCursor(currentComponent));
* try {
* // perform some work in other than event dispatch thread
* // (do not block UI)
* } finally {
* currentComponent.setCursor(null);
* }
*
*
* This implementation provides one cursor for all Mac systems, one for all
* Unix systems (regardless of window manager), and one for all other systems
* including Windows.
*
* @param component the non-null component that will use the progress cursor
* @return a progress cursor (Unix, Windows or Mac)
*
* @since 3.23
*/
public static final Cursor createProgressCursor(Component component) {
// refuse null component
if (component == null) {
throw new NullPointerException("Given component is null"); //NOI18N
}
Image image = null;
// First check for Mac because its part of the Unix_Mask
if (getOperatingSystem() == OS_MAC) {
image = loadImage("org/openide/resources/progress-cursor-mac.gif"); //NOI18N
}
else if (isUnix()) {
image = loadImage("org/openide/resources/progress-cursor-motif.gif"); //NOI18N
}
// All other OS, including Windows, use Windows cursor
else {
image = loadImage("org/openide/resources/progress-cursor-win.gif"); //NOI18N
}
return createCustomCursor (component, image, "PROGRESS_CURSOR"); //NOI18N
}
// added to fix issue #30665 (bad size on linux)
private static Cursor createCustomCursor(Component component, Image icon, String name) {
Toolkit t = component.getToolkit();
Dimension d = t.getBestCursorSize(16, 16);
Image i = icon;
if (d.width != icon.getWidth(null)) {
if ((d.width) == 0 && (d.height == 0)) {
// system doesn't support custom cursors, falling back
return Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR);
}
// need to resize the icon
Image empty = IconManager.createBufferedImage(d.width, d.height);
i = Utilities.mergeImages(icon, empty, 0, 0);
}
return t.createCustomCursor(i, new Point(1,1), name);
}
/** Attaches asynchronous init job to given component.
* {@link AsyncGUIJob#construct()} will be called after first
* paint, when paint event arrives. Later, {@link AsyncGUIJob#finished()}
* will be called according to the rules of the You may not use a URL generated from a file on a different
* platform, as file name conventions may make the result meaningless
* or even unparsable.
* @param u a URL with the |
The search page
Other source code files at this package level
Click here to learn more about this project
