Struct Near 

pub struct Near<F> { /* private fields */ }

Floats filed in buckets of neighbouring order keys, for tolerant search. Two floats within tolerance t of each other lie at most 2t/((1-t)ε) floats apart, where ε is the type’s epsilon. A bucket holds a power of 2 of keys, at least four times that. A key in the lower half of its bucket is therefore far enough from the upper edge that every float it matches lies in its own bucket or the neighbour on the side of its half. At f64 with the default tolerance, a bucket holds 512 keys.

Implementations

impl<F: Float> Near<F>

pub fn new( t: impl Tolerant, x: &[F], copies: impl Fn(usize, usize) -> bool, ) -> Self

Files each item of x in its bucket, except an item i for which copies(j, i) holds with an item j already in the bucket. A copy can’t be a first match, because an earlier item matches whatever it matches.

pub fn near(&self, y: F) -> Links<'_>

The positions filed near y: those in its bucket, then those in the neighbour on the side of its half, each in order of position.