{"packages":{"designbycode/fuzzy-search":{"dev-dependabot/composer/pestphp/pest-tw-3.6":{"name":"designbycode/fuzzy-search","description":"The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.","keywords":["search","levenshtein","Fuzzy search","designbycode","levenshtein distance","fuzzy-search"],"homepage":"https://github.com/designbycode/fuzzy-search","version":"dev-dependabot/composer/pestphp/pest-tw-3.6","version_normalized":"dev-dependabot/composer/pestphp/pest-tw-3.6","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/fuzzy-search.git","type":"git","reference":"39482bfee2ca228c3f121f0de6e04eac5a11b087"},"dist":{"url":"https://api.github.com/repos/designbycode/fuzzy-search/zipball/39482bfee2ca228c3f121f0de6e04eac5a11b087","type":"zip","shasum":"","reference":"39482bfee2ca228c3f121f0de6e04eac5a11b087"},"type":"library","funding":[{"url":"https://github.com/Designbycode","type":"github"}],"time":"2024-12-02T11:24:12+00:00","autoload":{"psr-4":{"Designbycode\\FuzzySearch\\":"src"}},"require":{"php":"^8.1|^8.2|^8.3","designbycode/levenshtein-distance":"^1.0"},"require-dev":{"pestphp/pest":"^3.6","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8646873},"dev-main":{"name":"designbycode/fuzzy-search","description":"The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.","keywords":["search","levenshtein","Fuzzy search","designbycode","levenshtein distance","fuzzy-search"],"homepage":"https://github.com/designbycode/fuzzy-search","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/fuzzy-search.git","type":"git","reference":"b035a550d311a6537ad04aa7daa2c1a5efb2e3a9"},"dist":{"url":"https://api.github.com/repos/designbycode/fuzzy-search/zipball/b035a550d311a6537ad04aa7daa2c1a5efb2e3a9","type":"zip","shasum":"","reference":"b035a550d311a6537ad04aa7daa2c1a5efb2e3a9"},"type":"library","funding":[{"url":"https://github.com/Designbycode","type":"github"}],"time":"2024-07-20T18:37:52+00:00","autoload":{"psr-4":{"Designbycode\\FuzzySearch\\":"src"}},"default-branch":true,"require":{"designbycode/levenshtein-distance":"^1.0","php":"^8.1|^8.2|^8.3"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321950},"v1.0.0":{"name":"designbycode/fuzzy-search","description":"The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.","keywords":["search","levenshtein","Fuzzy search","designbycode","levenshtein distance","fuzzy-search"],"homepage":"https://github.com/designbycode/fuzzy-search","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/fuzzy-search.git","type":"git","reference":"affc84d274fc6a5294b02d3e18beac934c56b908"},"dist":{"url":"https://api.github.com/repos/designbycode/fuzzy-search/zipball/affc84d274fc6a5294b02d3e18beac934c56b908","type":"zip","shasum":"","reference":"affc84d274fc6a5294b02d3e18beac934c56b908"},"type":"library","funding":[{"url":"https://github.com/Designbycode","type":"github"}],"time":"2024-07-20T18:27:32+00:00","autoload":{"psr-4":{"Designbycode\\FuzzySearch\\":"src"}},"require":{"php":"^8.1","designbycode/levenshtein-distance":"^1.0"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321949},"v1.0.1":{"name":"designbycode/fuzzy-search","description":"The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.","keywords":["search","levenshtein","Fuzzy search","designbycode","levenshtein distance","fuzzy-search"],"homepage":"https://github.com/designbycode/fuzzy-search","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/fuzzy-search.git","type":"git","reference":"affc84d274fc6a5294b02d3e18beac934c56b908"},"dist":{"url":"https://api.github.com/repos/designbycode/fuzzy-search/zipball/affc84d274fc6a5294b02d3e18beac934c56b908","type":"zip","shasum":"","reference":"affc84d274fc6a5294b02d3e18beac934c56b908"},"type":"library","funding":[{"url":"https://github.com/Designbycode","type":"github"}],"time":"2024-07-20T18:27:32+00:00","autoload":{"psr-4":{"Designbycode\\FuzzySearch\\":"src"}},"require":{"php":"^8.1","designbycode/levenshtein-distance":"^1.0"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321952},"v1.0.2":{"name":"designbycode/fuzzy-search","description":"The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.","keywords":["search","levenshtein","Fuzzy search","designbycode","levenshtein distance","fuzzy-search"],"homepage":"https://github.com/designbycode/fuzzy-search","version":"v1.0.2","version_normalized":"1.0.2.0","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/fuzzy-search.git","type":"git","reference":"473e36a2d5bbd45ab0f168ffea19e44ae3c9a4d5"},"dist":{"url":"https://api.github.com/repos/designbycode/fuzzy-search/zipball/473e36a2d5bbd45ab0f168ffea19e44ae3c9a4d5","type":"zip","shasum":"","reference":"473e36a2d5bbd45ab0f168ffea19e44ae3c9a4d5"},"type":"library","funding":[{"url":"https://github.com/Designbycode","type":"github"}],"time":"2024-07-20T18:33:38+00:00","autoload":{"psr-4":{"Designbycode\\FuzzySearch\\":"src"}},"require":{"php":"^8.1|^8.2|^8.3","designbycode/levenshtein-distance":"^1.0"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321954},"v1.0.3":{"name":"designbycode/fuzzy-search","description":"The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.","keywords":["search","levenshtein","Fuzzy search","designbycode","levenshtein distance","fuzzy-search"],"homepage":"https://github.com/designbycode/fuzzy-search","version":"v1.0.3","version_normalized":"1.0.3.0","license":["MIT"],"authors":[{"name":"Claude Myburgh","email":"claude@designbycode.co.za","role":"Developer"}],"source":{"url":"https://github.com/designbycode/fuzzy-search.git","type":"git","reference":"473e36a2d5bbd45ab0f168ffea19e44ae3c9a4d5"},"dist":{"url":"https://api.github.com/repos/designbycode/fuzzy-search/zipball/473e36a2d5bbd45ab0f168ffea19e44ae3c9a4d5","type":"zip","shasum":"","reference":"473e36a2d5bbd45ab0f168ffea19e44ae3c9a4d5"},"type":"library","funding":[{"url":"https://github.com/Designbycode","type":"github"}],"time":"2024-07-20T18:33:38+00:00","autoload":{"psr-4":{"Designbycode\\FuzzySearch\\":"src"}},"require":{"php":"^8.1|^8.2|^8.3","designbycode/levenshtein-distance":"^1.0"},"require-dev":{"pestphp/pest":"^2.20","laravel/pint":"^1.0","spatie/ray":"^1.28"},"uid":8321956}}}}