/*
* Copyright (c) 2010 Georgios Migdos <cyberpython@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package org.geogebra.common.kernel.discrete.geom.algorithms.intersections;
import org.geogebra.common.kernel.discrete.geom.Point2D;
/**
*
* @author cyberpython
*/
public class ScanlineIntersection extends Intersection {
private Segment2DEx segment;
public ScanlineIntersection(Segment2DEx segment, Point2D p0) {
super(p0);
this.segment = segment;
}
public Segment2DEx getSegment() {
return this.segment;
}
@Override
public String toString() {
return segment.toString() + ", " + getPoint().toString();
}
@Override
public boolean equals(Object o) {
if (o instanceof ScanlineIntersection) {
if (this.hashCode() == o.hashCode()) {
return true;
}
}
return false;
}
@Override
public int hashCode() {
int hash = 7;
hash = 83 * hash + (this.segment != null ? this.segment.hashCode() : 0);
hash = 83 * hash
+ (this.getPoint() != null ? this.getPoint().hashCode() : 0);
return hash;
}
}