forked from divigrupa/FooBarQixExtended
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Changed weeks to steps and fixed grammar errors. Only step4 was ident…
…ified as renamed/modified.
- Loading branch information
1 parent
1e1c9e4
commit 5d8b18b
Showing
8 changed files
with
79 additions
and
81 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,27 @@ | ||
|
||
Here is "Step 2" : | ||
You made it in time, thanks! | ||
Clients have a good use of it, but are unhappy as Qix is missing! | ||
In the rush we forgot to give you **a last rule in bold**. | ||
|
||
It will take a number (positive integer) and provide: | ||
- "Foo" if this number is multiple of 3 | ||
- "Bar" if this number is multiple of 5 | ||
- **"Qix" if this number is multiple of 7** | ||
|
||
If number have several multiples, they appear in natural order (Foo, Bar, Qix). | ||
|
||
We will return the given number as a string if there is no transformation to do. | ||
|
||
Easy right! | ||
Hum. | ||
Right? | ||
Hum, hum. | ||
|
||
Now we are making money with satisfied customers! | ||
As with all successful software, people use it and trust you to them more with it! | ||
Did you notice, the more successful a software is, the more evolutions it has to implement? | ||
We do as TDD helps deploying "almost bug free" software by implementing the features right. | ||
*Note that BDD helps us to implement the right feature !* | ||
|
||
Let's go to next step, the [sttep 3](./step_3.md), where real problems begins. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,32 @@ | ||
Here is "Step 3": | ||
With the money we earned, we are able to go on with our product, so keep up the good work! | ||
|
||
We need to keep all previous functionalities, this is mandatory for our reputation! | ||
|
||
So we need to keep previous rules for our API: | ||
It will take a number (positive integer) and provide: | ||
- "Foo" if this number is multiple of 3 | ||
- "Bar" if this number is multiple of 5 | ||
- "Qix" if this number is multiple of 7 | ||
|
||
If number have several multiples, they appear in natural order (Foo, Bar, Qix). | ||
|
||
We will return the given number as a string if there is no transformation **at all** (not in the old rules, nor in the new rules) to do. | ||
|
||
The new rules are : | ||
If the given number contains specific digit, we will append a word to the transformation in the order they appear in the number. | ||
So if a number contains : | ||
- 3, then we append "Foo" | ||
- 5, then we append "Bar" | ||
- 7, then we append "Qix" | ||
|
||
So we may have multiples followed by occurrences. | ||
|
||
Here, you have to add test for the new functionality and add some to test numbers that triggers both functionality in order to know if they work well together. | ||
You have two main options to do that : | ||
1. Update existing tests with cases that trigger only the multiples, and add tests that triggers only occurrences (then ones that triggers both). | ||
2. Update existing tests to call new services or package visible's methods : one dedicated to multiples, the other to occurrences, and original service will call both of them to integrate them (without regressions, of course). | ||
|
||
Let's go to next step, the [step 4](./step_4.md) will be something new. | ||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,10 @@ | ||
Here is "Step 5" (the last one) : | ||
|
||
We need to update InfQixFoo with new functionality and keep all previous functionalities. | ||
|
||
**If sum of all digits is multiple of 8, we will append “Inf” at the very and of response, e.g. (Inf; Qix; FooInf)** | ||
|
||
|
||
|
||
Now it's time for your pull request! | ||
|