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

//! Damerau-Levenshtein distance

#![allow(clippy::inline_always)]

/// This `struct` is used to access the normalized Damerau-Levenshtein
/// algorithm, as implemented by Danny Guo's
/// [strsim](https://crates.io/crates/strsim) crate, in a generic manner.
pub struct DamerauLevenshtein;

/// This `Metric` trait implementation is used to access the normalized
/// Damerau-Levenshtein algorithm, as implemented by Danny Guo's
/// [strsim](https://crates.io/crates/strsim) crate, in a generic manner.
impl crate::simple::internal::fuzzers::strsim::Metric for DamerauLevenshtein {
    /// Similarity metric. Inversion of relative distance, ranging from 1.0
    /// (equality) to 0.0 (nothing in common).
    #[inline(always)]
    fn similarity(str1: &str, str2: &str) -> f64 {
        strsim::normalized_damerau_levenshtein(str1, str2)
    } // fn
} // impl