Recursively create a tree in Rust Planned maintenance scheduled April 23, 2019 at 23:30UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?2D Convex hull exerciseSaving nested JSON to db, inferring order and record deletionBasic binary tree manipulation in RustSICP exercise 2.28 - counting leaves in a tree (recursive process)Binary Tree Implementation in RustAVL Tree implementation in RustNtree: a reimplementation of the tree utilityRed-black tree in RustAdvent of Code 2018 Day 13 - Detect mine cart collisionsTic Tac Toe game in Python 3.X using tkinter GUI version 2
What are the discoveries that have been possible with the rejection of positivism?
What order were files/directories output in dir?
Customizing QGIS plugins
Crossing US/Canada Border for less than 24 hours
Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?
Should a wizard buy fine inks every time he want to copy spells into his spellbook?
Strange behavior of Object.defineProperty() in JavaScript
Misunderstanding of Sylow theory
Is it fair for a professor to grade us on the possession of past papers?
Central Vacuuming: Is it worth it, and how does it compare to normal vacuuming?
How to pronounce 伝統色
Where is the Data Import Wizard Error Log
Is multiple magic items in one inherently imbalanced?
A term for a woman complaining about things/begging in a cute/childish way
Electrolysis of water: Which equations to use? (IB Chem)
What is the difference between a "ranged attack" and a "ranged weapon attack"?
How does Belgium enforce obligatory attendance in elections?
Why do early math courses focus on the cross sections of a cone and not on other 3D objects?
Random body shuffle every night—can we still function?
If Windows 7 doesn't support WSL, then what is "Subsystem for UNIX-based Applications"?
Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?
How often does castling occur in grandmaster games?
Induction Proof for Sequences
How would a mousetrap for use in space work?
Recursively create a tree in Rust
Planned maintenance scheduled April 23, 2019 at 23:30UTC (7:30pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?2D Convex hull exerciseSaving nested JSON to db, inferring order and record deletionBasic binary tree manipulation in RustSICP exercise 2.28 - counting leaves in a tree (recursive process)Binary Tree Implementation in RustAVL Tree implementation in RustNtree: a reimplementation of the tree utilityRed-black tree in RustAdvent of Code 2018 Day 13 - Detect mine cart collisionsTic Tac Toe game in Python 3.X using tkinter GUI version 2
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
This code is meant to take a rectangular area, and randomly divide it up into smaller rectangles in a binary tree.
I'm somewhat new to Rust.
I'm concerned mostly about the create_subrooms
function. I've tried lots of other permutations, but I can't find any more elegant way of writing this, and it still looks pretty ugly in my opinion.
Some specific questions I have:
- Would it be poor form to have the function take ownership of root, modify it and return it? This would mean I could create the tree in a single line instead of creating the Room, creating it's children and then explicitly assigning it to the left/right of it's parent
- Would I be better off having the function accept four size parameters, instead of creating the root Room beforehand and passing a reference? Or would that be too verbose?
This struct represents a node in the tree:
struct Room
x: u32,
y: u32,
end_x: u32,
end_y: u32,
left: Option<Rc<Room>>>,
right: Option<Rc<Room>>,
And this function takes a previously created root Room, and recursively generates its children:
fn create_subrooms(&mut self, root: &mut Room, depth: u32)
if depth < self.max_rec_depth && self.is_valid_size(root)
let mut left: Room;
let mut right: Room;
// Horizontal and Vertical are the direction along which, the
// rectangle is split, and the new boundaries are randomly chosen
// perpendicular to that
match rand::random::<Direction>()
Vertical =>
let cut = self.rng.gen_range(root.x, root.end_x);
// Not including the 'new' method for brevity,
// but it's form is (x, y, end_x, end_y)
// children are None by default
left = Room::new(root.x, root.y, cut, root.end_y);
right = Room::new(cut, root.y, root.end_x, root.end_y);
Horizontal =>
let cut = self.rng.gen_range(root.y, root.end_y);
left = Room::new(root.x, root.y, root.end_x, cut);
right = Room::new(root.x, cut, root.end_x, root.end_y);
;
self.create_subrooms(&mut left, depth + 1);
root.left = Some(Rc::new(left));
self.create_subrooms(&mut right, depth + 1);
root.right = Some(Rc::new(right));
The self
parameters are from a Builder struct which is used to customise how the area is divided.
beginner rust
New contributor
$endgroup$
add a comment |
$begingroup$
This code is meant to take a rectangular area, and randomly divide it up into smaller rectangles in a binary tree.
I'm somewhat new to Rust.
I'm concerned mostly about the create_subrooms
function. I've tried lots of other permutations, but I can't find any more elegant way of writing this, and it still looks pretty ugly in my opinion.
Some specific questions I have:
- Would it be poor form to have the function take ownership of root, modify it and return it? This would mean I could create the tree in a single line instead of creating the Room, creating it's children and then explicitly assigning it to the left/right of it's parent
- Would I be better off having the function accept four size parameters, instead of creating the root Room beforehand and passing a reference? Or would that be too verbose?
This struct represents a node in the tree:
struct Room
x: u32,
y: u32,
end_x: u32,
end_y: u32,
left: Option<Rc<Room>>>,
right: Option<Rc<Room>>,
And this function takes a previously created root Room, and recursively generates its children:
fn create_subrooms(&mut self, root: &mut Room, depth: u32)
if depth < self.max_rec_depth && self.is_valid_size(root)
let mut left: Room;
let mut right: Room;
// Horizontal and Vertical are the direction along which, the
// rectangle is split, and the new boundaries are randomly chosen
// perpendicular to that
match rand::random::<Direction>()
Vertical =>
let cut = self.rng.gen_range(root.x, root.end_x);
// Not including the 'new' method for brevity,
// but it's form is (x, y, end_x, end_y)
// children are None by default
left = Room::new(root.x, root.y, cut, root.end_y);
right = Room::new(cut, root.y, root.end_x, root.end_y);
Horizontal =>
let cut = self.rng.gen_range(root.y, root.end_y);
left = Room::new(root.x, root.y, root.end_x, cut);
right = Room::new(root.x, cut, root.end_x, root.end_y);
;
self.create_subrooms(&mut left, depth + 1);
root.left = Some(Rc::new(left));
self.create_subrooms(&mut right, depth + 1);
root.right = Some(Rc::new(right));
The self
parameters are from a Builder struct which is used to customise how the area is divided.
beginner rust
New contributor
$endgroup$
add a comment |
$begingroup$
This code is meant to take a rectangular area, and randomly divide it up into smaller rectangles in a binary tree.
I'm somewhat new to Rust.
I'm concerned mostly about the create_subrooms
function. I've tried lots of other permutations, but I can't find any more elegant way of writing this, and it still looks pretty ugly in my opinion.
Some specific questions I have:
- Would it be poor form to have the function take ownership of root, modify it and return it? This would mean I could create the tree in a single line instead of creating the Room, creating it's children and then explicitly assigning it to the left/right of it's parent
- Would I be better off having the function accept four size parameters, instead of creating the root Room beforehand and passing a reference? Or would that be too verbose?
This struct represents a node in the tree:
struct Room
x: u32,
y: u32,
end_x: u32,
end_y: u32,
left: Option<Rc<Room>>>,
right: Option<Rc<Room>>,
And this function takes a previously created root Room, and recursively generates its children:
fn create_subrooms(&mut self, root: &mut Room, depth: u32)
if depth < self.max_rec_depth && self.is_valid_size(root)
let mut left: Room;
let mut right: Room;
// Horizontal and Vertical are the direction along which, the
// rectangle is split, and the new boundaries are randomly chosen
// perpendicular to that
match rand::random::<Direction>()
Vertical =>
let cut = self.rng.gen_range(root.x, root.end_x);
// Not including the 'new' method for brevity,
// but it's form is (x, y, end_x, end_y)
// children are None by default
left = Room::new(root.x, root.y, cut, root.end_y);
right = Room::new(cut, root.y, root.end_x, root.end_y);
Horizontal =>
let cut = self.rng.gen_range(root.y, root.end_y);
left = Room::new(root.x, root.y, root.end_x, cut);
right = Room::new(root.x, cut, root.end_x, root.end_y);
;
self.create_subrooms(&mut left, depth + 1);
root.left = Some(Rc::new(left));
self.create_subrooms(&mut right, depth + 1);
root.right = Some(Rc::new(right));
The self
parameters are from a Builder struct which is used to customise how the area is divided.
beginner rust
New contributor
$endgroup$
This code is meant to take a rectangular area, and randomly divide it up into smaller rectangles in a binary tree.
I'm somewhat new to Rust.
I'm concerned mostly about the create_subrooms
function. I've tried lots of other permutations, but I can't find any more elegant way of writing this, and it still looks pretty ugly in my opinion.
Some specific questions I have:
- Would it be poor form to have the function take ownership of root, modify it and return it? This would mean I could create the tree in a single line instead of creating the Room, creating it's children and then explicitly assigning it to the left/right of it's parent
- Would I be better off having the function accept four size parameters, instead of creating the root Room beforehand and passing a reference? Or would that be too verbose?
This struct represents a node in the tree:
struct Room
x: u32,
y: u32,
end_x: u32,
end_y: u32,
left: Option<Rc<Room>>>,
right: Option<Rc<Room>>,
And this function takes a previously created root Room, and recursively generates its children:
fn create_subrooms(&mut self, root: &mut Room, depth: u32)
if depth < self.max_rec_depth && self.is_valid_size(root)
let mut left: Room;
let mut right: Room;
// Horizontal and Vertical are the direction along which, the
// rectangle is split, and the new boundaries are randomly chosen
// perpendicular to that
match rand::random::<Direction>()
Vertical =>
let cut = self.rng.gen_range(root.x, root.end_x);
// Not including the 'new' method for brevity,
// but it's form is (x, y, end_x, end_y)
// children are None by default
left = Room::new(root.x, root.y, cut, root.end_y);
right = Room::new(cut, root.y, root.end_x, root.end_y);
Horizontal =>
let cut = self.rng.gen_range(root.y, root.end_y);
left = Room::new(root.x, root.y, root.end_x, cut);
right = Room::new(root.x, cut, root.end_x, root.end_y);
;
self.create_subrooms(&mut left, depth + 1);
root.left = Some(Rc::new(left));
self.create_subrooms(&mut right, depth + 1);
root.right = Some(Rc::new(right));
The self
parameters are from a Builder struct which is used to customise how the area is divided.
beginner rust
beginner rust
New contributor
New contributor
New contributor
asked 12 mins ago
JMacJMac
1
1
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
JMac is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217757%2frecursively-create-a-tree-in-rust%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
JMac is a new contributor. Be nice, and check out our Code of Conduct.
JMac is a new contributor. Be nice, and check out our Code of Conduct.
JMac is a new contributor. Be nice, and check out our Code of Conduct.
JMac is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217757%2frecursively-create-a-tree-in-rust%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown