Application: gvSIG desktop

<project name="libGeoUtils" default="create-jar" basedir=".">

  	<!-- set global properties for this build -->

	<property name="src"  location="src"/>

	<property name="src-test" location="src-test"/>

	<property name="build"  location="bin"/>

	<property name="build-test" location="bin-test"/>

	<property name="dist"  location="dist"/>

	<property name="targetDir" location="../libFMap/lib"/>

	<property name="jarName" value="geoutils.jar"/>

	<import file="../binaries/ant/utilities.xml"/>

  <target name="init">

    <!-- Create the time stamp -->

<!--    <tstamp/>-->

	<echo>

		Compiling ${ant.project.name}...</echo>

  </target>

	<target name="batch-build"

				description="compile the sources, create the jar file"

				depends="init,compile,create-jar">

	</target>

	<target name="compile" description="compile the source">

		<!-- Compile the Java code from ${src} to ${build} -->

		<mkdir dir="${build}" />

		<loadEclipseClasspath project="${basedir}"/>

		<gvSIG-javac

			classpath="${eclipseClasspath}"

		/>

		<copy todir="${build}">

			<fileset dir="${src}" excludes="**/*.java" casesensitive="false"/>

		</copy>

	</target>

	<target name="create-jar" description="Crea el jar de la aplicacion">

		<!--<mkdir dir="${dist}" />-->

	  	<jar jarfile="${targetDir}/${jarName}" basedir="${build}"/>

	</target>

	<target name="clean" description="clean up">

		<!-- Delete the ${build} and ${dist} directory trees -->

		<delete dir="${build}" />

		<delete dir="${dist}" />

	</target>

	<target name="run-tests" depends="batch-build,compile-tests">

		<antcall target="generic-run-tests">

			<param name="TestSuite.Name" value="com.iver.utiles.AllTests"/>

		</antcall>

	</target>

</project>

<?xml version="1.0" encoding="UTF-8"?>

<classpath>

	<classpathentry kind="src" path="src"/>

	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>

	<classpathentry kind="output" path="bin"/>

</classpath>

The GNU General Public License (GPL)

Version 2, June 1991

Copyright (C) 1989, 1991 Free Software Foundation, Inc.

59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

Everyone is permitted to copy and distribute verbatim copies of this license

document, but changing it is not allowed.

Preamble

The licenses for most software are designed to take away your freedom to share

and change it.  By contrast, the GNU General Public License is intended to

guarantee your freedom to share and change free software--to make sure the

software is free for all its users.  This General Public License applies to

most of the Free Software Foundation's software and to any other program whose

authors commit to using it.  (Some other Free Software Foundation software is

covered by the GNU Library General Public License instead.) You can apply it to

your programs, too.

When we speak of free software, we are referring to freedom, not price.  Our

General Public Licenses are designed to make sure that you have the freedom to

distribute copies of free software (and charge for this service if you wish),

that you receive source code or can get it if you want it, that you can change

the software or use pieces of it in new free programs; and that you know you

can do these things.

To protect your rights, we need to make restrictions that forbid anyone to deny

you these rights or to ask you to surrender the rights.  These restrictions

translate to certain responsibilities for you if you distribute copies of the

software, or if you modify it.

For example, if you distribute copies of such a program, whether gratis or for

a fee, you must give the recipients all the rights that you have.  You must

make sure that they, too, receive or can get the source code.  And you must

show them these terms so they know their rights.

We protect your rights with two steps: (1) copyright the software, and (2)

offer you this license which gives you legal permission to copy, distribute

and/or modify the software.

Also, for each author's protection and ours, we want to make certain that

everyone understands that there is no warranty for this free software.  If the

software is modified by someone else and passed on, we want its recipients to

know that what they have is not the original, so that any problems introduced

by others will not reflect on the original authors' reputations.

Finally, any free program is threatened constantly by software patents.  We

wish to avoid the danger that redistributors of a free program will

individually obtain patent licenses, in effect making the program proprietary.

To prevent this, we have made it clear that any patent must be licensed for

everyone's free use or not licensed at all.

The precise terms and conditions for copying, distribution and modification

follow.

TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION

0. This License applies to any program or other work which contains a notice

placed by the copyright holder saying it may be distributed under the terms of

this General Public License.  The "Program", below, refers to any such program

or work, and a "work based on the Program" means either the Program or any

derivative work under copyright law: that is to say, a work containing the

Program or a portion of it, either verbatim or with modifications and/or

translated into another language.  (Hereinafter, translation is included

without limitation in the term "modification".) Each licensee is addressed as

"you".

Activities other than copying, distribution and modification are not covered by

this License; they are outside its scope.  The act of running the Program is

not restricted, and the output from the Program is covered only if its contents

constitute a work based on the Program (independent of having been made by

running the Program).  Whether that is true depends on what the Program does.

1. You may copy and distribute verbatim copies of the Program's source code as

you receive it, in any medium, provided that you conspicuously and

appropriately publish on each copy an appropriate copyright notice and

disclaimer of warranty; keep intact all the notices that refer to this License

and to the absence of any warranty; and give any other recipients of the

Program a copy of this License along with the Program.

You may charge a fee for the physical act of transferring a copy, and you may

at your option offer warranty protection in exchange for a fee.

2. You may modify your copy or copies of the Program or any portion of it, thus

forming a work based on the Program, and copy and distribute such modifications

or work under the terms of Section 1 above, provided that you also meet all of

these conditions:

    a) You must cause the modified files to carry prominent notices stating

    that you changed the files and the date of any change.

    b) You must cause any work that you distribute or publish, that in whole or

    in part contains or is derived from the Program or any part thereof, to be

    licensed as a whole at no charge to all third parties under the terms of

    this License.

    c) If the modified program normally reads commands interactively when run,

    you must cause it, when started running for such interactive use in the

    most ordinary way, to print or display an announcement including an

    appropriate copyright notice and a notice that there is no warranty (or

    else, saying that you provide a warranty) and that users may redistribute

    the program under these conditions, and telling the user how to view a copy

    of this License.  (Exception: if the Program itself is interactive but does

    not normally print such an announcement, your work based on the Program is

    not required to print an announcement.)

These requirements apply to the modified work as a whole.  If identifiable

sections of that work are not derived from the Program, and can be reasonably

considered independent and separate works in themselves, then this License, and

its terms, do not apply to those sections when you distribute them as separate

works.  But when you distribute the same sections as part of a whole which is a

work based on the Program, the distribution of the whole must be on the terms

of this License, whose permissions for other licensees extend to the entire

whole, and thus to each and every part regardless of who wrote it.

Thus, it is not the intent of this section to claim rights or contest your

rights to work written entirely by you; rather, the intent is to exercise the

right to control the distribution of derivative or collective works based on

the Program.

In addition, mere aggregation of another work not based on the Program with the

Program (or with a work based on the Program) on a volume of a storage or

distribution medium does not bring the other work under the scope of this

License.

3. You may copy and distribute the Program (or a work based on it, under

Section 2) in object code or executable form under the terms of Sections 1 and

2 above provided that you also do one of the following:

    a) Accompany it with the complete corresponding machine-readable source

    code, which must be distributed under the terms of Sections 1 and 2 above

    on a medium customarily used for software interchange; or,

    b) Accompany it with a written offer, valid for at least three years, to

    give any third party, for a charge no more than your cost of physically

    performing source distribution, a complete machine-readable copy of the

    corresponding source code, to be distributed under the terms of Sections 1

    and 2 above on a medium customarily used for software interchange; or,

    c) Accompany it with the information you received as to the offer to

    distribute corresponding source code.  (This alternative is allowed only

    for noncommercial distribution and only if you received the program in

    object code or executable form with such an offer, in accord with

    Subsection b above.)

The source code for a work means the preferred form of the work for making

modifications to it.  For an executable work, complete source code means all

the source code for all modules it contains, plus any associated interface

definition files, plus the scripts used to control compilation and installation

of the executable.  However, as a special exception, the source code

distributed need not include anything that is normally distributed (in either

source or binary form) with the major components (compiler, kernel, and so on)

of the operating system on which the executable runs, unless that component

itself accompanies the executable.

If distribution of executable or object code is made by offering access to copy

from a designated place, then offering equivalent access to copy the source

code from the same place counts as distribution of the source code, even though

third parties are not compelled to copy the source along with the object code.

4. You may not copy, modify, sublicense, or distribute the Program except as

expressly provided under this License.  Any attempt otherwise to copy, modify,

sublicense or distribute the Program is void, and will automatically terminate

your rights under this License.  However, parties who have received copies, or

rights, from you under this License will not have their licenses terminated so

long as such parties remain in full compliance.

5. You are not required to accept this License, since you have not signed it.

However, nothing else grants you permission to modify or distribute the Program

or its derivative works.  These actions are prohibited by law if you do not

accept this License.  Therefore, by modifying or distributing the Program (or

any work based on the Program), you indicate your acceptance of this License to

do so, and all its terms and conditions for copying, distributing or modifying

the Program or works based on it.

6. Each time you redistribute the Program (or any work based on the Program),

the recipient automatically receives a license from the original licensor to

copy, distribute or modify the Program subject to these terms and conditions.

You may not impose any further restrictions on the recipients' exercise of the

rights granted herein.  You are not responsible for enforcing compliance by

third parties to this License.

7. If, as a consequence of a court judgment or allegation of patent

infringement or for any other reason (not limited to patent issues), conditions

are imposed on you (whether by court order, agreement or otherwise) that

contradict the conditions of this License, they do not excuse you from the

conditions of this License.  If you cannot distribute so as to satisfy

simultaneously your obligations under this License and any other pertinent

obligations, then as a consequence you may not distribute the Program at all.

For example, if a patent license would not permit royalty-free redistribution

of the Program by all those who receive copies directly or indirectly through

you, then the only way you could satisfy both it and this License would be to

refrain entirely from distribution of the Program.

If any portion of this section is held invalid or unenforceable under any

particular circumstance, the balance of the section is intended to apply and

the section as a whole is intended to apply in other circumstances.

It is not the purpose of this section to induce you to infringe any patents or

other property right claims or to contest validity of any such claims; this

section has the sole purpose of protecting the integrity of the free software

distribution system, which is implemented by public license practices.  Many

people have made generous contributions to the wide range of software

distributed through that system in reliance on consistent application of that

system; it is up to the author/donor to decide if he or she is willing to

distribute software through any other system and a licensee cannot impose that

choice.

This section is intended to make thoroughly clear what is believed to be a

consequence of the rest of this License.

8. If the distribution and/or use of the Program is restricted in certain

countries either by patents or by copyrighted interfaces, the original

copyright holder who places the Program under this License may add an explicit

geographical distribution limitation excluding those countries, so that

distribution is permitted only in or among countries not thus excluded.  In

such case, this License incorporates the limitation as if written in the body

of this License.

9. The Free Software Foundation may publish revised and/or new versions of the

General Public License from time to time.  Such new versions will be similar in

spirit to the present version, but may differ in detail to address new problems

or concerns.

Each version is given a distinguishing version number.  If the Program

specifies a version number of this License which applies to it and "any later

version", you have the option of following the terms and conditions either of

that version or of any later version published by the Free Software Foundation.

If the Program does not specify a version number of this License, you may

choose any version ever published by the Free Software Foundation.

10. If you wish to incorporate parts of the Program into other free programs

whose distribution conditions are different, write to the author to ask for

permission.  For software which is copyrighted by the Free Software Foundation,

write to the Free Software Foundation; we sometimes make exceptions for this.

Our decision will be guided by the two goals of preserving the free status of

all derivatives of our free software and of promoting the sharing and reuse of

software generally.

NO WARRANTY

11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR

THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN OTHERWISE

STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE

PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,

INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND

FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND

PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE,

YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.

12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL

ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE

PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY

GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR

INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA

BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A

FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER

OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.

END OF TERMS AND CONDITIONS

How to Apply These Terms to Your New Programs

If you develop a new program, and you want it to be of the greatest possible

use to the public, the best way to achieve this is to make it free software

which everyone can redistribute and change under these terms.

To do so, attach the following notices to the program.  It is safest to attach

them to the start of each source file to most effectively convey the exclusion

of warranty; and each file should have at least the "copyright" line and a

pointer to where the full notice is found.

    One line to give the program's name and a brief idea of what it does.

    Copyright (C) <year> <name of author>

    This program is free software; you can redistribute it and/or modify it

    under the terms of the GNU General Public License as published by the Free

    Software Foundation; either version 2 of the License, or (at your option)

    any later version.

    This program 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 for

    more details.

    You should have received a copy of the GNU General Public License along

    with this program; if not, write to the Free Software Foundation, Inc., 59

    Temple Place, Suite 330, Boston, MA 02111-1307 USA

Also add information on how to contact you by electronic and paper mail.

If the program is interactive, make it output a short notice like this when it

starts in an interactive mode:

    Gnomovision version 69, Copyright (C) year name of author Gnomovision comes

    with ABSOLUTELY NO WARRANTY; for details type 'show w'.  This is free

    software, and you are welcome to redistribute it under certain conditions;

    type 'show c' for details.

The hypothetical commands 'show w' and 'show c' should show the appropriate

parts of the General Public License.  Of course, the commands you use may be

called something other than 'show w' and 'show c'; they could even be

mouse-clicks or menu items--whatever suits your program.

You should also get your employer (if you work as a programmer) or your school,

if any, to sign a "copyright disclaimer" for the program, if necessary.  Here

is a sample; alter the names:

    Yoyodyne, Inc., hereby disclaims all copyright interest in the program

    'Gnomovision' (which makes passes at compilers) written by James Hacker.

    signature of Ty Coon, 1 April 1989

    Ty Coon, President of Vice

This General Public License does not permit incorporating your program into

proprietary programs.  If your program is a subroutine library, you may

consider it more useful to permit linking proprietary applications with the

library.  If this is what you want to do, use the GNU Library General Public

License instead of this License.

"CLASSPATH" EXCEPTION TO THE GPL

Certain source files distributed by Sun Microsystems, Inc.  are subject to

the following clarification and special exception to the GPL, but only where

Sun has expressly included in the particular source file's header the words

"Sun designates this particular file as subject to the "Classpath" exception

as provided by Sun in the LICENSE file that accompanied this code."

    Linking this library statically or dynamically with other modules is making

    a combined work based on this library.  Thus, the terms and conditions of

    the GNU General Public License cover the whole combination.

    As a special exception, the copyright holders of this library give you

    permission to link this library with independent modules to produce an

    executable, regardless of the license terms of these independent modules,

    and to copy and distribute the resulting executable under terms of your

    choice, provided that you also meet, for each linked independent module,

    the terms and conditions of the license of that 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 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 exception statement from your version.

<?xml version="1.0" encoding="UTF-8"?>

<projectDescription>

	<name>libGeoUtils</name>

	<comment></comment>

	<projects>

	</projects>

	<buildSpec>

		<buildCommand>

			<name>org.eclipse.jdt.core.javabuilder</name>

			<arguments>

			</arguments>

		</buildCommand>

	</buildSpec>

	<natures>

		<nature>org.eclipse.jdt.core.javanature</nature>

	</natures>

</projectDescription>

/*

 * Copyright 1998 Sun Microsystems, Inc.  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.  Sun designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Sun 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 */

package org.gvsig.geoutils.sun.awt.geom;

import java.awt.geom.PathIterator;

import java.awt.geom.Rectangle2D;

final class Order0 extends Curve {

    private double x;

    private double y;

    public Order0(double x, double y) {

        super(INCREASING);

        this.x = x;

        this.y = y;

    }

    public int getOrder() {

        return 0;

    }

    public double getXTop() {

        return x;

    }

    public double getYTop() {

        return y;

    }

    public double getXBot() {

        return x;

    }

    public double getYBot() {

        return y;

    }

    public double getXMin() {

        return x;

    }

    public double getXMax() {

        return x;

    }

    public double getX0() {

        return x;

    }

    public double getY0() {

        return y;

    }

    public double getX1() {

        return x;

    }

    public double getY1() {

        return y;

    }

    public double XforY(double y) {

        return y;

    }

    public double TforY(double y) {

        return 0;

    }

    public double XforT(double t) {

        return x;

    }

    public double YforT(double t) {

        return y;

    }

    public double dXforT(double t, int deriv) {

        return 0;

    }

    public double dYforT(double t, int deriv) {

        return 0;

    }

    public double nextVertical(double t0, double t1) {

        return t1;

    }

    public int crossingsFor(double x, double y) {

        return 0;

    }

    public boolean accumulateCrossings(Crossings c) {

        return (x > c.getXLo() &&

                x < c.getXHi() &&

                y > c.getYLo() &&

                y < c.getYHi());

    }

    public void enlarge(Rectangle2D r) {

        r.add(x, y);

    }

    public Curve getSubCurve(double ystart, double yend, int dir) {

        return this;

    }

    public Curve getReversedCurve() {

        return this;

    }

    public int getSegment(double coords[]) {

        coords[0] = x;

        coords[1] = y;

        return PathIterator.SEG_MOVETO;

    }

}

/*

 * Copyright 1998-2006 Sun Microsystems, Inc.  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.  Sun designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Sun 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 */

package org.gvsig.geoutils.sun.awt.geom;

import java.awt.geom.PathIterator;

import java.awt.geom.Rectangle2D;

final class Order1 extends Curve {

    private double x0;

    private double y0;

    private double x1;

    private double y1;

    private double xmin;

    private double xmax;

    public Order1(double x0, double y0,

                  double x1, double y1,

                  int direction)

    {

        super(direction);

        this.x0 = x0;

        this.y0 = y0;

        this.x1 = x1;

        this.y1 = y1;

        if (x0 < x1) {

            this.xmin = x0;

            this.xmax = x1;

        } else {

            this.xmin = x1;

            this.xmax = x0;

        }

    }

    public int getOrder() {

        return 1;

    }

    public double getXTop() {

        return x0;

    }

    public double getYTop() {

        return y0;

    }

    public double getXBot() {

        return x1;

    }

    public double getYBot() {

        return y1;

    }

    public double getXMin() {

        return xmin;

    }

    public double getXMax() {

        return xmax;

    }

    public double getX0() {

        return (direction == INCREASING) ? x0 : x1;

    }

    public double getY0() {

        return (direction == INCREASING) ? y0 : y1;

    }

    public double getX1() {

        return (direction == DECREASING) ? x0 : x1;

    }

    public double getY1() {

        return (direction == DECREASING) ? y0 : y1;

    }

    public double XforY(double y) {

        if (x0 == x1 || y <= y0) {

            return x0;

        }

        if (y >= y1) {

            return x1;

        }

        // assert(y0 != y1); /* No horizontal lines... */

        return (x0 + (y - y0) * (x1 - x0) / (y1 - y0));

    }

    public double TforY(double y) {

        if (y <= y0) {

            return 0;

        }

        if (y >= y1) {

            return 1;

        }

        return (y - y0) / (y1 - y0);

    }

    public double XforT(double t) {

        return x0 + t * (x1 - x0);

    }

    public double YforT(double t) {

        return y0 + t * (y1 - y0);

    }

    public double dXforT(double t, int deriv) {

        switch (deriv) {

        case 0:

            return x0 + t * (x1 - x0);

        case 1:

            return (x1 - x0);

        default:

            return 0;

        }

    }

    public double dYforT(double t, int deriv) {

        switch (deriv) {

        case 0:

            return y0 + t * (y1 - y0);

        case 1:

            return (y1 - y0);

        default:

            return 0;

        }

    }

    public double nextVertical(double t0, double t1) {

        return t1;

    }

    public boolean accumulateCrossings(Crossings c) {

        double xlo = c.getXLo();

        double ylo = c.getYLo();

        double xhi = c.getXHi();

        double yhi = c.getYHi();

        if (xmin >= xhi) {

            return false;

        }

        double xstart, ystart, xend, yend;

        if (y0 < ylo) {

            if (y1 <= ylo) {

                return false;

            }

            ystart = ylo;

            xstart = XforY(ylo);

        } else {

            if (y0 >= yhi) {

                return false;

            }

            ystart = y0;

            xstart = x0;

        }

        if (y1 > yhi) {

            yend = yhi;

            xend = XforY(yhi);

        } else {

            yend = y1;

            xend = x1;

        }

        if (xstart >= xhi && xend >= xhi) {

            return false;

        }

        if (xstart > xlo || xend > xlo) {

            return true;

        }

        c.record(ystart, yend, direction);

        return false;

    }

    public void enlarge(Rectangle2D r) {

        r.add(x0, y0);

        r.add(x1, y1);

    }

    public Curve getSubCurve(double ystart, double yend, int dir) {

        if (ystart == y0 && yend == y1) {

            return getWithDirection(dir);

        }

        if (x0 == x1) {

            return new Order1(x0, ystart, x1, yend, dir);

        }

        double num = x0 - x1;

        double denom = y0 - y1;

        double xstart = (x0 + (ystart - y0) * num / denom);

        double xend = (x0 + (yend - y0) * num / denom);

        return new Order1(xstart, ystart, xend, yend, dir);

    }

    public Curve getReversedCurve() {

        return new Order1(x0, y0, x1, y1, -direction);

    }

    public int compareTo(Curve other, double yrange[]) {

        if (!(other instanceof Order1)) {

            return super.compareTo(other, yrange);

        }

        Order1 c1 = (Order1) other;

        if (yrange[1] <= yrange[0]) {

            throw new InternalError("yrange already screwed up...");

        }

        yrange[1] = Math.min(Math.min(yrange[1], y1), c1.y1);

        if (yrange[1] <= yrange[0]) {

            throw new InternalError("backstepping from "+yrange[0]+" to "+yrange[1]);

        }

        if (xmax <= c1.xmin) {

            return (xmin == c1.xmax) ? 0 : -1;

        }

        if (xmin >= c1.xmax) {

            return 1;

        }

        /*

         * If "this" is curve A and "other" is curve B, then...

         * xA(y) = x0A + (y - y0A) (x1A - x0A) / (y1A - y0A)

         * xB(y) = x0B + (y - y0B) (x1B - x0B) / (y1B - y0B)

         * xA(y) == xB(y)

         * x0A + (y - y0A) (x1A - x0A) / (y1A - y0A)

         *    == x0B + (y - y0B) (x1B - x0B) / (y1B - y0B)

         * 0 == x0A (y1A - y0A) (y1B - y0B) + (y - y0A) (x1A - x0A) (y1B - y0B)

         *    - x0B (y1A - y0A) (y1B - y0B) - (y - y0B) (x1B - x0B) (y1A - y0A)

         * 0 == (x0A - x0B) (y1A - y0A) (y1B - y0B)

         *    + (y - y0A) (x1A - x0A) (y1B - y0B)

         *    - (y - y0B) (x1B - x0B) (y1A - y0A)

         * If (dxA == x1A - x0A), etc...

         * 0 == (x0A - x0B) * dyA * dyB

         *    + (y - y0A) * dxA * dyB

         *    - (y - y0B) * dxB * dyA

         * 0 == (x0A - x0B) * dyA * dyB

         *    + y * dxA * dyB - y0A * dxA * dyB

         *    - y * dxB * dyA + y0B * dxB * dyA

         * 0 == (x0A - x0B) * dyA * dyB

         *    + y * dxA * dyB - y * dxB * dyA

         *    - y0A * dxA * dyB + y0B * dxB * dyA

         * 0 == (x0A - x0B) * dyA * dyB

         *    + y * (dxA * dyB - dxB * dyA)

         *    - y0A * dxA * dyB + y0B * dxB * dyA

         * y == ((x0A - x0B) * dyA * dyB

         *       - y0A * dxA * dyB + y0B * dxB * dyA)

         *    / (-(dxA * dyB - dxB * dyA))

         * y == ((x0A - x0B) * dyA * dyB

         *       - y0A * dxA * dyB + y0B * dxB * dyA)

         *    / (dxB * dyA - dxA * dyB)

         */

        double dxa = x1 - x0;

        double dya = y1 - y0;

        double dxb = c1.x1 - c1.x0;

        double dyb = c1.y1 - c1.y0;

        double denom = dxb * dya - dxa * dyb;

        double y;

        if (denom != 0) {

            double num = ((x0 - c1.x0) * dya * dyb

                          - y0 * dxa * dyb

                          + c1.y0 * dxb * dya);

            y = num / denom;

            if (y <= yrange[0]) {

                // intersection is above us

                // Use bottom-most common y for comparison

                y = Math.min(y1, c1.y1);

            } else {

                // intersection is below the top of our range

                if (y < yrange[1]) {

                    // If intersection is in our range, adjust valid range

                    yrange[1] = y;

                }

                // Use top-most common y for comparison

                y = Math.max(y0, c1.y0);

            }

        } else {

            // lines are parallel, choose any common y for comparison

            // Note - prefer an endpoint for speed of calculating the X

            // (see shortcuts in Order1.XforY())

            y = Math.max(y0, c1.y0);

        }

        return orderof(XforY(y), c1.XforY(y));

    }

    public int getSegment(double coords[]) {

        if (direction == INCREASING) {

            coords[0] = x1;

            coords[1] = y1;

        } else {

            coords[0] = x0;

            coords[1] = y0;

        }

        return PathIterator.SEG_LINETO;

    }

}

/*

 * Copyright 1998-2006 Sun Microsystems, Inc.  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.  Sun designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Sun 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 */

package org.gvsig.geoutils.sun.awt.geom;

import java.awt.geom.PathIterator;

import java.awt.geom.Rectangle2D;

import java.util.Vector;

final class Order2 extends Curve {

    private double x0;

    private double y0;

    private double cx0;

    private double cy0;

    private double x1;

    private double y1;

    private double xmin;

    private double xmax;

    private double xcoeff0;

    private double xcoeff1;

    private double xcoeff2;

    private double ycoeff0;

    private double ycoeff1;

    private double ycoeff2;

    public static void insert(Vector curves, double tmp[],

                              double x0, double y0,

                              double cx0, double cy0,

                              double x1, double y1,

                              int direction)

    {

        int numparams = getHorizontalParams(y0, cy0, y1, tmp);

        if (numparams == 0) {

            // We are using addInstance here to avoid inserting horisontal

            // segments

            addInstance(curves, x0, y0, cx0, cy0, x1, y1, direction);

            return;

        }

        // assert(numparams == 1);

        double t = tmp[0];

        tmp[0] = x0;  tmp[1] = y0;

        tmp[2] = cx0; tmp[3] = cy0;

        tmp[4] = x1;  tmp[5] = y1;

        split(tmp, 0, t);

        int i0 = (direction == INCREASING)? 0 : 4;

        int i1 = 4 - i0;

        addInstance(curves, tmp[i0], tmp[i0 + 1], tmp[i0 + 2], tmp[i0 + 3],

                    tmp[i0 + 4], tmp[i0 + 5], direction);

        addInstance(curves, tmp[i1], tmp[i1 + 1], tmp[i1 + 2], tmp[i1 + 3],

                    tmp[i1 + 4], tmp[i1 + 5], direction);

    }

    public static void addInstance(Vector curves,

                                   double x0, double y0,

                                   double cx0, double cy0,

                                   double x1, double y1,

                                   int direction) {

        if (y0 > y1) {

            curves.add(new Order2(x1, y1, cx0, cy0, x0, y0, -direction));

        } else if (y1 > y0) {

            curves.add(new Order2(x0, y0, cx0, cy0, x1, y1, direction));

        }

    }

    /*

     * Return the count of the number of horizontal sections of the

     * specified quadratic Bezier curve.  Put the parameters for the

     * horizontal sections into the specified <code>ret</code> array.

     * <p>

     * If we examine the parametric equation in t, we have:

     *     Py(t) = C0*(1-t)^2 + 2*CP*t*(1-t) + C1*t^2

     *           = C0 - 2*C0*t + C0*t^2 + 2*CP*t - 2*CP*t^2 + C1*t^2

     *           = C0 + (2*CP - 2*C0)*t + (C0 - 2*CP + C1)*t^2

     *     Py(t) = (C0 - 2*CP + C1)*t^2 + (2*CP - 2*C0)*t + (C0)

     * If we take the derivative, we get:

     *     Py(t) = At^2 + Bt + C

     *     dPy(t) = 2At + B = 0

     *     2*(C0 - 2*CP + C1)t + 2*(CP - C0) = 0

     *     2*(C0 - 2*CP + C1)t = 2*(C0 - CP)

     *     t = 2*(C0 - CP) / 2*(C0 - 2*CP + C1)

     *     t = (C0 - CP) / (C0 - CP + C1 - CP)

     * Note that this method will return 0 if the equation is a line,

     * which is either always horizontal or never horizontal.

     * Completely horizontal curves need to be eliminated by other

     * means outside of this method.

     */

    public static int getHorizontalParams(double c0, double cp, double c1,

                                          double ret[]) {

        if (c0 <= cp && cp <= c1) {

            return 0;

        }

        c0 -= cp;

        c1 -= cp;

        double denom = c0 + c1;

        // If denom == 0 then cp == (c0+c1)/2 and we have a line.

        if (denom == 0) {

            return 0;

        }

        double t = c0 / denom;

        // No splits at t==0 and t==1

        if (t <= 0 || t >= 1) {

            return 0;

        }

        ret[0] = t;

        return 1;

    }

    /*

     * Split the quadratic Bezier stored at coords[pos...pos+5] representing

     * the paramtric range [0..1] into two subcurves representing the

     * parametric subranges [0..t] and [t..1].  Store the results back

     * into the array at coords[pos...pos+5] and coords[pos+4...pos+9].

     */

    public static void split(double coords[], int pos, double t) {

        double x0, y0, cx, cy, x1, y1;

        coords[pos+8] = x1 = coords[pos+4];

        coords[pos+9] = y1 = coords[pos+5];

        cx = coords[pos+2];

        cy = coords[pos+3];

        x1 = cx + (x1 - cx) * t;

        y1 = cy + (y1 - cy) * t;

        x0 = coords[pos+0];

        y0 = coords[pos+1];

        x0 = x0 + (cx - x0) * t;

        y0 = y0 + (cy - y0) * t;

        cx = x0 + (x1 - x0) * t;

        cy = y0 + (y1 - y0) * t;

        coords[pos+2] = x0;

        coords[pos+3] = y0;

        coords[pos+4] = cx;

        coords[pos+5] = cy;

        coords[pos+6] = x1;

        coords[pos+7] = y1;

    }

    public Order2(double x0, double y0,

                  double cx0, double cy0,

                  double x1, double y1,

                  int direction)

    {

        super(direction);

        // REMIND: Better accuracy in the root finding methods would

        //  ensure that cy0 is in range.  As it stands, it is never

        //  more than "1 mantissa bit" out of range...

        if (cy0 < y0) {

            cy0 = y0;

        } else if (cy0 > y1) {

            cy0 = y1;

        }

        this.x0 = x0;

        this.y0 = y0;

        this.cx0 = cx0;

        this.cy0 = cy0;

        this.x1 = x1;

        this.y1 = y1;

        xmin = Math.min(Math.min(x0, x1), cx0);

        xmax = Math.max(Math.max(x0, x1), cx0);

        xcoeff0 = x0;

        xcoeff1 = cx0 + cx0 - x0 - x0;

        xcoeff2 = x0 - cx0 - cx0 + x1;

        ycoeff0 = y0;

        ycoeff1 = cy0 + cy0 - y0 - y0;

        ycoeff2 = y0 - cy0 - cy0 + y1;

    }

    public int getOrder() {

        return 2;

    }

    public double getXTop() {

        return x0;

    }

    public double getYTop() {

        return y0;

    }

    public double getXBot() {

        return x1;

    }

    public double getYBot() {

        return y1;

    }

    public double getXMin() {

        return xmin;

    }

    public double getXMax() {

        return xmax;

    }

    public double getX0() {

        return (direction == INCREASING) ? x0 : x1;

    }

    public double getY0() {

        return (direction == INCREASING) ? y0 : y1;

    }

    public double getCX0() {

        return cx0;

    }

    public double getCY0() {

        return cy0;

    }

    public double getX1() {

        return (direction == DECREASING) ? x0 : x1;

    }

    public double getY1() {

        return (direction == DECREASING) ? y0 : y1;

    }

    public double XforY(double y) {

        if (y <= y0) {

            return x0;

        }

        if (y >= y1) {

            return x1;

        }

        return XforT(TforY(y));

    }

    public double TforY(double y) {

        if (y <= y0) {

            return 0;

        }

        if (y >= y1) {

            return 1;

        }

        return TforY(y, ycoeff0, ycoeff1, ycoeff2);

    }

    public static double TforY(double y,

                               double ycoeff0, double ycoeff1, double ycoeff2)

    {

        // The caller should have already eliminated y values

        // outside of the y0 to y1 range.

        ycoeff0 -= y;

        if (ycoeff2 == 0.0) {

            // The quadratic parabola has degenerated to a line.

            // ycoeff1 should not be 0.0 since we have already eliminated

            // totally horizontal lines, but if it is, then we will generate

            // infinity here for the root, which will not be in the [0,1]

            // range so we will pass to the failure code below.

            double root = -ycoeff0 / ycoeff1;

            if (root >= 0 && root <= 1) {

                return root;

            }

        } else {

            // From Numerical Recipes, 5.6, Quadratic and Cubic Equations

            double d = ycoeff1 * ycoeff1 - 4.0 * ycoeff2 * ycoeff0;

            // If d < 0.0, then there are no roots

            if (d >= 0.0) {

                d = Math.sqrt(d);

                // For accuracy, calculate one root using:

                //     (-ycoeff1 +/- d) / 2ycoeff2

                // and the other using:

                //     2ycoeff0 / (-ycoeff1 +/- d)

                // Choose the sign of the +/- so that ycoeff1+d

                // gets larger in magnitude

                if (ycoeff1 < 0.0) {

                    d = -d;

                }

                double q = (ycoeff1 + d) / -2.0;

                // We already tested ycoeff2 for being 0 above

                double root = q / ycoeff2;

                if (root >= 0 && root <= 1) {

                    return root;

                }

                if (q != 0.0) {

                    root = ycoeff0 / q;

                    if (root >= 0 && root <= 1) {

                        return root;

                    }

                }

            }

        }

        /* We failed to find a root in [0,1].  What could have gone wrong?

         * First, remember that these curves are constructed to be monotonic

         * in Y and totally horizontal curves have already been eliminated.

         * Now keep in mind that the Y coefficients of the polynomial form

         * of the curve are calculated from the Y coordinates which define

         * our curve.  They should theoretically define the same curve,

         * but they can be off by a couple of bits of precision after the

         * math is done and so can represent a slightly modified curve.

         * This is normally not an issue except when we have solutions near

         * the endpoints.  Since the answers we get from solving the polynomial

         * may be off by a few bits that means that they could lie just a

         * few bits of precision outside the [0,1] range.

         *

         * Another problem could be that while the parametric curve defined

         * by the Y coordinates has a local minima or maxima at or just

         * outside of the endpoints, the polynomial form might express

         * that same min/max just inside of and just shy of the Y coordinate

         * of that endpoint.  In that case, if we solve for a Y coordinate

         * at or near that endpoint, we may be solving for a Y coordinate

         * that is below that minima or above that maxima and we would find

         * no solutions at all.

         *

         * In either case, we can assume that y is so near one of the

         * endpoints that we can just collapse it onto the nearest endpoint

         * without losing more than a couple of bits of precision.

         */

        // First calculate the midpoint between y0 and y1 and choose to

        // return either 0.0 or 1.0 depending on whether y is above

        // or below the midpoint...

        // Note that we subtracted y from ycoeff0 above so both y0 and y1

        // will be "relative to y" so we are really just looking at where

        // zero falls with respect to the "relative midpoint" here.

        double y0 = ycoeff0;

        double y1 = ycoeff0 + ycoeff1 + ycoeff2;

        return (0 < (y0 + y1) / 2) ? 0.0 : 1.0;

    }

    public double XforT(double t) {

        return (xcoeff2 * t + xcoeff1) * t + xcoeff0;

    }

    public double YforT(double t) {

        return (ycoeff2 * t + ycoeff1) * t + ycoeff0;

    }

    public double dXforT(double t, int deriv) {

        switch (deriv) {

        case 0:

            return (xcoeff2 * t + xcoeff1) * t + xcoeff0;

        case 1:

            return 2 * xcoeff2 * t + xcoeff1;

        case 2:

            return 2 * xcoeff2;

        default:

            return 0;

        }

    }

    public double dYforT(double t, int deriv) {

        switch (deriv) {

        case 0:

            return (ycoeff2 * t + ycoeff1) * t + ycoeff0;

        case 1:

            return 2 * ycoeff2 * t + ycoeff1;

        case 2:

            return 2 * ycoeff2;

        default:

            return 0;

        }

    }

    public double nextVertical(double t0, double t1) {

        double t = -xcoeff1 / (2 * xcoeff2);

        if (t > t0 && t < t1) {

            return t;

        }

        return t1;

    }

    public void enlarge(Rectangle2D r) {

        r.add(x0, y0);

        double t = -xcoeff1 / (2 * xcoeff2);

        if (t > 0 && t < 1) {

            r.add(XforT(t), YforT(t));

        }

        r.add(x1, y1);

    }

    public Curve getSubCurve(double ystart, double yend, int dir) {

        double t0, t1;

        if (ystart <= y0) {

            if (yend >= y1) {

                return getWithDirection(dir);

            }

            t0 = 0;

        } else {

            t0 = TforY(ystart, ycoeff0, ycoeff1, ycoeff2);

        }

        if (yend >= y1) {

            t1 = 1;

        } else {

            t1 = TforY(yend, ycoeff0, ycoeff1, ycoeff2);

        }

        double eqn[] = new double[10];

        eqn[0] = x0;

        eqn[1] = y0;

        eqn[2] = cx0;

        eqn[3] = cy0;

        eqn[4] = x1;

        eqn[5] = y1;

        if (t1 < 1) {

            split(eqn, 0, t1);

        }

        int i;

        if (t0 <= 0) {

            i = 0;

        } else {

            split(eqn, 0, t0 / t1);

            i = 4;

        }

        return new Order2(eqn[i+0], ystart,

                          eqn[i+2], eqn[i+3],

                          eqn[i+4], yend,

                          dir);

    }

    public Curve getReversedCurve() {

        return new Order2(x0, y0, cx0, cy0, x1, y1, -direction);

    }

    public int getSegment(double coords[]) {

        coords[0] = cx0;

        coords[1] = cy0;

        if (direction == INCREASING) {

            coords[2] = x1;

            coords[3] = y1;

        } else {

            coords[2] = x0;

            coords[3] = y0;

        }

        return PathIterator.SEG_QUADTO;

    }

    public String controlPointString() {

        return ("("+round(cx0)+", "+round(cy0)+"), ");

    }

}

/*

 * Copyright 1998-2006 Sun Microsystems, Inc.  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.  Sun designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Sun 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 */

package org.gvsig.geoutils.sun.awt.geom;

import java.awt.geom.PathIterator;

import java.awt.geom.QuadCurve2D;

import java.awt.geom.Rectangle2D;

import java.util.Vector;

final class Order3 extends Curve {

    private double x0;

    private double y0;

    private double cx0;

    private double cy0;

    private double cx1;

    private double cy1;

    private double x1;

    private double y1;

    private double xmin;

    private double xmax;

    private double xcoeff0;

    private double xcoeff1;

    private double xcoeff2;

    private double xcoeff3;

    private double ycoeff0;

    private double ycoeff1;

    private double ycoeff2;

    private double ycoeff3;

    public static void insert(Vector curves, double tmp[],

                              double x0, double y0,

                              double cx0, double cy0,

                              double cx1, double cy1,

                              double x1, double y1,

                              int direction)

    {

        int numparams = getHorizontalParams(y0, cy0, cy1, y1, tmp);

        if (numparams == 0) {

            // We are using addInstance here to avoid inserting horisontal

            // segments

            addInstance(curves, x0, y0, cx0, cy0, cx1, cy1, x1, y1, direction);

            return;

        }

        // Store coordinates for splitting at tmp[3..10]

        tmp[3] = x0;  tmp[4]  = y0;

        tmp[5] = cx0; tmp[6]  = cy0;

        tmp[7] = cx1; tmp[8]  = cy1;

        tmp[9] = x1;  tmp[10] = y1;

        double t = tmp[0];

        if (numparams > 1 && t > tmp[1]) {

            // Perform a "2 element sort"...

            tmp[0] = tmp[1];

            tmp[1] = t;

            t = tmp[0];

        }

        split(tmp, 3, t);

        if (numparams > 1) {

            // Recalculate tmp[1] relative to the range [tmp[0]...1]

            t = (tmp[1] - t) / (1 - t);

            split(tmp, 9, t);

        }

        int index = 3;

        if (direction == DECREASING) {

            index += numparams * 6;

        }

        while (numparams >= 0) {