#[repr(i32)]pub enum EdgeInterpolationAlgorithm {
SPHERICAL = 0,
VINCENTY = 1,
THOMAS = 2,
ANDOYER = 3,
KARNEY = 4,
_Unknown(i32),
}
Expand description
Edge interpolation algorithm for LogicalType::Geography
Variants§
SPHERICAL = 0
Edges are interpolated as geodesics on a sphere.
VINCENTY = 1
THOMAS = 2
Thomas, Paul D. Spheroidal geodesics, reference systems, & local geometry. US Naval Oceanographic Office, 1970
ANDOYER = 3
Thomas, Paul D. Mathematical models for navigation systems. US Naval Oceanographic Office, 1965.
KARNEY = 4
Karney, Charles FF. “Algorithms for geodesics.” Journal of Geodesy 87 (2013): 43-55
_Unknown(i32)
Unknown algorithm
Trait Implementations§
Source§impl Clone for EdgeInterpolationAlgorithm
impl Clone for EdgeInterpolationAlgorithm
Source§fn clone(&self) -> EdgeInterpolationAlgorithm
fn clone(&self) -> EdgeInterpolationAlgorithm
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for EdgeInterpolationAlgorithm
impl Debug for EdgeInterpolationAlgorithm
Source§impl Default for EdgeInterpolationAlgorithm
impl Default for EdgeInterpolationAlgorithm
Source§impl Display for EdgeInterpolationAlgorithm
impl Display for EdgeInterpolationAlgorithm
Source§impl Hash for EdgeInterpolationAlgorithm
impl Hash for EdgeInterpolationAlgorithm
Source§impl Ord for EdgeInterpolationAlgorithm
impl Ord for EdgeInterpolationAlgorithm
Source§fn cmp(&self, other: &EdgeInterpolationAlgorithm) -> Ordering
fn cmp(&self, other: &EdgeInterpolationAlgorithm) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialOrd for EdgeInterpolationAlgorithm
impl PartialOrd for EdgeInterpolationAlgorithm
Source§impl<'a, R: ThriftCompactInputProtocol<'a>> ReadThrift<'a, R> for EdgeInterpolationAlgorithm
impl<'a, R: ThriftCompactInputProtocol<'a>> ReadThrift<'a, R> for EdgeInterpolationAlgorithm
Source§fn read_thrift(prot: &mut R) -> Result<Self>
fn read_thrift(prot: &mut R) -> Result<Self>
Read an object of type
Self
from the input protocol object.Source§impl WriteThrift for EdgeInterpolationAlgorithm
impl WriteThrift for EdgeInterpolationAlgorithm
Source§const ELEMENT_TYPE: ElementType = ElementType::I32
const ELEMENT_TYPE: ElementType = ElementType::I32
The
ElementType
to use when a list of this object is written.Source§fn write_thrift<W: Write>(
&self,
writer: &mut ThriftCompactOutputProtocol<W>,
) -> Result<()>
fn write_thrift<W: Write>( &self, writer: &mut ThriftCompactOutputProtocol<W>, ) -> Result<()>
Serialize this object to the given
writer
.Source§impl WriteThriftField for EdgeInterpolationAlgorithm
impl WriteThriftField for EdgeInterpolationAlgorithm
Source§fn write_thrift_field<W: Write>(
&self,
writer: &mut ThriftCompactOutputProtocol<W>,
field_id: i16,
last_field_id: i16,
) -> Result<i16>
fn write_thrift_field<W: Write>( &self, writer: &mut ThriftCompactOutputProtocol<W>, field_id: i16, last_field_id: i16, ) -> Result<i16>
Used to write struct fields (which may be primitive or IDL defined types). This will
write the field marker for the given
field_id
, using last_field_id
to compute the
field delta used by the Thrift compact protocol. On success this will return field_id
to be used in chaining.impl Copy for EdgeInterpolationAlgorithm
impl Eq for EdgeInterpolationAlgorithm
impl StructuralPartialEq for EdgeInterpolationAlgorithm
Auto Trait Implementations§
impl Freeze for EdgeInterpolationAlgorithm
impl RefUnwindSafe for EdgeInterpolationAlgorithm
impl Send for EdgeInterpolationAlgorithm
impl Sync for EdgeInterpolationAlgorithm
impl Unpin for EdgeInterpolationAlgorithm
impl UnwindSafe for EdgeInterpolationAlgorithm
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more