All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.harmony.awt.geom.IntersectPoint Maven / Gradle / Ivy

The newest version!
/*
 *  Licensed to the Apache Software Foundation (ASF) under one or more
 *  contributor license agreements.  See the NOTICE file distributed with
 *  this work for additional information regarding copyright ownership.
 *  The ASF licenses this file to You under the Apache License, Version 2.0
 *  (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.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
package org.apache.harmony.awt.geom;


// the class represents the intersect point of two edges
public class IntersectPoint {
    //  the edge begin number of first line
    private int begIndex1;
    //  the edge end number of first line
    private int endIndex1;
    // the edge rule of first figure
    private int rule1;
    // the index of the first figure rules array
    private int ruleIndex1;
    // the parameter value of edge1
    private double param1;
    //  the edge begin number of second line
    private int begIndex2;
    //  the edge end number of second line
    private int endIndex2;
    //  the edge rule of second figure
    private int rule2;
    //  the index of the second figure rules array
    private int ruleIndex2;
    //  the absciss coordinate of the point
    private final double x;
    //  the ordinate coordinate of the point
    private final double y;
    //  the parameter value of edge2
    private double param2;

    public IntersectPoint(int begIndex1, int endIndex1,
            int begIndex2, int endIndex2,
            double x, double y) {
        this.begIndex1 = begIndex1;
        this.endIndex1 = endIndex1;
        this.begIndex2 = begIndex2;
        this.endIndex2 = endIndex2;
        this.x = x;
        this.y = y;
    }

    public IntersectPoint (int begIndex1, int endIndex1, int rule1, int ruleIndex1,
            int begIndex2, int endIndex2, int rule2, int ruleIndex2,
            double x, double y, double param1, double param2) {
        this.begIndex1 = begIndex1;
        this.endIndex1 = endIndex1;
        this.rule1 = rule1;
        this.ruleIndex1 = ruleIndex1;
        this.param1 = param1;
        this.begIndex2 = begIndex2;
        this.endIndex2 = endIndex2;
        this.rule2 = rule2;
        this.ruleIndex2 = ruleIndex2;
        this.param2 = param2;
        this.x = x;
        this.y = y;
    }

    public int getBegIndex(boolean isCurrentArea) {
        return isCurrentArea ? begIndex1 : begIndex2;
    }

    public int getEndIndex(boolean isCurrentArea) {
        return isCurrentArea ? endIndex1 : endIndex2;
    }

    public int getRuleIndex(boolean isCurrentArea) {
        return isCurrentArea ? ruleIndex1 : ruleIndex2;
    }

    public double getParam(boolean isCurrentArea) {
        return isCurrentArea ? param1 : param2;
    }

    public int getRule(boolean isCurrentArea) {
        return isCurrentArea ? rule1 : rule2;
    }

    public double getX() {
        return x;
    }

    public double getY() {
        return y;
    }

    public void setBegIndex1(int begIndex) {
        this.begIndex1 = begIndex;
    }

    public void setEndIndex1(int endIndex) {
        this.endIndex1 = endIndex;
    }

    public void setBegIndex2(int begIndex) {
        this.begIndex2 = begIndex;
    }

    public void setEndIndex2(int endIndex) {
        this.endIndex2 = endIndex;
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy