Struct cogset::Euclid
[-] [+]
[src]
pub struct Euclid<T>(pub T);
Points in ℝn with the L2 norm.
pub struct Euclid<T>(pub T);
Points in ℝn with the L2 norm.
impl Point for Euclid<[f64; 1]>
fn dist(&self, other: &Euclid<[f64; 1]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 1]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 1]>) -> f64
impl Euclidean for Euclid<[f64; 1]>
impl Point for Euclid<[f64; 2]>
fn dist(&self, other: &Euclid<[f64; 2]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 2]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 2]>) -> f64
impl Euclidean for Euclid<[f64; 2]>
impl Point for Euclid<[f64; 3]>
fn dist(&self, other: &Euclid<[f64; 3]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 3]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 3]>) -> f64
impl Euclidean for Euclid<[f64; 3]>
impl Point for Euclid<[f64; 4]>
fn dist(&self, other: &Euclid<[f64; 4]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 4]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 4]>) -> f64
impl Euclidean for Euclid<[f64; 4]>
impl Point for Euclid<[f64; 5]>
fn dist(&self, other: &Euclid<[f64; 5]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 5]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 5]>) -> f64
impl Euclidean for Euclid<[f64; 5]>
impl Point for Euclid<[f64; 6]>
fn dist(&self, other: &Euclid<[f64; 6]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 6]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 6]>) -> f64
impl Euclidean for Euclid<[f64; 6]>
impl Point for Euclid<[f64; 7]>
fn dist(&self, other: &Euclid<[f64; 7]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 7]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 7]>) -> f64
impl Euclidean for Euclid<[f64; 7]>
impl Point for Euclid<[f64; 8]>
fn dist(&self, other: &Euclid<[f64; 8]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 8]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 8]>) -> f64
impl Euclidean for Euclid<[f64; 8]>
impl Point for Euclid<[f64; 9]>
fn dist(&self, other: &Euclid<[f64; 9]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 9]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 9]>) -> f64
impl Euclidean for Euclid<[f64; 9]>
impl Point for Euclid<[f64; 10]>
fn dist(&self, other: &Euclid<[f64; 10]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 10]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 10]>) -> f64
impl Euclidean for Euclid<[f64; 10]>
impl Point for Euclid<[f64; 11]>
fn dist(&self, other: &Euclid<[f64; 11]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 11]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 11]>) -> f64
impl Euclidean for Euclid<[f64; 11]>
impl Point for Euclid<[f64; 12]>
fn dist(&self, other: &Euclid<[f64; 12]>) -> f64
fn dist_monotonic(&self, other: &Euclid<[f64; 12]>) -> f64
fn monotonic_transform(x: f64) -> f64
fn monotonic_inverse(x: f64) -> f64
fn dist_lower_bound(&self, other: &Euclid<[f64; 12]>) -> f64
impl Euclidean for Euclid<[f64; 12]>
impl<T: Debug> Debug for Euclid<T> where T: Debug
impl<T: PartialOrd> PartialOrd for Euclid<T> where T: PartialOrd
fn partial_cmp(&self, __arg_0: &Euclid<T>) -> Option<Ordering>
fn lt(&self, __arg_0: &Euclid<T>) -> bool
fn le(&self, __arg_0: &Euclid<T>) -> bool
fn gt(&self, __arg_0: &Euclid<T>) -> bool
fn ge(&self, __arg_0: &Euclid<T>) -> bool
impl<T: Ord> Ord for Euclid<T> where T: Ord
impl<T: PartialEq> PartialEq for Euclid<T> where T: PartialEq
impl<T: Eq> Eq for Euclid<T> where T: Eq
impl<T: Copy> Copy for Euclid<T> where T: Copy
impl<T: Clone> Clone for Euclid<T> where T: Clone
fn clone(&self) -> Euclid<T>
fn clone_from(&mut self, source: &Self)
Prefix searches with a type followed by a colon (e.g.
fn:
) to restrict the search to a given type.
Accepted types are: fn
, mod
,
struct
, enum
,
trait
, typedef
(or
tdef
).