Files
addr2line
adler
adler32
ahash
aho_corasick
angle
approx
backtrace
bitflags
blender
bytemuck
byteorder
case
cast_trait
cfg_if
chrono
color
color_quant
const_fn
crc32fast
crossbeam
crossbeam_channel
crossbeam_deque
crossbeam_epoch
crossbeam_queue
crossbeam_skiplist
crossbeam_utils
darling
darling_core
darling_macro
dds
deflate
densevec
derive_builder
derive_builder_core
dot
downcast_rs
dual_quat
either
erased_serde
failure
failure_derive
fixedbitset
float_cmp
fnv
freeimage
freeimage_sys
freetype
freetype_gl_sys
freetype_sys
freetypegl
futures
futures_channel
futures_core
futures_executor
futures_io
futures_macro
futures_sink
futures_task
futures_util
async_await
future
io
lock
sink
stream
task
fxhash
generational_arena
generic_array
getrandom
gif
gimli
glfw
glfw_sys
glin
glin_derive
glsl
half
harfbuzz
harfbuzz_ft_sys
harfbuzz_sys
hashbrown
human_sort
ident_case
image
indexmap
instant
itertools
itoa
jpeg_decoder
lazy_static
libc
libm
lock_api
log
lut_parser
matrixmultiply
memchr
memoffset
meshopt
miniz_oxide
monotonic_clock
mopa
mutiny_derive
na
nalgebra
base
geometry
linalg
ncollide3d
bounding_volume
interpolation
partitioning
pipeline
procedural
query
algorithms
closest_points
contact
distance
nonlinear_time_of_impact
point
proximity
ray
time_of_impact
visitors
shape
transformation
utils
nom
num_complex
num_cpus
num_integer
num_iter
num_rational
num_traits
numext_constructor
numext_fixed_uint
numext_fixed_uint_core
numext_fixed_uint_hack
object
once_cell
parking_lot
parking_lot_core
pathfinding
pennereq
petgraph
pin_project_lite
pin_utils
png
polygon2
ppv_lite86
proc_macro2
proc_macro_crate
proc_macro_hack
proc_macro_nested
quote
rand
rand_chacha
rand_core
rand_distr
raw_window_handle
rawpointer
rayon
rayon_core
rect_packer
regex
regex_syntax
retain_mut
rin
rin_app
rin_blender
rin_core
rin_gl
rin_graphics
rin_gui
rin_material
rin_math
rin_postpo
rin_scene
rin_util
rin_window
rinblender
rinecs
rinecs_derive
rinecs_derive_utils
ringui_derive
rustc_demangle
rusty_pool
ryu
scopeguard
seitan
seitan_derive
semver
semver_parser
serde
serde_derive
serde_json
shaderdata_derive
simba
slab
slice_of_array
slotmap
smallvec
std140_data
streaming_iterator
strsim
syn
synstructure
thiserror
thiserror_impl
thread_local
tiff
time
toml
typenum
unchecked_unwrap
unicode_xid
vec2
vec3
weezl
x11
zlib_sys
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
use core::ops::{Add, Div, Mul, Neg, Sub};
use num_traits::Signed;

#[inline]
pub fn contains_point<T>(points: &[[T; 2]], p: &[T; 2]) -> bool
where
    T: Clone + Signed + PartialOrd,
    for<'a, 'b> &'a T: Div<&'b T, Output = T>
        + Sub<&'b T, Output = T>
        + Add<&'b T, Output = T>
        + Mul<&'b T, Output = T>
        + Neg<Output = T>,
{
    let n = points.len();
    let px = &p[0];
    let py = &p[1];

    let a = points[n - 1].clone();
    let mut b = points[n - 2].clone();
    let mut ax;
    let mut ay = &a[1] - &py;
    let mut bx = &b[0] - &px;
    let mut by = &b[1] - &py;

    let mut lup = &by > &ay;
    for i in 0..n {
        // ax = bx;
        ay = by;
        b = points[i].clone();
        bx = &b[0] - &px;
        by = &b[1] - &py;

        if ay == by {
            continue;
        }
        lup = by > ay;
    }

    let mut depth = 0;
    for i in 0..n {
        ax = bx;
        ay = by;
        let b = &points[i];
        bx = &b[0] - &px;
        by = &b[1] - &py;

        if &ay < &T::zero() && &by < &T::zero() {
            // both "up" or both "down"
            continue;
        }
        if &ay > &T::zero() && &by > &T::zero() {
            // both "up" or both "down"
            continue;
        }
        if &ax < &T::zero() && &bx < &T::zero() {
            // both points on the left
            continue;
        }

        if &ay == &by && (if &ax < &bx {
            ax.clone()
        } else {
            bx.clone()
        }) <= T::zero()
        {
            return true;
        }
        if &ay == &by {
            continue;
        }

        let lx = &ax + &(&(&(&bx - &ax) * &-&ay) / &(&by - &ay));
        if &lx == &T::zero() {
            // point on edge
            return true;
        }
        if &lx > &T::zero() {
            depth += 1;
        }
        if &ay == &T::zero() && lup && &by > &ay {
            // hit vertex, both up
            depth -= 1;
        }
        if &ay == &T::zero() && !lup && &by < &ay {
            // hit vertex, both down
            depth -= 1;
        }

        lup = &by > &ay;
    }

    return (depth & 1) == 1;
}

#[test]
fn test_contains_point() {
    let points = [[1, -1], [1, 1], [-1, 1], [-1, -1]];
    assert!(contains_point(&points, &[0, 0]));
    assert!(contains_point(&points, &[1, 0]));
    assert!(!contains_point(&points, &[2, 0]));
}