summaryrefslogtreecommitdiff
path: root/java
diff options
context:
space:
mode:
authorLillian Angel <langel@redhat.com>2006-03-15 19:34:29 +0000
committerLillian Angel <langel@redhat.com>2006-03-15 19:34:29 +0000
commit448cd90d1d0f7498f24486f6bac74e37c819f7e4 (patch)
tree8274233de1003270bcb269aad6384e6f4b263a88 /java
parentd27318be099b4e8b55f2c9ed9e1e12a9275c99f6 (diff)
downloadclasspath-448cd90d1d0f7498f24486f6bac74e37c819f7e4.tar.gz
2006-03-15 Lillian Angel <langel@redhat.com>
* java/awt/Container.java (getComponentAt): Fixed documentation. (getComponentAt): Likewise.
Diffstat (limited to 'java')
-rw-r--r--java/awt/Container.java12
1 files changed, 6 insertions, 6 deletions
diff --git a/java/awt/Container.java b/java/awt/Container.java
index 0975367c4..9af058178 100644
--- a/java/awt/Container.java
+++ b/java/awt/Container.java
@@ -965,9 +965,9 @@ public class Container extends Component
* unless the point does not exist within this container, in which
* case <code>null</code> is returned.
*
- * The top-most child component is returned in the case where components overlap.
- * This is determined by finding the component closest to (x,y) and contains
- * that location. Heavyweight components take precedence of lightweight components.
+ * When components overlap, the first component is returned. The component
+ * that is closest to (x, y), containing that location, is returned.
+ * Heavyweight components take precedence of lightweight components.
*
* This function does not ignore invisible components. If there is an invisible
* component at (x,y), it will be returned.
@@ -991,9 +991,9 @@ public class Container extends Component
* unless the point does not exist within this container, in which
* case <code>null</code> is returned.
*
- * The top-most child component is returned in the case where components overlap.
- * This is determined by finding the component closest to (x,y) and contains
- * that location. Heavyweight components take precedence of lightweight components.
+ * When components overlap, the first component is returned. The component
+ * that is closest to (x, y), containing that location, is returned.
+ * Heavyweight components take precedence of lightweight components.
*
* This function does not ignore invisible components. If there is an invisible
* component at (x,y), it will be returned.