Commit 68f14fb0 by Graydon Hoare Committed by Graydon Hoare

JLayeredPane.java: Fix semantics, add javadocs.

2004-01-06  Graydon Hoare  <graydon@redhat.com>

	* javax/swing/JLayeredPane.java: Fix semantics, add javadocs.

From-SVN: r75478
parent 68dad687
2004-01-06 Graydon Hoare <graydon@redhat.com>
* javax/swing/JLayeredPane.java: Fix semantics, add javadocs.
2004-01-06 Michael Koch <konqueror@gmx.de> 2004-01-06 Michael Koch <konqueror@gmx.de>
* gnu/java/net/protocol/file/Connection.java: * gnu/java/net/protocol/file/Connection.java:
......
/* JLayeredPane.java -- /* JLayeredPane.java --
Copyright (C) 2002 Free Software Foundation, Inc. Copyright (C) 2002 Free Software Foundation, Inc.
This file is part of GNU Classpath. This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option) the Free Software Foundation; either version 2, or (at your option)
any later version. any later version.
GNU Classpath is distributed in the hope that it will be useful, but GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details. General Public License for more details.
You should have received a copy of the GNU General Public License You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. 02111-1307 USA.
Linking this library statically or dynamically with other modules is Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole conditions of the GNU General Public License cover the whole
combination. combination.
As a special exception, the copyright holders of this library give you As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */ exception statement from your version.
*/
package javax.swing; package javax.swing;
...@@ -45,347 +46,551 @@ import javax.accessibility.Accessible; ...@@ -45,347 +46,551 @@ import javax.accessibility.Accessible;
/** /**
* The "Layered Pane" is a container which divides its children into 6 (or * <p>The "Layered Pane" is a container which divides its children into 6 (or
* more) disjoint sets. the pre-defined sets are: * more) disjoint sets. the pre-defined sets are:</p>
* *
* "Frame Content", "Default", "Palette", "Modal", "Popup", and "Drag". * <ul>
* <li>"Frame Content"</li>
* <li>"Default"</li>
* <li>"Palette"</li>
* <li>"Modal"</li>
* <li>"Popup"</li>
* <li>"Drag"</li>
* </ul>
* *
* A child is in exactly one of these layers at any time, though there may * <p>A child is in exactly one of these layers at any time, though there may
* be other layers if someone creates them. * be other layers if someone creates them.</p>
* *
* The purpose of this class is to translate this view of "layers" into a * <p>The purpose of this class is to translate this view of "layers" into a
* contiguous array of components: the one held in our ancestor, * contiguous array of components: the one held in our ancestor,
* java.awt.Container. * {@link java.awt.Container}.</p>
* *
* There is a precise set of words we will use to refer to numbers within * <p>There is a precise set of words we will use to refer to numbers within
* this class: * this class:</p>
* *
* Internal Component Index: an offset into the "component" array held in * <dl>
* our ancestor, java.awt.Container, from [0 .. component.length). The * <dt>Internal Component Index:</dt>
* drawing rule with internal indices is that 0 is drawn first. * <dd>An offset into the <code>component</code> array held in our ancestor,
* {@link java.awt.Container}, from <code>[0 .. component.length)</code>. The drawing
* rule with internal indices is that 0 is drawn first.</dd>
* *
* External Component Index: an offset into the "logical drawing order" of * <dt>External Component Index:</dt>
* this container. If I is the internal index of a component, the external * <dd>An offset into the "logical drawing order" of this container. If <code>I</code>
* index E = component.length - I. The rule with external indices is that 0 * is the internal index of a component, the external index <tt>E =
* is drawn last. * component.length - I</tt>. The rule with external indices is that 0 is
* drawn last.</dd>
* *
* Layer Number: a general int specifying a layer within this component. * <dt>Layer Number:</dt>
* Negative numbers are drawn first, then layer 0, then positive numbered * <dd>A general <code>int</code> specifying a layer within this component. Negative
* layers, in ascending order. * numbers are drawn first, then layer 0, then positive numbered layers, in
* ascending order.</dd>
* *
* Position: an offset into a layer's "logical drawing order". Layer * <dt>Position:</dt>
* position 0 is drawn last. Layer position -1 is a synonym for the first * <dd>An offset into a layer's "logical drawing order". Layer position 0
* layer position (the logical "bottom"). * is drawn last. Layer position -1 is a synonym for the first layer
* position (the logical "bottom").</dd>
*
* @author Graydon Hoare <graydon@redhat.com>
*/ */
public class JLayeredPane extends JComponent implements Accessible public class JLayeredPane extends JComponent implements Accessible
{ {
public static String LAYER_PROPERTY = "LAYER_PROPERTY"; public static String LAYER_PROPERTY = "LAYER_PROPERTY";
public static Integer FRAME_CONTENT_LAYER = new Integer (-30000);
public static Integer DEFAULT_LAYER = new Integer (0);
public static Integer PALETTE_LAYER = new Integer (100);
public static Integer MODAL_LAYER = new Integer (200);
public static Integer POPUP_LAYER = new Integer (300);
public static Integer DRAG_LAYER = new Integer (400);
TreeMap layers; // Layer Number (Integer) -> Layer Size (Integer)
Hashtable componentToLayer; // Component -> Layer Number (Integer)
public static Integer FRAME_CONTENT_LAYER = new Integer (-30000); JLayeredPane()
{
layers = new TreeMap ();
componentToLayer = new Hashtable ();
}
public static Integer DEFAULT_LAYER = new Integer (0);
public static Integer PALETTE_LAYER = new Integer (100);
public static Integer MODAL_LAYER = new Integer (200);
public static Integer POPUP_LAYER = new Integer (300);
public static Integer DRAG_LAYER = new Integer (400);
TreeMap layers; // Layer Number (Integer) -> Layer Size (Integer) /**
Hashtable componentToLayer; // Component -> Layer Number (Integer) * Looks up the layer a child component is currently assigned to.
*
* @param c the component to look up.
* @return the layer the component is currently assigned to, in this container.
* @throws IllegalArgumentException if the component is not a child of this container.
*/
protected Integer getLayer (Component c) protected Integer getLayer (Component c)
{ {
if (! componentToLayer.containsKey (c)) if (! componentToLayer.containsKey (c))
throw new IllegalArgumentException (); throw new IllegalArgumentException ();
return (Integer) componentToLayer.get (c); return (Integer) componentToLayer.get (c);
} }
// this returns a half-open range [bottom, top), which is the range of /**
// internal component indices this layer number corresponds to. note * Returns a pair of ints representing a half-open interval
// that top is *not* included in the range of component indices in this * <code>[bottom, top)</code>, which is the range of internal component
// layer: a layer with 0 elements in it has ret[0] == ret[1]. * indices the provided layer number corresponds to.
*
protected int[] layerToRange (Integer layer) * Note that "top" is <em>not</em> included in the interval of
{ * component indices in this layer: a layer with 0 elements in it has
int[] ret = new int[2]; * <code>ret[0] == ret[1]</code>.
Iterator i = layers.entrySet ().iterator (); *
while (i.hasNext()) * @param layer the layer to look up.
* @return the half-open range of internal indices this layer spans.
* @throws IllegalArgumentException if layer does not refer to an active layer
* in this container.
*/
protected int[] layerToRange (Integer layer)
{
int[] ret = new int[2];
Iterator i = layers.entrySet ().iterator ();
while (i.hasNext())
{ {
Map.Entry pair = (Map.Entry) i.next(); Map.Entry pair = (Map.Entry) i.next();
Integer layerNum = (Integer) pair.getKey (); Integer layerNum = (Integer) pair.getKey ();
Integer layerSz = (Integer) pair.getValue (); Integer layerSz = (Integer) pair.getValue ();
if (layerNum == layer) if (layerNum == layer)
{ {
ret[1] = ret[0] + layerSz.intValue (); ret[1] = ret[0] + layerSz.intValue ();
return ret; return ret;
} }
else else
{ {
ret[0] += layerSz.intValue (); ret[0] += layerSz.intValue ();
} }
} }
// should have found the layer during iteration // should have found the layer during iteration
throw new IllegalArgumentException (); throw new IllegalArgumentException ();
} }
protected void incrLayer(Integer layer) /**
{ * Increments the recorded size of a given layer.
int sz = 1; *
if (layers.containsKey (layer)) * @param layer the layer number to increment.
* @see #incrLayer()
*/
protected void incrLayer(Integer layer)
{
int sz = 1;
if (layers.containsKey (layer))
sz += ((Integer)(layers.get (layer))).intValue (); sz += ((Integer)(layers.get (layer))).intValue ();
layers.put (layer, new Integer(sz)); layers.put (layer, new Integer(sz));
} }
protected void decrLayer(Integer layer) /**
{ * Decrements the recorded size of a given layer.
int sz = 0; *
if (layers.containsKey (layer)) * @param layer the layer number to decrement.
* @see #decrLayer()
*/
protected void decrLayer(Integer layer)
{
int sz = 0;
if (layers.containsKey (layer))
sz = ((Integer)(layers.get (layer))).intValue () - 1; sz = ((Integer)(layers.get (layer))).intValue () - 1;
layers.put (layer, new Integer(sz)); layers.put (layer, new Integer(sz));
} }
JLayeredPane() /**
{ * Return the greatest layer number currently in use, in this container.
layers = new TreeMap (); * This number may legally be positive <em>or</em> negative.
layers.put (FRAME_CONTENT_LAYER, new Integer (0)); *
layers.put (DEFAULT_LAYER, new Integer (0)); * @return the least layer number.
layers.put (PALETTE_LAYER, new Integer (0)); * @see #lowestLayer()
layers.put (MODAL_LAYER, new Integer (0)); */
layers.put (POPUP_LAYER, new Integer (0));
layers.put (DRAG_LAYER, new Integer (0)); public int highestLayer()
{
componentToLayer = new Hashtable (); if (layers.size() == 0)
}
public int highestLayer()
{
if (layers.size() == 0)
return 0; return 0;
return ((Integer)(layers.lastKey ())).intValue (); return ((Integer)(layers.lastKey ())).intValue ();
} }
/**
* Return the least layer number currently in use, in this container.
* This number may legally be positive <em>or</em> negative.
*
* @return the least layer number.
* @see #highestLayer()
*/
public int lowestLayer() public int lowestLayer()
{ {
if (layers.size() == 0) if (layers.size() == 0)
return 0; return 0;
return ((Integer)(layers.firstKey ())).intValue (); return ((Integer)(layers.firstKey ())).intValue ();
} }
public void moveToFront(Component c) /**
{ * Moves a component to the "front" of its layer. The "front" is a
setPosition (c, 0); * synonym for position 0, which is also the last position drawn in each
} * layer, so is usually the component which occludes the most other
* components in its layer.
public void moveToBack(Component c) *
{ * @param c the component to move to the front of its layer.
setPosition (c, -1); * @throws IllegalArgumentException if the component is not a child of
} * this container.
* @see #moveToBack()
*/
public void moveToFront(Component c)
{
setPosition (c, 0);
}
/**
* <p>Moves a component to the "back" of its layer. The "back" is a
* synonym for position N-1 (also known as position -1), where N is the
* size of the layer.</p>
*
* <p>The "back" of a layer is the first position drawn, so the component at
* the "back" is usually the component which is occluded by the most
* other components in its layer.</p>
*
* @param c the component to move to the back of its layer.
* @throws IllegalArgumentException if the component is not a child of
* this container.
* @see #moveToFront()
*/
public void moveToBack(Component c)
{
setPosition (c, -1);
}
/**
* Return the position of a component within its layer. Positions are assigned
* from the "front" (position 0) to the "back" (position N-1), and drawn from
* the back towards the front.
*
* @param c the component to get the position of.
* @throws IllegalArgumentException if the component is not a child of
* this container.
* @see #setPosition()
*/
public int getPosition(Component c) public int getPosition(Component c)
{ {
Integer layer = getLayer (c); Integer layer = getLayer (c);
int[] range = layerToRange (layer); int[] range = layerToRange (layer);
int top = (range[1] - 1); int top = (range[1] - 1);
Component[] comps = getComponents (); Component[] comps = getComponents ();
for (int i = range[0]; i < range[1]; ++i) for (int i = range[0]; i < range[1]; ++i)
{ {
if (comps[i] == c) if (comps[i] == c)
return top - i; return top - i;
} }
// should have found it // should have found it
throw new IllegalArgumentException (); throw new IllegalArgumentException ();
} }
public void setPosition(Component c, int position) /**
{ * Change the position of a component within its layer. Positions are assigned
Integer layer = getLayer (c); * from the "front" (position 0) to the "back" (position N-1), and drawn from
int[] range = layerToRange (layer); * the back towards the front.
if (range[0] == range[1]) *
* @param c the component to change the position of.
* @param position the position to assign the component to.
* @throws IllegalArgumentException if the component is not a child of
* this container.
* @see #getPosition()
*/
public void setPosition(Component c, int position)
{
Integer layer = getLayer (c);
int[] range = layerToRange (layer);
if (range[0] == range[1])
throw new IllegalArgumentException (); throw new IllegalArgumentException ();
int top = (range[1] - 1); int top = (range[1] - 1);
if (position == -1) if (position == -1)
position = top - range[0]; position = top - range[0];
int targ = top - position; int targ = top - position;
int curr = -1; int curr = -1;
Component[] comps = getComponents(); Component[] comps = getComponents();
for (int i = range[0]; i < range[1]; ++i) for (int i = range[0]; i < range[1]; ++i)
{ {
if (comps[i] == c) if (comps[i] == c)
{ {
curr = i; curr = i;
break; break;
} }
} }
if (curr == -1) if (curr == -1)
// should have found it // should have found it
throw new IllegalArgumentException (); throw new IllegalArgumentException ();
// System.err.println("set component position to " + position + " in layer " + layer); super.swapComponents (curr, targ);
validate();
Component tmp = comps[curr]; repaint();
super.remove (curr); }
super.add (tmp, targ);
super.validate ();
}
/**
* Return an array of all components within a layer of this
public Component[] getComponentsInLayer(int layer) * container. Components are ordered back-to-front, with the "back"
{ * element (which draws first) at position 0 of the returned array.
int[] range = layerToRange (getObjectForLayer (layer)); *
if (range[0] == range[1]) * @param layer the layer to return components from.
* @return the components in the layer.
*/
public Component[] getComponentsInLayer(int layer)
{
int[] range = layerToRange (getObjectForLayer (layer));
if (range[0] == range[1])
return new Component[0]; return new Component[0];
else else
{ {
Component[] comps = getComponents (); Component[] comps = getComponents ();
int sz = (range[1] - 1) - range[0]; int sz = (range[1] - 1) - range[0];
Component[] nc = new Component[sz]; Component[] nc = new Component[sz];
for (int i = 0; i < sz; ++i) for (int i = 0; i < sz; ++i)
nc[i] = comps[range[0] + i]; nc[i] = comps[range[0] + i];
return nc; return nc;
} }
} }
public int getComponentCountInLayer(int layer) /**
{ * Return the number of components within a layer of this
int[] range = layerToRange (getObjectForLayer (layer)); * container.
if (range[0] == range[1]) *
* @param layer the layer count components in.
* @return the number of components in the layer.
*/
public int getComponentCountInLayer(int layer)
{
int[] range = layerToRange (getObjectForLayer (layer));
if (range[0] == range[1])
return 0; return 0;
else else
return ((range[1] - 1) - range[0]); return (range[1] - range[0]);
} }
protected Hashtable getComponentToLayer() /**
{ * Return a hashtable mapping child components of this container to
return componentToLayer; * Integer objects representing the component's layer assignments.
} */
protected int getInternalIndexOf(Component c) protected Hashtable getComponentToLayer()
{ {
Integer layer = getLayer (c); return componentToLayer;
int[] range = layerToRange (layer); }
Component[] comps = getComponents();
for (int i = range[0]; i < range[1]; ++i)
/**
* Return the index of a component within the underlying (contiguous)
* array of children. This is a "raw" number which does not represent the
* child's position in a layer, but rather its position in the
* concatenation of <em>all</em> layers within the container.
*
* @param c the component to look up.
* @return the internal index of the component.
* @throws IllegalArgumentException if the component is not a child of
* this container.
*/
protected int getInternalIndexOf(Component c)
{
Integer layer = getLayer (c);
int[] range = layerToRange (layer);
Component[] comps = getComponents();
for (int i = range[0]; i < range[1]; ++i)
{ {
if (comps[i] == c) if (comps[i] == c)
return i; return i;
} }
// should have found the component during iteration // should have found the component during iteration
throw new IllegalArgumentException (); throw new IllegalArgumentException ();
} }
public int getIndexOf(Component c) /**
{ * Return the external index of a component within the underlying
// returns the *external* index of the component. * (contiguous) array of children. This is a "raw" number which does not
int top = getComponentCount() - 1; * represent the child's position in a layer, but rather its position in
return top - getIndexOf (c); * the logical drawing order of all children of the container.
} *
* @param c the component to look up.
* @return the external index of the component.
protected Integer getObjectForLayer(int layer) * @throws IllegalArgumentException if the component is not a child of
{ * this container.
switch (layer) */
public int getIndexOf(Component c)
{
// returns the *external* index of the component.
int top = getComponentCount() - 1;
return top - getIndexOf (c);
}
/**
* Return an Integer object which holds the same int value as the
* parameter. This is strictly an optimization to minimize the number of
* identical Integer objects which we allocate.
*
* @param layer the layer number as an int.
* @return the layer number as an Integer, possibly shared.
*/
protected Integer getObjectForLayer(int layer)
{
switch (layer)
{ {
case -30000: case -30000:
return FRAME_CONTENT_LAYER; return FRAME_CONTENT_LAYER;
case 0: case 0:
return DEFAULT_LAYER; return DEFAULT_LAYER;
case 100: case 100:
return PALETTE_LAYER; return PALETTE_LAYER;
case 200: case 200:
return MODAL_LAYER; return MODAL_LAYER;
case 300: case 300:
return POPUP_LAYER; return POPUP_LAYER;
case 400: case 400:
return DRAG_LAYER; return DRAG_LAYER;
default: default:
break; break;
} }
return new Integer(layer); return new Integer(layer);
} }
/**
* Computes an internal index at which to request the superclass {@link
* java.awt.Container} inserts a component, given an abstract layer and
* position number.
*
* @param layer the layer in which to insert a component.
* @param position the position in the layer at which to insert a component.
* @return the internal index at which to insert the component.
*/
protected int insertIndexForLayer(int layer, int position) protected int insertIndexForLayer(int layer, int position)
{ {
int[] range = layerToRange (getObjectForLayer (layer));
if (range[0] == range[1]) Integer lobj = getObjectForLayer (layer);
if (! layers.containsKey(lobj))
layers.put (lobj, new Integer (0));
int[] range = layerToRange (lobj);
if (range[0] == range[1])
return range[0]; return range[0];
int bottom = range[0]; int bottom = range[0];
int top = range[1] - 1; int top = range[1] - 1;
if (position == -1 || position > (top - bottom)) if (position == -1 || position > (top - bottom))
return bottom; return bottom;
else else
return top - position; return top - position;
} }
/**
* Removes a child from this container. The child is specified by
* internal index. After removal, the child no longer occupies a layer.
*
* @param index the internal index of the child component to remove.
*/
public void remove (int index) public void remove (int index)
{ {
Component c = getComponent (index); Component c = getComponent (index);
Integer layer = getLayer (c); Integer layer = getLayer (c);
decrLayer (layer); decrLayer (layer);
componentToLayer.remove (c); componentToLayer.remove (c);
super.remove (index); super.remove (index);
} }
/**
* Removes a child from this container. The child is specified directly.
* After removal, the child no longer occupies a layer.
*
* @param comp the child to remove.
*/
public void remove (Component comp) public void remove (Component comp)
{ {
Integer layer = getLayer (comp); remove (getInternalIndexOf (comp));
decrLayer (layer); }
componentToLayer.remove (comp);
super.remove (comp); /**
} * <p>Set the layer property for a component, within this container. The
* component will be implicitly mapped to the bottom-most position in the
public void removeAll () * layer, but only if added <em>after</em> calling this method.</p>
{ *
componentToLayer.clear (); * <p>Read that carefully: this method should be called <em>before</em> the
layers.clear (); * component is added to the container.</p>
super.removeAll (); *
} * @param c the component to set the layer property for.
* @param layer the layer number to assign to the component.
public void setLayer(Component c, int layer) */
{
componentToLayer.put (c, getObjectForLayer (layer)); public void setLayer(Component c, int layer)
} {
componentToLayer.put (c, getObjectForLayer (layer));
public void setLayer(Component c, }
int layer,
int position) /**
{ * Set the layer and position of a component, within this container.
componentToLayer.put (c, getObjectForLayer (layer)); *
setPosition(c, position); * @param c the child component to set the layer property for.
repaint(); * @param layer the layer number to assign to the component.
} * @param position the position number to assign to the component.
*/
protected void addImpl(Component comp, Object layerConstraint, int index)
{ public void setLayer(Component c,
Integer layer; int layer,
if (layerConstraint != null && layerConstraint instanceof Integer) int position)
layer = (Integer) layerConstraint; {
else if (componentToLayer.containsKey (comp)) componentToLayer.put (c, getObjectForLayer (layer));
setPosition(c, position);
validate();
repaint();
}
/**
* Overrides the default implementation from {@link java.awt.Container}
* such that <code>layerConstraint</code> is interpreted as an {@link
* Integer}, specifying the layer to which the component will be added
* (at the bottom position).
*
* @param comp the component to add.
* @param layerConstraint an integer specifying the layer to add the component to.
* @param index an ignored parameter, for compatibility.
*/
protected void addImpl(Component comp, Object layerConstraint, int index)
{
Integer layer;
if (layerConstraint != null && layerConstraint instanceof Integer)
layer = (Integer) layerConstraint;
else if (componentToLayer.containsKey (comp))
layer = (Integer) componentToLayer.remove (comp); layer = (Integer) componentToLayer.remove (comp);
else else
layer = DEFAULT_LAYER; layer = DEFAULT_LAYER;
int newIdx = insertIndexForLayer(layer.intValue (), -1); int newIdx = insertIndexForLayer(layer.intValue (), -1);
componentToLayer.put (comp, layer); componentToLayer.put (comp, layer);
incrLayer (layer); incrLayer (layer);
// System.err.println("adding component to layer " + layer);
super.addImpl(comp, null, newIdx); super.addImpl(comp, null, newIdx);
validate(); validate();
repaint(); repaint();
} }
} }
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment