-
Notifications
You must be signed in to change notification settings - Fork 508
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
feature(prost-build): Generate less boxed if nested type is boxed manually #1160
base: master
Are you sure you want to change the base?
Conversation
7c5c10d
to
eecd233
Compare
eecd233
to
13f0b78
Compare
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.
That is an interesting problem to fix.
- Is
nested
the correct term to use? I would use recursive, but I am not proficient in graph theory. - I would like user documentation about how this works.
- This is a breaking change, so it has to wait for the next breaking release.
@@ -154,3 +165,108 @@ impl MessageGraph { | |||
} | |||
} | |||
} | |||
|
|||
/// Check two nodes is connected with edge filter | |||
fn is_connected_with_edge_filter<F, N, E>( |
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.
This is very nifty, but it is not the core strength of prost
. I understand what the function is supposed to do, but I don't understand how it works. This should either be documented better or move to petgraph
library.
|
||
package nesting_complex; | ||
|
||
// ----- Directly nested |
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.
I would like to have more documentation explaining how this structure is nested.
Address #1157 (comment)
This branch is based on #1157.