Struct bk_tree::metrics::Levenshtein

pub struct Levenshtein;

This calculates the Levenshtein distance between two strings.

The distance metric itself is calculated using the Wagner-Fischer dynamic programming algorithm.

Examples

use bk_tree::Metric;
use bk_tree::metrics::Levenshtein;

assert_eq!(Levenshtein.distance("bar", "baz"), 1);
assert_eq!(Levenshtein.distance("kitten", "sitting"), 3);

Trait Implementations

impl Debug for Levenshtein

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: AsRef<str> + ?Sized> Metric<K> for Levenshtein

fn distance(&self, a: &K, b: &K) -> u64