Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Ben Bacarisse Newsgroups: comp.programming Subject: Re: Collection of strings available? Date: Sun, 21 Oct 2018 21:54:58 +0100 Organization: A noiseless patient Spider Lines: 16 Message-ID: <871s8jaul9.fsf@bsb.me.uk> References: <6ae449fc-a10c-44c0-8fd0-7243c4308687@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="36c69285fc7c7932b20a5e9b27245ac4"; logging-data="2680"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+DCgm3aMNY7Jc+wbuObl2GkM3xbEtwi+A=" Cancel-Lock: sha1:WjUEh5K8sVWJKdz1rXxJ8qgWFt0= sha1:djiV/p8sLe/92cZp9JFNt604ieA= X-BSB-Auth: 1.9c331900f5b7e127c732.20181021215458BST.871s8jaul9.fsf@bsb.me.uk Xref: csiph.com comp.programming:9331 Paul writes: > As a coding exercise, I am writing a collection of string-matching > algorithms -- for example Boyer Moore, Rabin-Karp etc. > > Does anyone know a handy collection of string patterns and texts to facilitate > testing or do I need to generate the test data myself? A handy source of large(ish) texts is Project Gutenberg. If you need larger (which you might for speed tests on a modern machine) you can concatenate several books or collected works together. You'll still have to generate test cases yourself. -- Ben.