{"_id":"longestrepeatedstrings","_rev":"40-1138fd4ba064ab57fc88f59611d35ea6","name":"longestrepeatedstrings","dist-tags":{"latest":"1.0.41"},"versions":{"1.0.0-a":{"name":"longestrepeatedstrings","version":"1.0.0-a","keywords":["longest","repeated","substring","string","strings","substrings"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.0-a","maintainers":[{"name":"braksator","email":"daniel@braksator.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"669c13ac6e6d9d0cc8b5c36d65d57774634b0232","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.0-a.tgz","fileCount":11,"integrity":"sha512-WhdeKxXryPNUZtqB+jtKP0Y0EvMiLVSSEcYzWmJXkBMbRLN4braTt4l28ElJEDimOte3qQEmc6UWGw4eU7LyCQ==","signatures":[{"sig":"MEQCIC3r0/wNShqBArMeX2ErIh2kgMetnGu51Nlf4ikYqADFAiBm29j+Xl6tVrcLAsgP0DXSekLqX6nc5bVvU8IR8KpF4A==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":153299},"main":"index.js","gitHead":"25441be3abcc85fe414a265767486b1a312a78d1","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"daniel@braksator.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Generates a report about the longest repeated substrings in supplied text.","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.0-a_1742831154921_0.9449483067426936","host":"s3://npm-registry-packages-npm-production"}},"1.0.1-a":{"name":"longestrepeatedstrings","version":"1.0.1-a","keywords":["longest","repeated","substring","string","strings","substrings"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.1-a","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"81b7113540bd1a6ef5a721aa9203cb4857af2e23","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.1-a.tgz","fileCount":11,"integrity":"sha512-ASQUDhVTTBDh8YyvKV0HxwDY6NW7tClzBCz5I6nTmzw9Iatcg5mdBx93aWNLclnTL98XolbjgJeR/SSDvs6U6A==","signatures":[{"sig":"MEQCIF2CsWsJrf1aaNX+ObodP4OETBNYt1u8uhhdw0gAZZ3NAiA+2XEYK/hP7hhgxCg0l/Dbj0j2rbe4PaQuiNoXhpUIKw==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":153541},"main":"index.js","gitHead":"52f9d00b181a427c690e833cb1591f98d6ceaf37","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Generates a report about the longest repeated substrings in supplied text.","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.1-a_1742870442364_0.7494806491174792","host":"s3://npm-registry-packages-npm-production"}},"1.0.1":{"name":"longestrepeatedstrings","version":"1.0.1","keywords":["longest","repeated","substring","string","strings","substrings"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.1","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"3fb33eb681224816a4cdfdeb19a547d65441b5b5","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.1.tgz","fileCount":11,"integrity":"sha512-FFjHty9fsm779sb8DNP+DTYOpEOsILtgzqehfvRYbGuu/yMlV+LG60yccXSuO75Pqlf7FAciXt32idFLXJORjA==","signatures":[{"sig":"MEUCIAY/meSDwbK+Aeaa86Pt7V1LOKb7EvK6YjSoHO4EJu4BAiEA1xjaTIGzFZXpntNpVlB4AIZmFin6ztHju65JbpQSCfk=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":153505},"main":"index.js","gitHead":"488ec5fdc617e3df72a885eeb6d75764a1fc90a2","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Generates a report about the longest repeated substrings in supplied text.","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.1_1742882685922_0.8776358846790921","host":"s3://npm-registry-packages-npm-production"}},"1.0.2":{"name":"longestrepeatedstrings","version":"1.0.2","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.2","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"7d84b0e47b8813f4d85941d62f84d22204c918ef","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.2.tgz","fileCount":11,"integrity":"sha512-g6EJ3hGFSI5AKf1nFM/cHb18dFOvpbevV8yyqso5jURnd38zWwLhh4+XQ06HLwgCg3aM3wLmSS31D3vslaiXXQ==","signatures":[{"sig":"MEYCIQCjaspL4FxM5bZXT3KlXiLftNRuJyQVcU/W0UN8MHmWPwIhAIVllpYZPL8m+ke9xXZMRb5tEH5vUhjDvUnr14p8CQ5e","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":154057},"main":"index.js","gitHead":"415fc0ab4c43a7d408fb3da8a483e4a365fbc0a5","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.2_1742904942633_0.2975785276389795","host":"s3://npm-registry-packages-npm-production"}},"1.0.3":{"name":"longestrepeatedstrings","version":"1.0.3","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.3","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"faa59f4229e1e118e7377523c9f046b3b0e9da94","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.3.tgz","fileCount":11,"integrity":"sha512-GrDX1O09exIjUPAo56un4i8l+YjjM2jQwZidmQa5N1WVmG55Q0ZwJvkhi0ezFawuENdTcpEaUzdF7Vq4uA1LUQ==","signatures":[{"sig":"MEQCIDL4V4BoOUGS/5I2jOifPDIe7SQDKofaq+rdhTitmCw3AiA7vo+YNPV7KsrmMelTVzW0lsw2DOSAmFhLaYrtkupBDA==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156139},"main":"index.js","gitHead":"8c1c517c99372575d2dc51670a210c4ed2fa4e94","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.3_1742925197679_0.9796906619492811","host":"s3://npm-registry-packages-npm-production"}},"1.0.4":{"name":"longestrepeatedstrings","version":"1.0.4","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.4","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"facfdb16743c6e5470495ed97961240f0234b4c6","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.4.tgz","fileCount":11,"integrity":"sha512-iagIJxnSSELYJqkfjdwDd0zjbsuvwjiJYEd5bR90iIQGmZFZ71dOXacAK+qrxlRhq41V702fSYsrKjU13MX4Cg==","signatures":[{"sig":"MEQCIGp8skTZEgURR9FiEO4ICuttJTkbeZWzed6uCZJzZlwIAiARCCqM0OBcjZym8YP8ED8JC7vdXuV4LnjdGmtyosMdkw==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156074},"main":"index.js","gitHead":"a190bee60c1887fe7bb9b10ed5a1889bfbed5ec6","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.4_1742925686111_0.8421315254599664","host":"s3://npm-registry-packages-npm-production"}},"1.0.5":{"name":"longestrepeatedstrings","version":"1.0.5","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.5","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"ac6bc66027e116a27ea8477740c2e34551a677fa","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.5.tgz","fileCount":11,"integrity":"sha512-cXo0+YEf1swpO2g530zfzeniqIaTr/GR2hIbeNoGEjImiCY+O5RM7Qr4+vmCkpcVG60+YqZhi4F+Srudje0oOQ==","signatures":[{"sig":"MEYCIQCn4ibOHEAWmspj8eUpQRYVCOUhAmFCm5plPrlaCXqHwgIhALvvaaCWLj2lIz9Mqeb36BCV15HGarR/tFj5HBDl9oLv","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156088},"main":"index.js","gitHead":"e521977346baaebb1a7f1199fdb7fc9f9ca40e1b","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.5_1742961152798_0.7316962527270348","host":"s3://npm-registry-packages-npm-production"}},"1.0.6":{"name":"longestrepeatedstrings","version":"1.0.6","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.6","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"d64aa0beee70fb8e0993465c9d64d7756ea2250e","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.6.tgz","fileCount":11,"integrity":"sha512-f+ob/GuK3pgThMwTtglPKzBCR0S7lX1SgKr7TziW64UmlbG+G1rIF0xTmF6V5B97FT+xiZoJV3KvtHbAVSe/bA==","signatures":[{"sig":"MEUCICEASvin1g/77arnWS8ehHfbQ0Zqyd711Zr7E++8pydlAiEAomSC/y6Tb2DpqHfyPeRepzAH3fsxuu7eYlsCWMv/xOA=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156148},"main":"index.js","gitHead":"3cb3d47b1a12fd7515aa8f73d1c5fe8fcc39b743","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.6_1742963440619_0.18770101176058773","host":"s3://npm-registry-packages-npm-production"}},"1.0.7":{"name":"longestrepeatedstrings","version":"1.0.7","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.7","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"b37dd5c278af177b8588a8cc38b7da8624c00198","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.7.tgz","fileCount":11,"integrity":"sha512-Ex9YdrCthHdOiftY8SilNzanjOz89bI8MuIsvUbYBwNTj2uqCUAbnLi1cEn3frolRF8jIT1s6HEaiGke0tiE5w==","signatures":[{"sig":"MEYCIQCNDV2drag6LtuvSKsHyjT6MU0I4InqNmkLpWkiEU25pwIhAPDv2OPWFWqJYhDIEoAN/AY7cpedaRzO4G5eYuVX+F6c","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156176},"main":"index.js","gitHead":"0f49cc6114aed4cb78177caeaeaea6d9e0fcb4d5","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.7_1742963778320_0.014209851805775164","host":"s3://npm-registry-packages-npm-production"}},"1.0.8":{"name":"longestrepeatedstrings","version":"1.0.8","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.8","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"48b0c8a51b7d8cd02ea26bf055ad230251007ff6","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.8.tgz","fileCount":11,"integrity":"sha512-8FPPWO96r+r9V/c2JEPdCmkmEHPa5IXrtsHJlQekmoeZfQMjXp8Z2cWwFlVgaDzY+KgysRsURNrPwFAlJZ2sOQ==","signatures":[{"sig":"MEYCIQDjuymQ5dZhfH93t4/OD9Ts1q7mUHubz3LKY7+7Y7r3PQIhAL1wicXN2OGCcEhUJvA2cli/WDuRUVGVG/4e0k8R28OX","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156104},"main":"index.js","gitHead":"2b3c1a3be0ac1ccb26d491cbe44a54830d063c32","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.8_1742964177449_0.6710745223872816","host":"s3://npm-registry-packages-npm-production"}},"1.0.10":{"name":"longestrepeatedstrings","version":"1.0.10","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.10","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"b3fdc5db3ced7a7a68f4bbce5dd5304fc227f479","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.10.tgz","fileCount":11,"integrity":"sha512-mG3jWYo8CU5orsZpRsDI7jSWOGYcOmShuBO9cqPRD+q/9amtQwuhFfGXKXDYTi1BqYTzjbNBXS1WICZuKoWkjA==","signatures":[{"sig":"MEQCIE2PsV0DPe5t8+V2YMt/XOR44DF2oaqtzmkVKviii2JGAiBiPVOkh/NR2Tz1MEpTq9Bd2vRfSF6bKbJshI6b0HaXFg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":155882},"main":"index.js","gitHead":"928a9e6c8a5ed9eda9c61dbb53d495f0e4b36fc1","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.10_1742970561739_0.7240049652383409","host":"s3://npm-registry-packages-npm-production"}},"1.0.13":{"name":"longestrepeatedstrings","version":"1.0.13","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.13","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"10bfd982f24cdc969d2ff08b5b8420b4e0a27431","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.13.tgz","fileCount":11,"integrity":"sha512-Hl+ntUOr4quion9ykwLBCcgkC/1mDU7V6lDuDrnjuRxqFVi4zYc+MweEF+V+BcpRj3Y5NGkJLB/HDO+bQxlamg==","signatures":[{"sig":"MEUCIQCTb77wK+JVr96+tJp3FTMJNbxKtActOnAwcToLl5t78AIgHNb9yRo1RpTCk1irkTyk9vGpZM0a9o2Q/Habqm3cvAU=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156767},"main":"index.js","gitHead":"4ea2a1f7176e2b56c8857800dd51d681b7371ff4","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.13_1743059631385_0.45667653612932324","host":"s3://npm-registry-packages-npm-production"}},"1.0.14":{"name":"longestrepeatedstrings","version":"1.0.14","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.14","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"e6d9234bc4adf4aff0449c1e7ed1491a24aa5b0d","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.14.tgz","fileCount":11,"integrity":"sha512-MVy2L74E1IePz+sEqGJuyxF3XlPmhcmVbhQnxq0gHz8xOoTMrrjAjb2EIV3SVK/TWuwoHrpn1No+ELGtI7QpJg==","signatures":[{"sig":"MEYCIQDold7LA+jk+eylZcTn5qUhjdKknF6BaWBDM+n1ykxx9QIhAMZ7hU11jomUsT6veenH1JPoOxnl/W2vSQJbSBfQkShc","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156833},"main":"index.js","gitHead":"4ea2a1f7176e2b56c8857800dd51d681b7371ff4","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.14_1743059798202_0.8874055108281695","host":"s3://npm-registry-packages-npm-production"}},"1.0.15":{"name":"longestrepeatedstrings","version":"1.0.15","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.15","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"6a4c638e2ad2473e10571a087dd7b4bc62fb510c","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.15.tgz","fileCount":11,"integrity":"sha512-+hZ5ezWHkvxQz9N/pAlzKwHYSHNW+oVq5BK5Yu9vd2BRsvPXLNUC/FGeBqYVKIggdQHt0Q5lgFXcelIVhazs9g==","signatures":[{"sig":"MEUCIFnp++SqBw4ijy2lzRRzXkuEH/G0e5qpAFYo79/uuT/SAiEAztL3Eou/KQ2Hia/yEMIeaFt66luh1WLRUjIk64Qhfoc=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156834},"main":"index.js","gitHead":"0a024e35f6c1dbd154dd6f6aea2a0e6b96f67c50","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.15_1743060177001_0.19389227617239246","host":"s3://npm-registry-packages-npm-production"}},"1.0.16":{"name":"longestrepeatedstrings","version":"1.0.16","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.16","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"d4b4d5d33ff8201307d5785aa2fae95166b32964","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.16.tgz","fileCount":11,"integrity":"sha512-QO/qK5EUjQtEF9o/FLaf2MvScifX1fhrk7GTJNvJKKVPNZUJx2CA3cZHKMcsX0ujsWI1idwP1WMhk2pMXToN0g==","signatures":[{"sig":"MEYCIQDG2IMXiXJJeBcu8rOnB+WRnJ6BaLZR2jzS08YOUHFJEwIhAJBsWXoDRW71TMw4wIqBi47Z1El1R/OZINnJUbE1+UVt","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":158872},"main":"index.js","gitHead":"6d35b286f88af3f01f547ec47a3b17179d48364b","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.16_1743070161024_0.4456312296080229","host":"s3://npm-registry-packages-npm-production"}},"1.0.17":{"name":"longestrepeatedstrings","version":"1.0.17","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.17","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"94dbe80db69e46ef6efaa3a4cefdc3ee05cb83db","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.17.tgz","fileCount":11,"integrity":"sha512-zMnqziQ+sPKg/ao7DLGQNZsPakwRR8nuYXM8mPCltMGSgwEQ47QOb92R30FfI1EeGERcebk30hbLW/XXNgoU5A==","signatures":[{"sig":"MEUCIG+W9YW63CaA0KRb1zbOF5HMB8xOktJ+PbNl+8rK//nQAiEArtuxhdSXbYHXXu2mSoS2Eim9X+iZusGrcKooVOnNOb8=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":155830},"main":"index.js","gitHead":"d7d5729997bd360709b645f46e6d40844f2ea28d","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.17_1743074859420_0.9421043274784613","host":"s3://npm-registry-packages-npm-production"}},"1.0.18":{"name":"longestrepeatedstrings","version":"1.0.18","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.18","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"039b3efc72f47845a95a31be6190fa6f410f3c69","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.18.tgz","fileCount":11,"integrity":"sha512-QBrihY1yWPZpWK78N4M6mmRP8AdGth2wVlf8Pz43ba5VVYDGFCgr0OJsnkoJrSa0M3Akt1it5FnM+jwd58IH9A==","signatures":[{"sig":"MEQCIDmlUjDD4cCCQibJV5JvnXxXDg8OU6OWfETI0SexwrTCAiBBDkul4bFdrgQmXVKo7hzpvQ8HpH7pwrDUoqh09kqiSg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":155886},"main":"index.js","gitHead":"4c522c0125cf3432a289a2b646e2028c3554118c","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.18_1743075211383_0.24471845238934864","host":"s3://npm-registry-packages-npm-production"}},"1.0.19":{"name":"longestrepeatedstrings","version":"1.0.19","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.19","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"2b965efd42aec877346c367b5b9cc64757610445","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.19.tgz","fileCount":11,"integrity":"sha512-jVRab+53POp+kPiXJYczZ9VvDjBmtAntCmzZ0m56fp5FV4xhKu4WeSA8kGp89UsWktGVB0p8J2/nq7yNQutLxA==","signatures":[{"sig":"MEUCIQDooXwAOEf1XITTOWV4MlnXEFl3qzyd0i25HJVM+2RnegIgCRHcQMaCTwYkRou/ay7whZonbxkizCH/Iobc7zmAGlI=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":156201},"main":"index.js","gitHead":"72560c4bf0ae876eebc04ef9758319982bbe3ed0","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.19_1743106868975_0.09771708382052324","host":"s3://npm-registry-packages-npm-production"}},"1.0.20":{"name":"longestrepeatedstrings","version":"1.0.20","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.20","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"31d5e5185ed5a66c1d055c0537659505bfa559b1","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.20.tgz","fileCount":11,"integrity":"sha512-dePSb6GjuhZYf5cEZ9JOq2NR8je9tP212YDBOwuJgj4HqTuhk1b/N4Mln/j3xwQE1UtA6p7b4WsuMOqymE/eGw==","signatures":[{"sig":"MEUCIGxWXBHokNyylnBIy0UMl/p/EAm2/6c8c7VkfhnADs/vAiEAxaxQ67KXQSBv4JPB+Uprnu+7gpXPEVcludDRrfX53vo=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":157682},"main":"index.js","gitHead":"a47107c664bfa4e40d85ed617ee0711a9f43ccb8","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.20_1743107249960_0.9680320045764585","host":"s3://npm-registry-packages-npm-production"}},"1.0.21":{"name":"longestrepeatedstrings","version":"1.0.21","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.21","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"b6e97c1179204941ed92d0200bc61a6cc32b6887","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.21.tgz","fileCount":11,"integrity":"sha512-UaOcb60A5a4Br1E3DWaw86TFIsX1SGjlOB34zId//5J+raEHUFhvEjeUgO/QF5nj5RoueF881VfR+tZtzxrQUA==","signatures":[{"sig":"MEUCIQCdQMte/GNoLYAIQu0FSRPhjVvopDd/MAu3i+3gQgutDAIgBCQLiZvG1KlqiGfhEMkaMgdc9XVi8v/u9Ua03r6uMLE=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":157711},"main":"index.js","gitHead":"60c70cbc0b44e5687f5667868191d952183ecd48","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.21_1743116942131_0.8619912040721049","host":"s3://npm-registry-packages-npm-production"}},"1.0.22":{"name":"longestrepeatedstrings","version":"1.0.22","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.22","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"67435ccf1048c7348dc41a8e5ddbbd37f5911741","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.22.tgz","fileCount":12,"integrity":"sha512-3pnA0rg4YCxfFOFI2lfKWo8c9wv4JAKvzIa1wUC7BcF8ZI1EjaI0ThnJ0ykVe1hIf1KLvXXOHDyLDLHtRJVihA==","signatures":[{"sig":"MEUCIQChftxTyq7HgmsHcTgbEhkh/o5z0LJDgWg1muaU1+GRJwIgWmc5q7TE2z1qZxmBWse9BwgC+Co2C5BWQCyQMk0kjxc=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":158946},"main":"index.js","gitHead":"03b453229464f693cbf65871dba7a7493b4749db","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.22_1743125553537_0.371593649460076","host":"s3://npm-registry-packages-npm-production"}},"1.0.23":{"name":"longestrepeatedstrings","version":"1.0.23","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.23","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"f37f9686fb748ed68f64f2b81b69602805521900","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.23.tgz","fileCount":12,"integrity":"sha512-9K8sDJ0jCXOxxLgUIuljHxXPD9VHOuOuo5BjRi1zPOYJv67hhK2t5jeXkb20btTUMH/6Y206CJe1biiGoI0KXw==","signatures":[{"sig":"MEUCIHrufhKL4AmdUoua0RJloZpG8xNdleX8Z+VHGXeO3qlrAiEAqB6novDyt9IUNW5UaxEBah1A2T+QiR8pKHQ3zCB+u6k=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":159081},"main":"index.js","gitHead":"b73e4aee6a71edfc247bf5ec285d01ab0e579500","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.23_1743135741264_0.36321612824173277","host":"s3://npm-registry-packages-npm-production"}},"1.0.24":{"name":"longestrepeatedstrings","version":"1.0.24","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.24","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"debeb79085961d9d618b324d461351dcf68a3b00","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.24.tgz","fileCount":12,"integrity":"sha512-GieHCgcJ1BcvrUlnMzXAXGvIIx33RSOgruu+Tawd+z/rgKBDw7BdfWnv22u0tqM07Gkfb3Fn8QSHto02PlmggQ==","signatures":[{"sig":"MEUCICW0DXj6bVFJevYss8Fy0R7bRowQjpH+Dc6iIKn7NfROAiEAthqnbtCNKJnzLBMVUeT5kAKRcuVT8AIiyLH9v16gONc=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":159354},"main":"index.js","gitHead":"b73e4aee6a71edfc247bf5ec285d01ab0e579500","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.24_1743135868285_0.4693181760767937","host":"s3://npm-registry-packages-npm-production"}},"1.0.25":{"name":"longestrepeatedstrings","version":"1.0.25","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.25","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"3f46d0759f9ec1b147cd895743d4f10222ce35a7","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.25.tgz","fileCount":12,"integrity":"sha512-vNKzm7BQ99c+CPb/d67CgUauJR2efJAJK56VEjr2rX75T6fO/wNahlkatccHeMD4uPGz/wrSIDT3EYP53Jdi2w==","signatures":[{"sig":"MEUCIBk7mkdy3yj5G3qu4toFJAMFvdoAVjm5yHetcBdYk8STAiEA8oay2GcHra5SqWjOEbLOC+sqTWjw79t/qJ3LT/WEObk=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":159395},"main":"index.js","gitHead":"fd86427a87502b974ae9cd2fd44b87a33e77377d","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.25_1743136524538_0.40030260862083655","host":"s3://npm-registry-packages-npm-production"}},"1.0.26":{"name":"longestrepeatedstrings","version":"1.0.26","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.26","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"8893699d3437746f9f809db308539b4f2043fb13","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.26.tgz","fileCount":12,"integrity":"sha512-X0NcG39Lj3ITC/ynnq6MZfc/9lOm9LL/balj782B7cHA6Js7rcD6Vh0Pd8xKcX2PSjuJC4sZ6O7urhIUYsaQdA==","signatures":[{"sig":"MEYCIQCUVlZBuZu2OEu+BYC0NURtNoY+AggOjWcKhnQKUakfJAIhAOSslmMmjbMxm6V8UkUF/K/RLKpf5buSfGD6X2lOwXUB","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":159639},"main":"index.js","gitHead":"31503780526709135193ad71bdd024519280d192","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.26_1743139899948_0.4613057640493001","host":"s3://npm-registry-packages-npm-production"}},"1.0.27":{"name":"longestrepeatedstrings","version":"1.0.27","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.27","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"2520d5510a659e2474db75a0c4eafc9f8e7b3b5d","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.27.tgz","fileCount":12,"integrity":"sha512-qn44Dh3fV1xOjz0ouIrW+8gov9WA7+iQRSavPILXK/rvChCtDtGtogziVywpwpcb+OGugHA+ywzBzsrVO+YpJw==","signatures":[{"sig":"MEUCIEoYlRnPzhKiHZYUcW4NBjzTR3ELhQhw0dLIo8Kts8wxAiEAvaKUGU/DNtbBLhMP9qL05IHgVS14+t/O7dBFzgUkeJw=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":159664},"main":"index.js","gitHead":"5961c0a0bcd4508a7395267ebf134db3b4f3ccc2","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.27_1743141448238_0.5864174610832413","host":"s3://npm-registry-packages-npm-production"}},"1.0.28":{"name":"longestrepeatedstrings","version":"1.0.28","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.28","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"8dcf9f450edc2626b65b86a9d64e60c88562d241","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.28.tgz","fileCount":12,"integrity":"sha512-yLs+hyd3FYcCr74FD92Cgh5PlItfH0AEILmEgmzSUWeAvHy43FnthtY3bUjKWc4e09tIpssAb0RJTemal459EA==","signatures":[{"sig":"MEQCIFaGdVEQ1E9L0e/DQ0hFxSkgCDsbQ5x+x31/YNRYj8NQAiA8RHhoRuF3n0IxVLse+gZrlYumjomY0DKyhqI/2BTySA==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":160326},"main":"index.js","gitHead":"d71cb57ab2688b3c5c929ad14ca720b9a60f1805","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.28_1743151143109_0.4467987448658488","host":"s3://npm-registry-packages-npm-production"}},"1.0.29":{"name":"longestrepeatedstrings","version":"1.0.29","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.29","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"dd3d9cd8a6abe20f8c9ab4b95a3b8bf4f83e42d1","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.29.tgz","fileCount":12,"integrity":"sha512-X4QmQii3GrQdJCNNlQXjT/+IyHony7duCHUPZEHKtbmkwX8shPpBJbrHl+xeS9a5yQxVQXHZc7VtVe3nw0LQJg==","signatures":[{"sig":"MEUCIQD+IAlZLxLihHvELXCrCrxpgtzwy60B6sC4WoB8ugtuJAIgA096knnjZJUNUvubWujq1sHtBaPdnnVE8EvZEeiqWnk=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":161240},"main":"index.js","gitHead":"d76f87c078058dc98e892b9d4d7889f61f452032","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.29_1743214346408_0.68391368244427","host":"s3://npm-registry-packages-npm-production"}},"1.0.30":{"name":"longestrepeatedstrings","version":"1.0.30","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.30","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"dbbd4f546ea32820fad33c47b8deb9f36e232802","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.30.tgz","fileCount":12,"integrity":"sha512-N7KK2s+nEy/UdmI5yzpV73s/ZatYsUCiBZ1uop4/S39i9W0SkUuh6+XI928cz/9cxLrOcSa7TEr2HjZ3FmVOHA==","signatures":[{"sig":"MEYCIQDoz33vWvU6ocCwUJiyh6/dk/mmMJsBg3RzAM8zJTLPNAIhAMC10/YJ7RB20/qwPaEApWlGlJnEVoECyYPWHD1eQGLE","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":161357},"main":"index.js","gitHead":"928156456280a2e6b3ed7fde216e184faff09b6c","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.30_1743222198256_0.1830660667208508","host":"s3://npm-registry-packages-npm-production"}},"1.0.31":{"name":"longestrepeatedstrings","version":"1.0.31","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.31","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"e181b158d672510100bc7b8c53459690024c7006","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.31.tgz","fileCount":12,"integrity":"sha512-BD26/4CZv7SC4i3FMScW7Gn+Yr0sst9ZJYHKxIWi4LjA+EeQjZgamxPTdlp3akr4nYuz2p+XVpIaVGtfYeqHLg==","signatures":[{"sig":"MEQCIArROni5ZD2fT9I10wfaPsmNXheAZg1sdB2N9DxOmRXHAiBoyqXnBmUTOwGwA64XJYifW/p2uE4nlJ65Nbe2m46U3g==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163729},"main":"index.js","gitHead":"497e736dccb958bd501c447d37b605b2c5781cf1","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.31_1743234513505_0.9845980795623339","host":"s3://npm-registry-packages-npm-production"}},"1.0.32":{"name":"longestrepeatedstrings","version":"1.0.32","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.32","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"399d95b1609b9d9aa4bd137973e480b66e198b5c","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.32.tgz","fileCount":12,"integrity":"sha512-9ZuV7TtDBIH/T7T38a54HcUNm8DSp1jbvdBwkLNVX76UkWmIdVWR9Mn02ECF2f/goZ8ExMpCfwpFMyX6IVE2uw==","signatures":[{"sig":"MEUCIQDsWU8k/ZFYtLAy0lWt4BVhs+HqYwkLwbAndBZ8ywzR+QIgaJnG7PEso5PcMO6R0Ej8h9KmVDOFG9diXmwy9ggDd5s=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163628},"main":"index.js","gitHead":"5895efc08306519da59866806c6c2c26275d2855","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.32_1743234833149_0.6082601450181071","host":"s3://npm-registry-packages-npm-production"}},"1.0.33":{"name":"longestrepeatedstrings","version":"1.0.33","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.33","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"a16309158a972f8ef51b4d767f3a5c02bb8b90b7","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.33.tgz","fileCount":12,"integrity":"sha512-8Dry+L01eD9pTF2pOP6DXSAfgB1ALFOYyYXpxdeOj7Oy0QYlbra32s5/OMFW7+qF2iP3zG4+PXIahNfiZ5ZWoA==","signatures":[{"sig":"MEUCIBW9GMYgiOv+oHdU9nB48h84mX4NOmhQPF3M5kx0+GF2AiEAwuuGuEdfnvQDqedxSeH2EpcWODL7GNssQN552TKCgaE=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163635},"main":"index.js","gitHead":"e7d7287f5057233f2acb0cd27921d9150b622899","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.33_1743235023818_0.6118123393088108","host":"s3://npm-registry-packages-npm-production"}},"1.0.34":{"name":"longestrepeatedstrings","version":"1.0.34","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.34","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"dd60d7084e65e558519e4946d9b5764f12ac1448","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.34.tgz","fileCount":12,"integrity":"sha512-XeJelmaPsGJrn40ecow6dmTfJqjnlc1OkH6rVXPiaWEF2RgVRLQuOpapIdANQf9neUH1SCDM6MGUCnsNVpoiTQ==","signatures":[{"sig":"MEUCIQDmEW/8Oi1SFo+ZamOzT+7Xa6kgLeTlkU+sFT1GCevOXwIgOoUhUQQ5/5L7bTP/rtt2IlOFMvj11KTKg3gckKbNp8c=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163714},"main":"index.js","gitHead":"a6430cb0f501fc19b057e5103fb0550b0c267ac6","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.34_1743235927552_0.1637731899525614","host":"s3://npm-registry-packages-npm-production"}},"1.0.35":{"name":"longestrepeatedstrings","version":"1.0.35","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.35","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"a66006ed3cc5e4c6e40bb87e326ce7ae405fee4b","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.35.tgz","fileCount":12,"integrity":"sha512-hb2WHwVaYqsrRK1vs8LnnEI18Bpn8kdjsTo0mAgOoq6qCghj+aFlZACkn7+t0MazeNe38FNAXda0EyKG1YTA0A==","signatures":[{"sig":"MEUCIQDkaf6d+TQavZTPinmQG3MVOKYiVZ/GVNw+s0+cZGN6oQIgV9WY3ZfncjDZruzFP69jZrFzWF4G2gypdR1zq/lpg/8=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163617},"main":"index.js","gitHead":"2d2645ea92067d82bb134b04d63328eb22bd2b48","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.35_1743240129608_0.006974723165262375","host":"s3://npm-registry-packages-npm-production"}},"1.0.36":{"name":"longestrepeatedstrings","version":"1.0.36","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.36","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"4466cfd16f8def7d8d1680d397b6903d87ad134b","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.36.tgz","fileCount":12,"integrity":"sha512-+qax4A5Z9Ro2BHBjLXk2VZcmTraVFBGXprzEpIcEnY0lB8MMRXS1VZeTZ8HmmYEmgf5AHxRziJL3WqFf3bEruQ==","signatures":[{"sig":"MEYCIQDAa9Z+V2/z0IvGPKxHP8Msz2HfL0qroHUo5TDqPffwjQIhAIcJ48wXattxdjDE4DDOpxUgUXjcxx/jhr1DDu3dMZQI","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163592},"main":"index.js","gitHead":"b43920db32745506b23fb4dad67622700e82cc74","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.36_1743240436038_0.9882361224894902","host":"s3://npm-registry-packages-npm-production"}},"1.0.37":{"name":"longestrepeatedstrings","version":"1.0.37","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.37","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"99d50715eb6c65abfbc9bb81cbbbc31babb7eaeb","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.37.tgz","fileCount":12,"integrity":"sha512-d7SsPUd9cBajueuseVfH9J75rHQiPFkvzF8GapECWrIVoOnQPaW+Bm7lL5uJSU+r38a1UXSrzDWka9MvOQxYtA==","signatures":[{"sig":"MEYCIQD7EZ2+KYxlpmNhBsv163A7tG3H4Eay4l/nVIXoHKhsagIhAP0ovf0EJT70Y8w24894/p7DeJmhVxRDQyRU2dgeW641","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163589},"main":"index.js","gitHead":"7988da8e2eb372b2a122ca4954f37145563ce6ec","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.37_1743293276537_0.02289603627165815","host":"s3://npm-registry-packages-npm-production"}},"1.0.38":{"name":"longestrepeatedstrings","version":"1.0.38","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.38","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"82eaf7e95823c5ea808617b10237283773837c34","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.38.tgz","fileCount":12,"integrity":"sha512-radj9Bek4G8vzVp3yV/HZdolt9MRFKmbKpRGCqF8gPB8gBV3aBYZVOg0zgi7BO8D/3tGiicrxA9RHQF6wrL78Q==","signatures":[{"sig":"MEYCIQDnUZvh1MOalhXjxC0hRlTLmPudkH1FizLO0/fZcJrTxQIhAOczNE9UQpS+1eXBmBFh5akM143uYVeNfwN/oeRebbor","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163589},"main":"index.js","gitHead":"f5f4c0ac15ebd06841d8e01b4e548e38721fba9d","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.38_1743296026887_0.8428687859429767","host":"s3://npm-registry-packages-npm-production"}},"1.0.39":{"name":"longestrepeatedstrings","version":"1.0.39","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.39","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"e2a10063ed7e77c77491ab1dae805b2272948656","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.39.tgz","fileCount":12,"integrity":"sha512-IukgVn99n4109HVDMBPL1rwF4+qsvZ0LkBHZj9L47ODBQmeZr3vIGnrRaXr6P+9QeDdDYKab7P4sV0T3bNlA3g==","signatures":[{"sig":"MEUCICVjk3qKew4E/tXnXjkaVAxW3XxW/T14dNOLGWyXh4WeAiEAhZ+mVPVBs4y5jZQaatzQOWjoxSx8jS0w9GOAvx2c0F0=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163597},"main":"index.js","gitHead":"680622c13ae7886235c858c6cd227cc6ea52207f","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.39_1743381345498_0.995298252476102","host":"s3://npm-registry-packages-npm-production"}},"1.0.40":{"name":"longestrepeatedstrings","version":"1.0.40","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","_id":"longestrepeatedstrings@1.0.40","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"dist":{"shasum":"330793da088a32b8f15cd399db522201e85d1709","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.40.tgz","fileCount":13,"integrity":"sha512-ytF0FuefhhHucZTDKlIx6GgexTFmz7RIRB00hs4eb3y7DP8mvClRZDoralQ0ZnVDvvwKfLsULE2LqhOq6EaT6w==","signatures":[{"sig":"MEYCIQDGrD1Jqg39olQ2JhAXkRDPdvkQYyuRQapnBSNam+2QIgIhAJ0LBifPSX7P4+vjCascUp1nX5zbtqADCreIhNSIAqKf","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":163814},"main":"index.js","gitHead":"50540db2242d0a6dc010f940c5014e109201f4a2","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"repository":{"url":"git+https://github.com/braksator/LongestRepeatedStrings.git","type":"git"},"_npmVersion":"10.8.2","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","directories":{},"_nodeVersion":"20.16.0","dependencies":{"fs":"^0.0.1-security"},"_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/longestrepeatedstrings_1.0.40_1743477584715_0.27836554808277136","host":"s3://npm-registry-packages-npm-production"}},"1.0.41":{"name":"longestrepeatedstrings","version":"1.0.41","description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","main":"index.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"author":{"name":"D.A. Braksator"},"license":"Unlicense","repository":{"type":"git","url":"git+https://github.com/braksator/LongestRepeatedStrings.git"},"dependencies":{"fs":"^0.0.1-security"},"_id":"longestrepeatedstrings@1.0.41","gitHead":"0b9e7dea4710129ed0b23a0b27bfe564f7a4234c","bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","_nodeVersion":"20.16.0","_npmVersion":"10.8.2","dist":{"integrity":"sha512-krLOSrPkw/UoZaBzWX8orUP3qQUd8EE0MyQ2ygT2EQvyHzt90LjWIv78fZjej5dxdkMdcPIoFkoGVMAbg3XTRg==","shasum":"5ed9b0e375fd255aca407303a93e32f3eead2369","tarball":"https://registry.npmjs.org/longestrepeatedstrings/-/longestrepeatedstrings-1.0.41.tgz","fileCount":13,"unpackedSize":163826,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEUCIQCzs1Pg9hW7Cm79U0yZIoD65JyqPTxtewuyTYpOJW8LRgIgQ9+r4gfmnKDjw5H1rfYKo57ydEEma/6rc1IOYBGKnUA="}]},"_npmUser":{"name":"braksator","email":"braksator@gmail.com"},"directories":{},"maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/longestrepeatedstrings_1.0.41_1761589542831_0.052271119649015985"},"_hasShrinkwrap":false}},"time":{"created":"2025-03-24T15:45:54.920Z","modified":"2025-10-27T18:25:43.335Z","1.0.0-a":"2025-03-24T15:45:55.190Z","1.0.1-a":"2025-03-25T02:40:42.596Z","1.0.1":"2025-03-25T06:04:46.099Z","1.0.2":"2025-03-25T12:15:42.857Z","1.0.3":"2025-03-25T17:53:17.872Z","1.0.4":"2025-03-25T18:01:26.326Z","1.0.5":"2025-03-26T03:52:33.005Z","1.0.6":"2025-03-26T04:30:40.958Z","1.0.7":"2025-03-26T04:36:18.512Z","1.0.8":"2025-03-26T04:42:57.689Z","1.0.10":"2025-03-26T06:29:21.915Z","1.0.13":"2025-03-27T07:13:51.709Z","1.0.14":"2025-03-27T07:16:38.390Z","1.0.15":"2025-03-27T07:22:57.320Z","1.0.16":"2025-03-27T10:09:21.339Z","1.0.17":"2025-03-27T11:27:39.658Z","1.0.18":"2025-03-27T11:33:31.617Z","1.0.19":"2025-03-27T20:21:09.177Z","1.0.20":"2025-03-27T20:27:30.228Z","1.0.21":"2025-03-27T23:09:02.358Z","1.0.22":"2025-03-28T01:32:33.731Z","1.0.23":"2025-03-28T04:22:21.550Z","1.0.24":"2025-03-28T04:24:28.593Z","1.0.25":"2025-03-28T04:35:24.790Z","1.0.26":"2025-03-28T05:31:40.342Z","1.0.27":"2025-03-28T05:57:28.467Z","1.0.28":"2025-03-28T08:39:03.292Z","1.0.29":"2025-03-29T02:12:26.732Z","1.0.30":"2025-03-29T04:23:18.518Z","1.0.31":"2025-03-29T07:48:33.743Z","1.0.32":"2025-03-29T07:53:53.491Z","1.0.33":"2025-03-29T07:57:04.117Z","1.0.34":"2025-03-29T08:12:07.876Z","1.0.35":"2025-03-29T09:22:09.826Z","1.0.36":"2025-03-29T09:27:16.237Z","1.0.37":"2025-03-30T00:07:56.800Z","1.0.38":"2025-03-30T00:53:47.118Z","1.0.39":"2025-03-31T00:35:45.755Z","1.0.40":"2025-04-01T03:19:44.925Z","1.0.41":"2025-10-27T18:25:43.110Z"},"bugs":{"url":"https://github.com/braksator/LongestRepeatedStrings/issues"},"author":{"name":"D.A. Braksator"},"license":"Unlicense","homepage":"https://github.com/braksator/LongestRepeatedStrings#readme","keywords":["longest","repeated","substring","string","strings","substrings","duplicate","duplicated","text","find","finder","words","code"],"repository":{"type":"git","url":"git+https://github.com/braksator/LongestRepeatedStrings.git"},"description":"Finds duplicated text strings and generates a report about the longest substrings or most frequent words in supplied text","maintainers":[{"name":"braksator","email":"braksator@gmail.com"}],"readme":"[![npm](https://img.shields.io/npm/dt/longestrepeatedstrings.svg)](#)\r\n\r\nLongest Repeated Strings\r\n========================\r\n\r\nFinds ***duplicated text*** and generates a report about the ***longest substrings*** or\r\n***most frequent words*** in supplied text, weighted by how much space the string\r\ntakes up overall (length * occurences).\r\n\r\n> You supply input text or files.  It returns raw data or a text report.\r\n\r\n🧵 [Try an online demo](http://braksator.github.io/lrs)\r\n\r\n(This module was designed to analyze javascript code for refactoring opportunities in a Gulp task)\r\n\r\n## Stand-alone usage\r\n\r\nSee online demo link above, or [download project zip file](https://github.com/braksator/LongestRepeatedStrings/releases/) and open index.html to use the GUI.\r\n\r\n## Installation\r\n\r\nThis is a Node.JS module available from the Node Package Manager (NPM).\r\n\r\nhttps://www.npmjs.com/package/longestrepeatedstrings\r\n\r\nHere's the command to download and install from NPM:\r\n\r\n`npm install longestrepeatedstrings -S`\r\n\r\nor with Yarn:\r\n\r\n`yarn add longestrepeatedstrings`\r\n\r\n## Usage\r\n\r\nInclude Longest Repeated Strings in your project:\r\n\r\n```javascript\r\nvar LRS = require('longestrepeatedstrings');\r\n```\r\n\r\n### Finding Repeated Substrings in Text\r\n\r\nYou can analyze a single text by using the `text` function to find the longest repeated substrings:\r\n\r\n```javascript\r\nconst text = 'Your text content goes here';\r\nconst results = LRS.text(text, { maxRes: 20, minLen: 8 });\r\nconsole.log(results);\r\n```\r\n\r\n**Parameters**:\r\n- `text` (String): The input text to analyze.\r\n- `opts` (Object, optional): A configuration object with the following properties:\r\n  - `maxRes` (Number, default: 50): The maximum number of results to return.\r\n  Restricts the final list to highest scoring results and does not speed up processing.\r\n  - `minLen` (Number, default: `4`): The minimum length of substrings to consider.\r\n  - `maxLen` (Number, default: `40`): The maximum length of substrings to consider.\r\n  - `minOcc` (Number, default: `2`): The minimum number of occurrences a substring must have to be included.\r\n  - `penalty` (Number, default: `0`): Per-occurence score penalty, helps order results for deduplication.\r\n  - `split` (Array, default: `[' ', ',', '.', '\\n']`): Splits input after specified strings.  If not using the `words` and `clean`\r\n  options, settings THIS up properly for expected input will be key to making this module effective.\r\n  - `break` (Array, default: `[]`): Splits input ON these strings and won't include them in matches.\r\n  Can be used to concatenate an array of texts with a special char.\r\n  - `escSafe` (Boolean, default: `true`): Will take extra care around escaped characters.  May as well leave this on.\r\n  - `words` (Boolean, default: `true`): If `true`, matches only whole words.\r\n  - `clean` (Boolean, default: `false`): If `true`, strips all symbols from input.\r\n  - `trim` (Boolean, default: `true`): If `true`, trims white space from results.\r\n  - `omit` (Array, default: `[]`): An array of substrings to omit from the results. Can be used to ignore accepted long/frequent words.\r\n  as `minLen`, for example, will cause longer substrings to appear earlier in the results.  Negative penalty will favor more frequent substrings.\r\n\r\n**Returns**: An array of objects containing the repeated substrings, their count, and a score for each.\r\n\r\n### Analyzing Files\r\n\r\nYou can analyze multiple files by using the `files` function. This will read the contents of the files and find repeated substrings in each one.\r\n\r\n```javascript\r\nconst fs = require('fs');\r\nconst files = ['file1.txt', 'file2.txt'];\r\nconst results = LRS.files(files, opts);\r\nconsole.log(results);\r\n```\r\n\r\n**Parameters**:\r\n- `files` (Array): An array of file paths to analyze.\r\n- `opts` (Object, optional): Same options as in the `text` function.\r\n\r\n**Returns**: An object where the keys are file names and the values are the repeated substrings found in each file.\r\n\r\n### Creating Reports\r\n\r\n#### File Analysis Report\r\n\r\n```javascript\r\nconst report = LRS.filesReport(results, 1); // Pass `1` to log to console\r\nconsole.log(report);\r\n```\r\n\r\n**Parameters**:\r\n- `results` (Object): The results returned by the `files` function.\r\n- `out` (Number, optional, default: `0`): If set to `1`, the report will be logged to the console too.\r\n- `chars` (Object, optional): A configuration object with the following properties:\r\n  - `delim` (String, default: '★'): Character/s to insert between each result.\r\n  - `open` (String, default: '⦅'): Character/s to insert before the repeat count.\r\n  - `close` (String, default: '×⦆'): Character/s to insert after the repeat count.\r\n\r\n**Returns**: A text report summarizing the repeated substrings found in each file.\r\n\r\n#### Text Analysis Report\r\n\r\n```javascript\r\nconst report = LRS.textReport(results, 1); // Pass `1` to log to console\r\nconsole.log(report);\r\n```\r\n\r\n**Parameters**:\r\n- `results` (Array): The results returned by the `text` function.\r\n- `out` (Number, optional, default: `0`): If set to `1`, the report will be logged to the console too.\r\n- `chars` (Object, optional): Same options as in the `filesReport` function.\r\n\r\n**Returns**: A list of repeated substrings with their occurrence counts.\r\n\r\n### Example Workflow\r\n\r\n1. Either, analyze a single text or multiple files:\r\n   ```javascript\r\n   const text = 'This is an example text with repeated substrings';\r\n   const results = LRS.text(text);\r\n   ```\r\n   or\r\n   ```javascript\r\n   const files = ['file1.txt', 'file2.txt'];\r\n   const results = LRS.files(files);\r\n   ```\r\n2. Afterward, generate a report:\r\n   ```javascript\r\n   const report = LRS.filesReport(results, 1); // Logs the report to console\r\n   ```\r\n\r\n### Notes\r\n\r\n- Results are sorted by a score, which is calculated based on the length of the substring and the number of occurrences.\r\n- This package is used in [JCrush](https://www.npmjs.com/package/jcrush); a Javascript code deduplicator.\r\n\r\n## Gulp usage\r\n\r\n\r\nIn your `gulpfile.mjs`, use **Longest Repeated Strings** as a Gulp plugin:\r\n\r\n#### Step 1: Import **Longest Repeated Strings**\r\n\r\n```javascript\r\nimport LRS from 'longestrepeatedstrings';\r\n```\r\n\r\n#### Step 2: Create a Gulp Task for Longest Repeated Strings\r\n\r\n```javascript\r\nvar analyzeStrings = true;\r\ngulp.task('analyze', function (done) {\r\n  if (analyzeStrings) {\r\n    LRS.filesReport(LRS.files(['./script.min.js', './styles.min.css', './index.html'], {\r\n      clean: 1, words: 1,\r\n      omit: [\r\n        // This is a list of words that we just accept we've used a lot in the\r\n        // content, and we don't need to see them appear in repeated-strings\r\n        // reports. (supply all with lower-case)\r\n        'consciousness', 'enlightenment', 'ephemeral', 'watching', 'observing',\r\n        'communication', 'inspiring', 'realizing', 'uplifting', 'illusion',\r\n      ],\r\n    }), 1, {delim: \", \"});\r\n    analyzeStrings = false;\r\n  }\r\n  setTimeout(() => {analyzeStrings = true}, 1000 * 60 * 60); // Only run once an hour.\r\n  done(); // Signal completion\r\n});\r\n```\r\n\r\n#### Step 3: Run **Longest Repeated Strings** After Minification\r\n\r\nTo run **Longest Repeated Strings** after your minification tasks, add Longest Repeated Strings in series after other tasks, such as in this example:\r\n\r\n```javascript\r\ngulp.task('default', gulp.series(\r\n  gulp.parallel('minify-css', 'minify-js', 'minify-html'), // Run your minification tasks first\r\n  'analyze' // Then run LRS\r\n));\r\n```\r\n\r\n\r\n## Contributing\r\n\r\nhttps://github.com/braksator/LongestRepeatedStrings\r\n\r\nIn lieu of a formal style guide, take care to maintain the existing coding\r\nstyle.","readmeFilename":"README.md"}