Skip to content
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

Test startegy #11

Open
darkl opened this issue Feb 2, 2015 · 1 comment
Open

Test startegy #11

darkl opened this issue Feb 2, 2015 · 1 comment
Labels

Comments

@darkl
Copy link
Member

darkl commented Feb 2, 2015

Ok - we have a slow implementation of the GraphClimber (no Reflection.Emit/Expressions here).

This allows us to play with the api (and apply changes to it), and also allows us to do a bit TDD: we can write integration tests for the SlowGraphClimber. After that, when we implement the real GraphClimber, we run the tests and find bugs.

Since GraphClimber can only be tested by integration tests, I suggest we write some simple processors and check that they behave correctly. Some processors include: finding all paths in an object with a null value, extracting all strings of an object, some simple serializer/deserializer and etc.

I'd like hear about other ideas for processors/tests.

@darkl darkl added the question label Feb 2, 2015
@shanielh
Copy link
Contributor

shanielh commented Feb 2, 2015

One more processor we can write is object size.

About the tests, Integration tests sound fine because it's nice to compare implementations (reflection vs expression/IL based GC). But I would like to TDD the expression/IL based GC.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

2 participants