pub struct DBSCANConfig {
pub eps: f64,
pub min_points: usize,
}Expand description
Configuration for the DBSCAN algorithm.
Fields§
§eps: f64Neighborhood radius [m]. Points within this distance are considered neighbors.
min_points: usizeMinimum number of neighbors (including the point itself) required to form a core point.
Trait Implementations§
Source§impl Clone for DBSCANConfig
impl Clone for DBSCANConfig
Source§impl Debug for DBSCANConfig
impl Debug for DBSCANConfig
Auto Trait Implementations§
impl Freeze for DBSCANConfig
impl RefUnwindSafe for DBSCANConfig
impl Send for DBSCANConfig
impl Sync for DBSCANConfig
impl Unpin for DBSCANConfig
impl UnsafeUnpin for DBSCANConfig
impl UnwindSafe for DBSCANConfig
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.