com.sun.javafx.geom.BaseBounds Maven / Gradle / Ivy
/*
* Copyright (c) 2011, 2013, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package com.sun.javafx.geom;
/**
* Base class for mutable bounds objects. There are two concrete specializations,
* BoxBounds (3D) and RectBounds (2D). Various "derive" methods exist which are
* used to mutate the bounds objects, such that they can be converted between the
* different types as appropriate, or modified in place if possible. This allows
* us to churn memory as little as possible without representing everything as
* if it were in 3D space (there are some computational cost savings to being
* able to ignore the Z values).
*/
public abstract class BaseBounds {
/**
* The different types of BaseBounds that are currently supported.
* We might support other types of bounds in the future (such as
* SPHERE) which are also 2D or 3D but are defined in some way
* other than with a bounding box. Such bounds can sometimes more
* accurately represent the pixels
*/
public static enum BoundsType {
RECTANGLE, // A 2D axis-aligned bounding rectangle
BOX, // A 3D axis-aligned bounding box
}
// Only allow subclasses in this package
BaseBounds() { }
/**
* Duplicates this instance. This differs from deriveWithNewBounds(other)
* where "other" would be this, in that derive methods may return the
* same instance, whereas copy will always return a new instance.
*/
public abstract BaseBounds copy();
/**
* Return true if this bounds is of a 2D BoundsType, else false.
*/
public abstract boolean is2D();
public abstract BoundsType getBoundsType();
/**
* Convenience function for getting the width of this bounds.
* The dimension along the X-Axis.
*/
public abstract float getWidth();
/**
* Convenience function for getting the height of this bounds.
* The dimension along the Y-Axis.
*/
public abstract float getHeight();
/**
* Convenience function for getting the depth of this bounds.
* The dimension along the Z-Axis.
*/
public abstract float getDepth();
public abstract float getMinX();
public abstract float getMinY();
public abstract float getMinZ();
public abstract float getMaxX();
public abstract float getMaxY();
public abstract float getMaxZ();
public abstract void translate(float x, float y, float z);
public abstract Vec2f getMin(Vec2f min);
public abstract Vec2f getMax(Vec2f max);
public abstract Vec3f getMin(Vec3f min);
public abstract Vec3f getMax(Vec3f max);
public abstract BaseBounds deriveWithUnion(BaseBounds other);
// TODO: Add variants of deriveWithNewBounds such as pair of Vec* (RT-26886)
public abstract BaseBounds deriveWithNewBounds(Rectangle other);
public abstract BaseBounds deriveWithNewBounds(BaseBounds other);
public abstract BaseBounds deriveWithNewBounds(float minX, float minY, float minZ,
float maxX, float maxY, float maxZ);
public abstract BaseBounds deriveWithNewBoundsAndSort(float minX, float minY, float minZ,
float maxX, float maxY, float maxZ);
public abstract BaseBounds deriveWithPadding(float h, float v, float d);
public abstract void intersectWith(Rectangle other);
public abstract void intersectWith(BaseBounds other);
public abstract void intersectWith(float minX, float minY, float minZ,
float maxX, float maxY, float maxZ);
/**
* Sets the bounds based on the given points, and also ensures that
* after having done so that this bounds instance is sorted (x1<=x2 and y1<=y2).
*/
public abstract void setBoundsAndSort(Point2D p1, Point2D p2);
public abstract void setBoundsAndSort(float minX, float minY, float minZ,
float maxX, float maxY, float maxZ);
// TODO: obsolete add and replace with deriveWithUnion(Vec2f v) and deriveWithUnion(Vec3f v)
// (RT-26886)
public abstract void add(Point2D p);
public abstract void add(float x, float y, float z);
public abstract boolean contains(Point2D p);
public abstract boolean contains(float x, float y);
public abstract boolean intersects(float x, float y, float width, float height);
public abstract boolean isEmpty();
public abstract void roundOut();
/**
* Sets the given RectBounds (or creates a new instance of bounds is null) to
* have the minX, minY, maxX, and maxY of this BoxBounds, dropping the Z values.
*
* @param bounds The bounds to fill with values, or null. If null, a new RectBounds
* is returned. If not null, the given bounds will be populated and
* then returned
* @return a non-null reference to a RectBounds containing the minX, minY, maxX, and
* maxY of this BoxBounds.
*/
public abstract RectBounds flattenInto(RectBounds bounds);
public abstract BaseBounds makeEmpty();
public abstract boolean disjoint(float x, float y, float width, float height);
protected abstract void sortMinMax();
public static BaseBounds getInstance(float minX, float minY, float minZ,
float maxX, float maxY, float maxZ) {
if (minZ == 0 && maxZ == 0) {
return getInstance(minX, minY, maxX, maxY);
} else {
return new BoxBounds(minX, minY, minZ, maxX, maxY, maxZ);
}
}
public static BaseBounds getInstance(float minX, float minY,
float maxX, float maxY) {
return new RectBounds(minX, minY, maxX, maxY);
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy