-
Notifications
You must be signed in to change notification settings - Fork 120
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Randomly Shuffling Access Ordering of Graphs #439
Comments
This is a great idea - as long as we can always reproduce test cases by using the same seed. Fuzzing is a great way to ensure robust coverage and functionality. |
Yep, technically using the same seed is a precise and efficient way. |
Good Idea! |
@edogawashinichi this must be what you're referring to in #433 I hope it's not too much to ask but would you please create a draft PR? would love to learn how to implement this |
Sure, I just implement a very rough test branch that help trace bugs caused by ordering. |
Is your feature request related to a problem? Please describe.
issue433
issue408
Bug-free code is rare in medium and large projects.
Therefore, test coverage is extremely important.
Due to differences in operating systems, compilers, etc.,
the access order of graphs in test cases may also differ,
which may cause test cases to behave differently.
Describe the solution you'd like
By randomly shuffling the access order of the graph,
we can easily obtain a large number of equivalent test cases,
allowing us to find hidden bugs as much as possible.
So I propose to add a test class between the test case and the graph class to allow random access.
Describe alternatives you've considered
Open a test branch,and add this feature to it.
Additional context
Add any other context or screenshots about the feature request here.
The text was updated successfully, but these errors were encountered: