Proposal: multiple mock matching #99
Merged
Conversation
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
|
@xneomac can you please rebase this branch? I merged your other PR into master and fixed both Travis and Appveyor. |
|
Any updates on this? I think this is a nice feature to have, certainly makes mocks more flexible to design. I would like to see this merged. I have forked and rebased the commit from @xneomac so I could use for my tests in the mean time (could't build the original fork as is). And it seams to work as intended. |
|
@Jonathas-Conceicao released with 0.25.0. Thanks for your effort and thanks to @xneomac for building the feature 🥇 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is an implementation proposal of the feature previously discussed in issue #97.
The idea is to detect if there is multiple mock matching the same request and calling them while the number of request expected is not reached. When it is reached we call the next one. If there is no more available we keep calling the last one.