On Sunday, 23 June 2019 at 13:10:51 UTC, Samir wrote:
D already has a function to calculate the Levenshtein
distance[1]. I am trying to come up with a function to
calculate the Hamming distance[2] between two strings, `a` and
`b`. So far, this seems to work:
foreach (i, j; zip(a, b)) {
if (i != j)
++hammingDistance;
}
zip( "hello world", "Hello World" ).map!"a[0] != a[1]".sum
