Struct rsgeo::prelude::Point

pub struct Point { /* fields omitted */ }

Point data type

Including latitude and longitude as f32

Implementations

impl Point

pub fn new(lat: f32, long: f32) -> Result<Self, &'static str>

latitude should be smaller than 90.0 and greater than -90.0

longitude should be smaller than 180.0 and greater than -180.0

Example

use rsgeo::prelude::Point;
let p1 = Point::new(30.12, 125.26).unwrap();
let p2 = Point::new(32.54, 107.15).unwrap();
let p3 = Point::new(30.12, 125.26).unwrap();
assert_ne!(p1, p2);
assert_eq!(p1, p3);

pub fn distance(&self, other: &Self) -> f32

calculate distance between two points in earth sphere mode

Example

 use rsgeo::prelude::Point;
 let p1 = Point::new(0.0, 0.0).unwrap();
 let p2 = Point::new(0.0, 0.0).unwrap();
 let p3 = Point::new(28.478, 179.395).unwrap();
 let p4 = Point::new(28.33, -177.547).unwrap();
 assert!(p1.distance(&p2).abs() < 0.001);
 assert!(p3.distance(&p4).abs() - 299878.88958 < 0.1);

pub fn distance_from_location(&self, other: &Location) -> f32

calculate distance between point and location

pub fn shortest_distance_from_trajectory(
    &self,
    other: &Trajectory
) -> Option<f32>

calculate the shortest distance between point and trajectory

the time complexity is O(n),which n is trajectory.len()

Example

use rsgeo::prelude::{Trajectory,Location,Point};
let p = Point::new(26.301,121.302).unwrap();
let loc1 = Location::new(Point::new(25.11,120.98).unwrap(),100);
let loc2 = Location::new(Point::new(26.2,121.1).unwrap(),150);
let loc3 = Location::new(Point::new(26.3,121.3).unwrap(),200);
let mut t = Trajectory::with_capacity(3);
t.push_location(&loc1);
t.push_location(&loc2);
t.push_location(&loc3);
assert!((p.shortest_distance_from_trajectory(&t).unwrap() - p.distance_from_location(&loc3)).abs() < 1e-6);

pub fn degree(&self, other: &Point) -> f32

Calculate the degree which between the line and the north

degree in [-90.0,+90.0]

Example

use rsgeo::prelude::*;
let p1 = Point::new(10.0,150.0).unwrap();
let p2 = Point::new(20.0,150.0).unwrap();
let p3 = Point::new(10.0,160.0).unwrap();

assert!((p1.degree(&p2)).abs() < 1e-5);
assert!((p1.degree(&p3) - 90.0).abs() < 1e-5);

Trait Implementations

impl Clone for Point

fn clone(&self) -> Point

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Point

impl Debug for Point

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for Point

impl Hash for Point

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl PartialEq<Point> for Point

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]

pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.