indicium 0.6.9

Simple in-memory search for collections and key-value stores.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

//! Hamming distance

#![allow(clippy::inline_always)]

/// This `Metric` trait implementation is used to access the Hamming
/// algorithm, as implemented by Ilia Schelokov's
/// [eddie](https://crates.io/crates/eddie) crate, in a generic manner.
impl crate::simple::internal::fuzzers::eddie::Metric for eddie::str::Hamming {
    /// Creates a new instance of a metric `struct` with an internal state for
    /// the metric methods to reuse.
    #[inline(always)]
    fn new() -> Self {
        Self::new()
    }

    /// Similarity metric. Inversion of relative distance, ranging from 1.0
    /// (equality) to 0.0 (nothing in common).
    #[inline(always)]
    fn similarity(&self, str1: &str, str2: &str) -> f64 {
        self.similarity(str1, str2).unwrap_or(0.0)
    } // fn
} // impl