use crate::core::geo::geo_utils::GeoUtils;
use crate::core::index::point_values::Relation;
use crate::core::util::core_helper::CoreHelper;
use crate::core::util::error::lucene_error::Result;
use std::sync::Arc;
pub trait Component2D {
fn get_min_x(&self) -> f64;
fn get_max_x(&self) -> f64;
fn get_min_y(&self) -> f64;
fn get_max_y(&self) -> f64;
fn contains(&self, x: f64, y: f64) -> bool;
fn relate(&self, min_x: f64, max_x: f64, min_y: f64, max_y: f64) -> Result<Relation>;
#[allow(clippy::too_many_arguments)]
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;
#[allow(clippy::too_many_arguments)]
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;
#[allow(clippy::too_many_arguments)]
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;
#[allow(clippy::too_many_arguments)]
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;
fn within_point(&self, x: f64, y: f64) -> Result<WithinRelation>;
#[allow(clippy::too_many_arguments)]
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>;
#[allow(clippy::too_many_arguments)]
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>;
fn intersects_line_values(&self, a_x: f64, a_y: f64, b_x: f64, b_y: f64) -> bool {
let min_y = CoreHelper::min_f64(a_y, b_y);
let min_x = CoreHelper::min_f64(a_x, b_x);
let max_y = CoreHelper::max_f64(a_y, b_y);
let max_x = CoreHelper::max_f64(a_x, b_x);
self.intersects_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}
fn intersects_triangle_values(
&self,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
let min_y = CoreHelper::min_f64(CoreHelper::min_f64(a_y, b_y), c_y);
let min_x = CoreHelper::min_f64(CoreHelper::min_f64(a_x, b_x), c_x);
let max_y = CoreHelper::max_f64(CoreHelper::max_f64(a_y, b_y), c_y);
let max_x = CoreHelper::max_f64(CoreHelper::max_f64(a_x, b_x), c_x);
self.intersects_triangle(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y, c_x, c_y)
}
fn contains_line_values(&self, a_x: f64, a_y: f64, b_x: f64, b_y: f64) -> bool {
let min_y = CoreHelper::min_f64(a_y, b_y);
let min_x = CoreHelper::min_f64(a_x, b_x);
let max_y = CoreHelper::max_f64(a_y, b_y);
let max_x = CoreHelper::max_f64(a_x, b_x);
self.contains_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}
fn contains_triangle_values(
&self,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
let min_y = CoreHelper::min_f64(CoreHelper::min_f64(a_y, b_y), c_y);
let min_x = CoreHelper::min_f64(CoreHelper::min_f64(a_x, b_x), c_x);
let max_y = CoreHelper::max_f64(CoreHelper::max_f64(a_y, b_y), c_y);
let max_x = CoreHelper::max_f64(CoreHelper::max_f64(a_x, b_x), c_x);
self.contains_triangle(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y, c_x, c_y)
}
fn within_line_values(
&self,
a_x: f64,
a_y: f64,
ab: bool,
b_x: f64,
b_y: f64,
) -> Result<WithinRelation> {
let min_y = CoreHelper::min_f64(a_y, b_y);
let min_x = CoreHelper::min_f64(a_x, b_x);
let max_y = CoreHelper::max_f64(a_y, b_y);
let max_x = CoreHelper::max_f64(a_x, b_x);
self.within_line(min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y)
}
#[allow(clippy::too_many_arguments)]
fn within_triangle_values(
&self,
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> {
let min_y = CoreHelper::min_f64(CoreHelper::min_f64(a_y, b_y), c_y);
let min_x = CoreHelper::min_f64(CoreHelper::min_f64(a_x, b_x), c_x);
let max_y = CoreHelper::max_f64(CoreHelper::max_f64(a_y, b_y), c_y);
let max_x = CoreHelper::max_f64(CoreHelper::max_f64(a_x, b_x), c_x);
self.within_triangle(
min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y, bc, c_x, c_y, ca,
)
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum WithinRelation {
Candidate,
NotWithin,
Disjoint,
}
#[allow(clippy::too_many_arguments)]
pub(crate) fn disjoint(
min_x1: f64,
max_x1: f64,
min_y1: f64,
max_y1: f64,
min_x2: f64,
max_x2: f64,
min_y2: f64,
max_y2: f64,
) -> bool {
max_y1 < min_y2 || min_y1 > max_y2 || max_x1 < min_x2 || min_x1 > max_x2
}
#[allow(clippy::too_many_arguments)]
pub(crate) fn within(
min_x1: f64,
max_x1: f64,
min_y1: f64,
max_y1: f64,
min_x2: f64,
max_x2: f64,
min_y2: f64,
max_y2: f64,
) -> bool {
min_y2 <= min_y1 && max_y2 >= max_y1 && min_x2 <= min_x1 && max_x2 >= max_x1
}
pub(crate) fn contains_point(
x: f64,
y: f64,
min_x: f64,
max_x: f64,
min_y: f64,
max_y: f64,
) -> bool {
x >= min_x && x <= max_x && y >= min_y && y <= max_y
}
#[allow(clippy::too_many_arguments)]
pub(crate) fn point_in_triangle(
min_x: f64,
max_x: f64,
min_y: f64,
max_y: f64,
x: f64,
y: f64,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
if x >= min_x && x <= max_x && y >= min_y && y <= max_y {
let a = GeoUtils::orient(x, y, a_x, a_y, b_x, b_y);
let b = GeoUtils::orient(x, y, b_x, b_y, c_x, c_y);
if a == 0 || b == 0 || (a < 0) == (b < 0) {
let c = GeoUtils::orient(x, y, c_x, c_y, a_x, a_y);
c == 0 || (c < 0) == ((b < 0) || (a < 0))
} else {
false
}
} else {
false
}
}
#[macro_export]
macro_rules! either_component2d_named {
($vis:vis $name:ident { $( $Variant:ident : $T:ident ),+ $(,)? }) => {
$vis enum $name<$( $T ),+> {
$( $Variant($T), )+
}
impl<$( $T ),+> Component2D for $name<$( $T ),+>
where
$( $T: Component2D ),+
{
fn get_min_x(&self) -> f64 {
match self {
$( Self::$Variant(inner) => inner.get_min_x(), )+
}
}
fn get_max_x(&self) -> f64 {
match self {
$( Self::$Variant(inner) => inner.get_max_x(), )+
}
}
fn get_min_y(&self) -> f64 {
match self {
$( Self::$Variant(inner) => inner.get_min_y(), )+
}
}
fn get_max_y(&self) -> f64 {
match self {
$( Self::$Variant(inner) => inner.get_max_y(), )+
}
}
fn contains(&self, x: f64, y: f64) -> bool {
match self {
$( Self::$Variant(inner) => inner.contains(x, y), )+
}
}
fn relate(&self, min_x: f64, max_x: f64, min_y: f64, max_y: f64) -> Result<Relation >{
match self {
$( Self::$Variant(inner) => inner.relate(min_x, max_x, min_y, max_y), )+
}
}
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 {
match self {
$( Self::$Variant(inner) => {
inner.intersects_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}, )+
}
}
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 {
match self {
$( Self::$Variant(inner) => {
inner.intersects_triangle(
min_x, max_x, min_y, max_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 {
match self {
$( Self::$Variant(inner) => {
inner.contains_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}, )+
}
}
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 {
match self {
$( Self::$Variant(inner) => {
inner.contains_triangle(
min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y, c_x, c_y,
)
}, )+
}
}
fn within_point(&self, x: f64, y: f64) -> Result<WithinRelation> {
match self {
$( Self::$Variant(inner) => inner.within_point(x, y), )+
}
}
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> {
match self {
$( Self::$Variant(inner) => {
inner.within_line(min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y)
}, )+
}
}
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> {
match self {
$( Self::$Variant(inner) => {
inner.within_triangle(
min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y, bc, c_x, c_y, ca,
)
}, )+
}
}
}
};
}
either_component2d_named!(pub Component2DEnum2{ A: A, B: B});
impl<T> Component2D for Arc<T>
where
T: Component2D,
{
fn get_min_x(&self) -> f64 {
(**self).get_min_x()
}
fn get_max_x(&self) -> f64 {
(**self).get_max_x()
}
fn get_min_y(&self) -> f64 {
(**self).get_min_y()
}
fn get_max_y(&self) -> f64 {
(**self).get_max_y()
}
fn contains(&self, x: f64, y: f64) -> bool {
(**self).contains(x, y)
}
fn relate(&self, min_x: f64, max_x: f64, min_y: f64, max_y: f64) -> Result<Relation> {
(**self).relate(min_x, max_x, min_y, max_y)
}
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 {
(**self).intersects_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}
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 {
(**self).intersects_triangle(min_x, max_x, min_y, max_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 {
(**self).contains_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}
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 {
(**self).contains_triangle(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y, c_x, c_y)
}
fn within_point(&self, x: f64, y: f64) -> Result<WithinRelation> {
(**self).within_point(x, y)
}
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> {
(**self).within_line(min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y)
}
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> {
(**self).within_triangle(
min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y, bc, c_x, c_y, ca,
)
}
fn intersects_line_values(&self, a_x: f64, a_y: f64, b_x: f64, b_y: f64) -> bool {
(**self).intersects_line_values(a_x, a_y, b_x, b_y)
}
fn intersects_triangle_values(
&self,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
(**self).intersects_triangle_values(a_x, a_y, b_x, b_y, c_x, c_y)
}
fn contains_line_values(&self, a_x: f64, a_y: f64, b_x: f64, b_y: f64) -> bool {
(**self).contains_line_values(a_x, a_y, b_x, b_y)
}
fn contains_triangle_values(
&self,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
(**self).contains_triangle_values(a_x, a_y, b_x, b_y, c_x, c_y)
}
fn within_line_values(
&self,
a_x: f64,
a_y: f64,
ab: bool,
b_x: f64,
b_y: f64,
) -> Result<WithinRelation> {
(**self).within_line_values(a_x, a_y, ab, b_x, b_y)
}
fn within_triangle_values(
&self,
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> {
(**self).within_triangle_values(a_x, a_y, ab, b_x, b_y, bc, c_x, c_y, ca)
}
}
impl<T> Component2D for &T
where
T: Component2D,
{
fn get_min_x(&self) -> f64 {
(*self).get_min_x()
}
fn get_max_x(&self) -> f64 {
(*self).get_max_x()
}
fn get_min_y(&self) -> f64 {
(*self).get_min_y()
}
fn get_max_y(&self) -> f64 {
(*self).get_max_y()
}
fn contains(&self, x: f64, y: f64) -> bool {
(*self).contains(x, y)
}
fn relate(&self, min_x: f64, max_x: f64, min_y: f64, max_y: f64) -> Result<Relation> {
(*self).relate(min_x, max_x, min_y, max_y)
}
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 {
(*self).intersects_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}
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 {
(*self).intersects_triangle(min_x, max_x, min_y, max_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 {
(*self).contains_line(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y)
}
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 {
(*self).contains_triangle(min_x, max_x, min_y, max_y, a_x, a_y, b_x, b_y, c_x, c_y)
}
fn within_point(&self, x: f64, y: f64) -> Result<WithinRelation> {
(*self).within_point(x, y)
}
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> {
(*self).within_line(min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y)
}
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> {
(*self).within_triangle(
min_x, max_x, min_y, max_y, a_x, a_y, ab, b_x, b_y, bc, c_x, c_y, ca,
)
}
fn intersects_line_values(&self, a_x: f64, a_y: f64, b_x: f64, b_y: f64) -> bool {
(*self).intersects_line_values(a_x, a_y, b_x, b_y)
}
fn intersects_triangle_values(
&self,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
(*self).intersects_triangle_values(a_x, a_y, b_x, b_y, c_x, c_y)
}
fn contains_line_values(&self, a_x: f64, a_y: f64, b_x: f64, b_y: f64) -> bool {
(*self).contains_line_values(a_x, a_y, b_x, b_y)
}
fn contains_triangle_values(
&self,
a_x: f64,
a_y: f64,
b_x: f64,
b_y: f64,
c_x: f64,
c_y: f64,
) -> bool {
(*self).contains_triangle_values(a_x, a_y, b_x, b_y, c_x, c_y)
}
fn within_line_values(
&self,
a_x: f64,
a_y: f64,
ab: bool,
b_x: f64,
b_y: f64,
) -> Result<WithinRelation> {
(*self).within_line_values(a_x, a_y, ab, b_x, b_y)
}
fn within_triangle_values(
&self,
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> {
(*self).within_triangle_values(a_x, a_y, ab, b_x, b_y, bc, c_x, c_y, ca)
}
}