{"packages":{"designbycode/levenshtein-distance":{"dev-dependabot/composer/pestphp/pest-tw-3.3":{"name":"designbycode/levenshtein-distance","description":"The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.","keywords":["levenshtein","levenshtein-distance","designbycode","levenshtein distance"],"homepage":"https://github.com/designbycode/levenshtein-distance","version":"dev-dependabot/composer/pestphp/pest-tw-3.3","version_normalized":"dev-dependabot/composer/pestphp/pest-tw-3.3","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/levenshtein-distance.git","type":"git","reference":"53ae8f945a5267fdd6f8b46878832274763bdcd8"},"dist":{"url":"https://api.github.com/repos/designbycode/levenshtein-distance/zipball/53ae8f945a5267fdd6f8b46878832274763bdcd8","type":"zip","shasum":"","reference":"53ae8f945a5267fdd6f8b46878832274763bdcd8"},"type":"library","funding":[{"url":"https://github.com/designbycode","type":"github"}],"time":"2024-10-07T22:38:36+00:00","autoload":{"psr-4":{"Designbycode\\LevenshteinDistance\\":"src"}},"require":{"php":"^8.1|^8.2|^8.3"},"require-dev":{"pestphp/pest":"^3.3","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8502476},"dev-dependabot/github_actions/dependabot/fetch-metadata-2.2.0":{"name":"designbycode/levenshtein-distance","description":"This is my package levenshtein-distance","keywords":["levenshtein-distance","designbycode"],"homepage":"https://github.com/designbycode/levenshtein-distance","version":"dev-dependabot/github_actions/dependabot/fetch-metadata-2.2.0","version_normalized":"dev-dependabot/github_actions/dependabot/fetch-metadata-2.2.0","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/levenshtein-distance.git","type":"git","reference":"ce7b084595cc99229ba3004b91114dfcd0d22072"},"dist":{"url":"https://api.github.com/repos/designbycode/levenshtein-distance/zipball/ce7b084595cc99229ba3004b91114dfcd0d22072","type":"zip","shasum":"","reference":"ce7b084595cc99229ba3004b91114dfcd0d22072"},"type":"library","funding":[{"url":"https://github.com/designbycode","type":"github"}],"time":"2024-07-20T18:05:58+00:00","autoload":{"psr-4":{"Designbycode\\LevenshteinDistance\\":"src"}},"require":{"php":"^8.1"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321939},"dev-main":{"name":"designbycode/levenshtein-distance","description":"The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.","keywords":["levenshtein","levenshtein-distance","designbycode","levenshtein distance"],"homepage":"https://github.com/designbycode/levenshtein-distance","version":"dev-main","version_normalized":"dev-main","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/levenshtein-distance.git","type":"git","reference":"184a8076bc5735c605f767613c8b1d60da5a1719"},"dist":{"url":"https://api.github.com/repos/designbycode/levenshtein-distance/zipball/184a8076bc5735c605f767613c8b1d60da5a1719","type":"zip","shasum":"","reference":"184a8076bc5735c605f767613c8b1d60da5a1719"},"type":"library","funding":[{"url":"https://github.com/designbycode","type":"github"}],"time":"2024-07-20T18:20:08+00:00","autoload":{"psr-4":{"Designbycode\\LevenshteinDistance\\":"src"}},"default-branch":true,"require":{"php":"^8.1|^8.2|^8.3"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321940},"v1.0.0":{"name":"designbycode/levenshtein-distance","description":"This is my package levenshtein-distance","keywords":["levenshtein-distance","designbycode"],"homepage":"https://github.com/designbycode/levenshtein-distance","version":"v1.0.0","version_normalized":"1.0.0.0","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/levenshtein-distance.git","type":"git","reference":"747d7eb0e46d99e55da27e61bfb4883e5b38acbf"},"dist":{"url":"https://api.github.com/repos/designbycode/levenshtein-distance/zipball/747d7eb0e46d99e55da27e61bfb4883e5b38acbf","type":"zip","shasum":"","reference":"747d7eb0e46d99e55da27e61bfb4883e5b38acbf"},"type":"library","funding":[{"url":"https://github.com/designbycode","type":"github"}],"time":"2024-07-20T18:13:44+00:00","autoload":{"psr-4":{"Designbycode\\LevenshteinDistance\\":"src"}},"require":{"php":"^8.1"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321942},"v1.0.1":{"name":"designbycode/levenshtein-distance","description":"The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.","keywords":["levenshtein","levenshtein-distance","designbycode","levenshtein distance"],"homepage":"https://github.com/designbycode/levenshtein-distance","version":"v1.0.1","version_normalized":"1.0.1.0","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/levenshtein-distance.git","type":"git","reference":"184a8076bc5735c605f767613c8b1d60da5a1719"},"dist":{"url":"https://api.github.com/repos/designbycode/levenshtein-distance/zipball/184a8076bc5735c605f767613c8b1d60da5a1719","type":"zip","shasum":"","reference":"184a8076bc5735c605f767613c8b1d60da5a1719"},"type":"library","funding":[{"url":"https://github.com/designbycode","type":"github"}],"time":"2024-07-20T18:20:08+00:00","autoload":{"psr-4":{"Designbycode\\LevenshteinDistance\\":"src"}},"require":{"php":"^8.1|^8.2|^8.3"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321944}}}}