Refactor type processing to use BFS traversal in Java codegen #3
Conversation
Replaced the iteration over all type graph nodes with a Breadth-First Search (BFS) traversal starting from the root type. This ensures that the root struct is generated first in the output file and that only reachable types are processed.
* Modified `codegen-java/src/lib.rs`:
* Imported `VecDeque` and `HashSet`.
* Implemented BFS loop with cycle detection.
* Updated logic to traverse into children of Object, Union, Array, and Optional types.
* Preserved root type name determination logic.
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
Replaced the iteration over all type graph nodes with a Breadth-First Search (BFS) traversal starting from the root type. This ensures that the root struct is generated first in the output file and that only reachable types are processed.
* Modified `codegen-java/src/lib.rs`:
* Imported `VecDeque` and `BTreeSet`.
* Implemented BFS loop with cycle detection using `BTreeSet` to avoid hash dependency.
* Updated logic to traverse into children of Object, Union, Array, and Optional types.
* Preserved root type name determination logic.
Refactor type processing to use BFS traversal in Java codegen
Replaced the iteration over all type graph nodes with a Breadth-First Search (BFS) traversal starting from the root type. This ensures that the root struct is generated first in the output file and that only reachable types are processed.
codegen-java/src/lib.rs:VecDequeandHashSet.PR created automatically by Jules for task 12599796746808077555 started by @zahash