Struct Point 

pub struct Point { /* private fields */ }

A geographic point with longitude/latitude coordinates.

This wraps geo::Point and provides additional functionality for GeoJSON conversion, distance calculations, and other operations.

Examples

use spatio_types::geo::Point;

let nyc = Point::new(-74.0060, 40.7128);
assert_eq!(nyc.x(), -74.0060);
assert_eq!(nyc.y(), 40.7128);

Implementations

impl Point

pub fn new(x: f64, y: f64) -> Self

Create a new point from x (longitude) and y (latitude) coordinates.

Arguments

• x - Longitude in degrees (typically -180 to 180)
• y - Latitude in degrees (typically -90 to 90)

Examples

use spatio_types::geo::Point;

let point = Point::new(-74.0060, 40.7128);

pub fn x(&self) -> f64

Get the x coordinate (longitude).

pub fn y(&self) -> f64

Get the y coordinate (latitude).

pub fn lon(&self) -> f64

Get the longitude (alias for x).

pub fn lat(&self) -> f64

Get the latitude (alias for y).

pub fn inner(&self) -> &Point<f64>

Access the inner geo::Point.

pub fn into_inner(self) -> Point<f64>

Convert into the inner geo::Point.

pub fn haversine_distance(&self, other: &Point) -> f64

Calculate haversine distance to another point in meters.

Uses the haversine formula which accounts for Earth’s curvature.

Examples

use spatio_types::geo::Point;

let nyc = Point::new(-74.0060, 40.7128);
let la = Point::new(-118.2437, 34.0522);
let distance = nyc.haversine_distance(&la);
assert!(distance > 3_900_000.0); // ~3,944 km

pub fn geodesic_distance(&self, other: &Point) -> f64

Calculate geodesic distance to another point in meters.

Uses the geo crate’s geodesic algorithm (Karney), which models the Earth as an ellipsoid and is more accurate than haversine but slightly slower.

Examples

use spatio_types::geo::Point;

let p1 = Point::new(-74.0060, 40.7128);
let p2 = Point::new(-74.0070, 40.7138);
let distance = p1.geodesic_distance(&p2);

pub fn euclidean_distance(&self, other: &Point) -> f64

Calculate euclidean distance to another point.

This calculates straight-line distance in the coordinate space, which is only accurate for small distances.

Examples

use spatio_types::geo::Point;

let p1 = Point::new(0.0, 0.0);
let p2 = Point::new(3.0, 4.0);
let distance = p1.euclidean_distance(&p2);
assert_eq!(distance, 5.0); // 3-4-5 triangle

Trait Implementations

impl Clone for Point

fn clone(&self) -> Point

Returns a duplicate of the value.

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<'de> Deserialize<'de> for Point

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<(f64, f64)> for Point

fn from((x, y): (f64, f64)) -> Self

Converts to this type from the input type.

impl From<Point> for Point

fn from(point: Point<f64>) -> Self

Converts to this type from the input type.

impl From<Point> for Point<f64>

fn from(point: Point) -> Self

Converts to this type from the input type.

impl From<Point> for (f64, f64)

fn from(point: Point) -> Self

Converts to this type from the input type.

impl PartialEq for Point

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Point

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Point