-
-
Notifications
You must be signed in to change notification settings - Fork 2
Type complexity algorithm #34
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
Conversation
… for every type of node
…h handling the nuance of a different AST node.
| } | ||
|
|
||
| /** | ||
| * There are numorous ways to get the ip address off of the request object. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Great catch on this. This came up while writing tests but I never created an issue for it. It will be a good post mvp discussion. Created #47
shalarewicz
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Really great work and gives us solid groundwork for expanding.
Revsoled weight function conflict in complexity algo

Summary
This is a functioning type complexity analysis algorithm that passes tests up to and including
with aliases. The algorithm traverses the query AST which is a bunch of nested nodes of different graphQL types. The algorithm implements a different function for each AST Node Type so that the algorithm is modular and easily extendable. To add new functionality, create a new function to handle the GraphQL Node that holds the responsibility for that functionality.Still to do
Type of Change
Issues
Evidence