(distance seq1 seq2)
Calculates levenshtein distance between two sequences Levenshtein distance roughly defines number of changes which required to apply to transform 'seq1' into 'seq2' Example: consider strings as sequence of letters (distance "bear" "beer") => 1 (1st change from 'a' to 'e') (distance "dog" "doll") => 2 (1st change from 'g' to 'l', 2nd change insertion of 'l')
Calculates levenshtein distance between two sequences Levenshtein distance roughly defines number of changes which required to apply to transform 'seq1' into 'seq2' Example: consider strings as sequence of letters (distance "bear" "beer") => 1 (1st change from 'a' to 'e') (distance "dog" "doll") => 2 (1st change from 'g' to 'l', 2nd change insertion of 'l')
(number-and-unit s)
Parse a string and returns number and unit. Both number and unit is required, nil otherwise
Parse a string and returns number and unit. Both number and unit is required, nil otherwise
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close