dmose%mozilla.org 0efb7c174c updated xPL license boilerplate to v1.1, a=chofmann@netscape.com,r=endico@mozilla.org
git-svn-id: svn://10.0.0.236/trunk@52910 18797224-902f-48f8-a5cc-f745e15eee43
1999-11-06 03:43:54 +00:00

63 lines
1.7 KiB
Java

/* -*- Mode: Java; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
*
* The contents of this file are subject to the Netscape Public
* License Version 1.1 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.mozilla.org/NPL/
*
* Software distributed under the License is distributed on an "AS
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
* implied. See the License for the specific language governing
* rights and limitations under the License.
*
* The Original Code is mozilla.org code.
*
* The Initial Developer of the Original Code is Netscape
* Communications Corporation. Portions created by Netscape are
* Copyright (C) 1998 Netscape Communications Corporation. All
* Rights Reserved.
*
* Contributor(s):
*/
package netscape.plugin.composer.mapedit;
import java.awt.*;
public class Circle {
Circle(int xx,int yy,int rr) {x = xx; y = yy; radius = rr;}
Rectangle boundingBox() {
// Rectangle centered at (x,y).
Rectangle r = new Rectangle(x - radius,y - radius,2 * radius + 1,2 * radius + 1);
return r;
}
/** Circle acts like a closed disk. I.e. boundary is included. */
boolean containsPoint(int xx,int yy) {
return dist(x,y,xx,yy) <= radius;
}
/** Standard Euclidean distance. */
static double dist(Point p1,Point p2) {
return dist(p1.x,p1.y,p2.x,p2.y);
}
void moveBy(int dx,int dy) {
x += dx;
y += dy;
}
static double dist(int x1,int y1,int x2,int y2) {
int dx = x2 - x1;
int dy = y2 - y1;
return Math.sqrt(dx * dx + dy * dy);
}
// Center.
int x;
int y;
int radius;
}