use crate::core::geo::component2d::{
Component2D, WithinRelation, contains_point, point_in_triangle,
};
use crate::core::geo::geo_encoding_utils::GeoEncodingUtils;
use crate::core::geo::geo_utils::GeoUtils;
use crate::core::geo::point::Point;
use crate::core::geo::xy_point::XYPoint;
use crate::core::index::point_values::Relation;
use crate::core::util::error::lucene_error::Result;
#[derive(Clone, Copy, Debug)]
pub struct Point2D {
x: f64,
y: f64,
}
impl Point2D {
fn new(x: f64, y: f64) -> Self {
Self { x, y }
}
}
impl Component2D for Point2D {
fn get_min_x(&self) -> f64 {
self.x
}
fn get_max_x(&self) -> f64 {
self.x
}
fn get_min_y(&self) -> f64 {
self.y
}
fn get_max_y(&self) -> f64 {
self.y
}
fn contains(&self, x: f64, y: f64) -> bool {
x == self.x && y == self.y
}
fn relate(&self, min_x: f64, max_x: f64, min_y: f64, max_y: f64) -> Result<Relation> {
if contains_point(self.x, self.y, min_x, max_x, min_y, max_y) {
Ok(Relation::CellCrossesQuery)
} else {
Ok(Relation::CellOutsideQuery)
}
}
fn intersects_line(
&self,
min_x: f64,
max_x: f64,
min_y: f64,
max_y: f64,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
) -> bool {
contains_point(self.x, self.y, min_x, max_x, min_y, max_y)
&& GeoUtils::orient(a_x, a_y, b_x, b_y, self.x, self.y) == 0
}
fn intersects_triangle(
&self,
min_x: f64,
max_x: f64,
min_y: f64,
max_y: f64,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
point_in_triangle(
min_x, max_x, min_y, max_y, self.x, self.y, a_x, a_y, b_x, b_y, c_x, c_y,
)
}
fn contains_line(
&self,
_min_x: f64,
_max_x: f64,
_min_y: f64,
_max_y: f64,
_a_x: f64,
_a_y: f64,
_b_x: f64,
_b_y: f64,
) -> bool {
false
}
fn contains_triangle(
&self,
_min_x: f64,
_max_x: f64,
_min_y: f64,
_max_y: f64,
_a_x: f64,
_a_y: f64,
_b_x: f64,
_b_y: f64,
_c_x: f64,
_c_y: f64,
) -> bool {
false
}
fn within_point(&self, x: f64, y: f64) -> Result<WithinRelation> {
if self.contains(x, y) {
Ok(WithinRelation::Candidate)
} else {
Ok(WithinRelation::Disjoint)
}
}
fn within_line(
&self,
min_x: f64,
max_x: f64,
min_y: f64,
max_y: f64,
a_x: f64,
a_y: f64,
_ab: bool,
b_x: f64,
b_y: f64,
) -> Result<WithinRelation> {
if self.intersects_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y) {
Ok(WithinRelation::Candidate)
} else {
Ok(WithinRelation::Disjoint)
}
}
fn within_triangle(
&self,
min_x: f64,
max_x: f64,
min_y: f64,
max_y: f64,
a_x: f64,
a_y: f64,
_ab: bool,
b_x: f64,
b_y: f64,
_bc: bool,
c_x: f64,
c_y: f64,
_ca: bool,
) -> Result<WithinRelation> {
if point_in_triangle(
min_x, max_x, min_y, max_y, self.x, self.y, a_x, a_y, b_x, b_y, c_x, c_y,
) {
Ok(WithinRelation::Candidate)
} else {
Ok(WithinRelation::Disjoint)
}
}
}
pub fn create_from_point(point: &Point) -> Result<Point2D> {
let q_lat = if point.get_lat() == GeoUtils::MAX_LAT_INCL {
point.get_lat()
} else {
GeoEncodingUtils::decode_latitude(GeoEncodingUtils::encode_latitude_ceil(point.get_lat())?)
};
let q_lon = if point.get_lon() == GeoUtils::MAX_LON_INCL {
point.get_lon()
} else {
GeoEncodingUtils::decode_longitude(GeoEncodingUtils::encode_longitude_ceil(point.get_lon())?)
};
Ok(Point2D::new(q_lon, q_lat))
}
pub fn create_from_xy_point(xy_point: &XYPoint) -> Point2D {
Point2D::new(xy_point.get_x() as f64, xy_point.get_y() as f64)
}