From c7a136d3ef16cf20fcd5314036508e31870b4849 Mon Sep 17 00:00:00 2001
From: Bryce McKinlay <bryce@albatross.co.nz>
Date: Wed, 12 Jul 2000 03:32:07 +0000
Subject: Big AWT patch.
From-SVN: r34976
---
libjava/java/awt/Insets.java | 56 ++++++++++++++++++++++++++++++++++++++++++++
1 file changed, 56 insertions(+)
create mode 100644 libjava/java/awt/Insets.java
(limited to 'libjava/java/awt/Insets.java')
diff --git a/libjava/java/awt/Insets.java b/libjava/java/awt/Insets.java
new file mode 100644
index 0000000..c28353e
--- /dev/null
+++ b/libjava/java/awt/Insets.java
@@ -0,0 +1,56 @@
+/* Copyright (C) 2000 Free Software Foundation
+
+ This file is part of libgcj.
+
+This software is copyrighted work licensed under the terms of the
+Libgcj License. Please consult the file "LIBGCJ_LICENSE" for
+details. */
+
+package java.awt;
+
+public class Insets implements Cloneable, java.io.Serializable
+{
+ public int top;
+ public int left;
+ public int bottom;
+ public int right;
+
+ public Insets(int top, int left, int bottom, int right)
+ {
+ this.top = top;
+ this.left = left;
+ this.bottom = bottom;
+ this.right = right;
+ }
+
+ public boolean equals(Object obj)
+ {
+ if (obj instanceof Insets)
+ {
+ Insets i = (Insets) obj;
+ return (i.top == top
+ && i.left == left
+ && i.bottom == bottom
+ && i.right == right);
+ }
+ return false;
+ }
+
+ public int hashCode()
+ {
+ // FIXME: what is the correct algorithm for this?
+ return (top * (2 * left) * (3 * right) * (4 * bottom));
+ }
+
+ public String toString()
+ {
+ return (getClass() + "[top=" + top + ",left=" + left + ",bottom="
+ + bottom + ",right=" + right + "]");
+ }
+
+ public Object clone()
+ {
+ Insets r = new Insets(top, left, bottom, right);
+ return r;
+ }
+}
--
cgit v1.1