This week we are going to do a Kata to help us get better at TDD. Hopefully it takes you no more than an hour to do but be sure to follow the instructions because the goal is to do this exercise incrementally and learn how to do TDD. If you are a TDD expert I hope this will be fun for you.
###Task
- Don't read ahead
- Do one task at a time
- Only test for correct inputs. No need to try and test for invalid inputs for this kata.
###Steps
- Create a simple String calculator with a method int Add(string numbers)
- The method can take 0, 1 or 2 numbers, and will return their sum (for an empty string it will return 0) for example “” or “1” or “1,2”
- Start with the simplest test case of an empty string and move to 1 and two numbers
- Remember to solve things as simply as possible so that you force yourself to write tests you did not think about
- Remember to refactor after each passing test
- Allow the Add method to handle an unknown amount of numbers
- Allow the Add method to handle new lines between numbers (instead of commas).
- the following input is ok: “1\n2,3” (will equal 6)
- the following input is NOT ok: “1,\n” (not need to prove it - just clarifying)
- Support different delimiters
- to change a delimiter, the beginning of the string will contain a separate line that looks like this: “//[delimiter]\n[numbers…]” for example “//;\n1;2” should return three where the default delimiter is ‘;’ .
- the first line is optional. all existing scenarios should still be supported
- Calling Add with a negative number will throw an exception “negatives not allowed” - and the negative that was passed.if there are multiple negatives, show all of them in the exception message
###Bonus / Extra Credit 6. Numbers bigger than 1000 should be ignored, so adding 2 + 1001 = 2 7. Delimiters can be of any length with the following format: “//[delimiter]\n” for example: “//[]\n12*3” should return 6 8. Allow multiple delimiters like this: “//[delim1][delim2]\n” for example “//[][%]\n12%3” should return 6. 8. Make sure you can also handle multiple delimiters with length longer than one char
###Reference Thanks to Roy Osherove's website for this Code Kata. He has couple of katas on his website and I'm sure we'll use some more of them as we continue to code kata.
- Fork this github repository.
- Write your solution to the problem.
- Commit your solution to the repository.
- Post a link to your fork as a comment to this Prime Factors post on codekata.co.