/**

 * Back 2 Browser Bytecode Translator Copyright (C) 2012 Jaroslav Tulach

 * <jaroslav.tulach@apidesign.org>

 *

 * 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, version 2 of the License.

 *

 * 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. Look for COPYING file in the top folder. If not, see

 * http://opensource.org/licenses/GPL-2.0.

 */

package net.java.html.canvas;

import java.util.HashMap;

import java.util.Objects;

/**

 *

 * @author antonepple

 */

public class LinearGradient extends Style {

    HashMap<Double,String> stops;

    double x0, y0, x1, y1;

    LinearGradient( double x0, double y0, double x1, double y1) {

        this.x0 = x0;

        this.y0 = y0;

        this.x1 = x1;

        this.y1 = y1;

    }

    void addColorStop(double position, String color){

        if (stops == null) stops = new HashMap<>();

        stops.put(position, color);

    }

    public HashMap<Double, String> getStops() {

        return stops;

    }

    public void setStops(HashMap<Double, String> stops) {

        this.stops = stops;

    }

    public double getX0() {

        return x0;

    }

    public void setX0(double x0) {

        this.x0 = x0;

    }

    public double getY0() {

        return y0;

    }

    public void setY0(double y0) {

        this.y0 = y0;

    }

    public double getX1() {

        return x1;

    }

    public void setX1(double x1) {

        this.x1 = x1;

    }

    public double getY1() {

        return y1;

    }

    public void setY1(double y1) {

        this.y1 = y1;

    }

    @Override

    public int hashCode() {

        int hash = 7;

        hash = 29 * hash + Objects.hashCode(this.stops);

        hash = 29 * hash + (int) (Double.doubleToLongBits(this.x0) ^ (Double.doubleToLongBits(this.x0) >>> 32));

        hash = 29 * hash + (int) (Double.doubleToLongBits(this.y0) ^ (Double.doubleToLongBits(this.y0) >>> 32));

        hash = 29 * hash + (int) (Double.doubleToLongBits(this.x1) ^ (Double.doubleToLongBits(this.x1) >>> 32));

        hash = 29 * hash + (int) (Double.doubleToLongBits(this.y1) ^ (Double.doubleToLongBits(this.y1) >>> 32));

        return hash;

    }

    @Override

    public boolean equals(Object obj) {

        if (obj == null) {

            return false;

        }

        if (getClass() != obj.getClass()) {

            return false;

        }

        final LinearGradient other = (LinearGradient) obj;

        if (!Objects.equals(this.stops, other.stops)) {

            return false;

        }

        if (Double.doubleToLongBits(this.x0) != Double.doubleToLongBits(other.x0)) {

            return false;

        }

        if (Double.doubleToLongBits(this.y0) != Double.doubleToLongBits(other.y0)) {

            return false;

        }

        if (Double.doubleToLongBits(this.x1) != Double.doubleToLongBits(other.x1)) {

            return false;

        }

        if (Double.doubleToLongBits(this.y1) != Double.doubleToLongBits(other.y1)) {

            return false;

        }

        return true;

    }

}