Is there a standard approach for testing a function that takes a single parameter (and evals to true/false), but have a test that you feed it a list (or vector) of values to test? I have something like this:

(t/deftest test-palindromes
  (for [x palindromes]
     (t/is (= true (p/palindrome? x)))))

Feels a bit clunky. Ideally, i would like an indvidual test for each element in the vector (in this case, palindromes), but there could be a lot!

It feels like a job for generative testing...

can generative testing generate palindromes?

(I have about 20 words and a few sentences that are palindromes)

Generate random strings and append them, reversed, to themselves, and you have randomly generated palindromes. That will test cases involving empty strings and weird characters. You can also append them, reversed with the first character removed, to get odd-length palindromes.

The key property to test there is if you give your function random strings that are known to be palindromic, it will return true for all of them.

Good point!

Thanks for the insight 🙂

I'll have to go away now and look at how to do generative testing (which I saw briefly on my skim so far)

You could test for the false case by generating random strings and then filtering out those that start and end with the same character (strings need to be at least length 2).

great! thank you kindly! 🙂