From a1f38bf77ba00f0f9ba41471a80a69fd4fa0586b Mon Sep 17 00:00:00 2001 From: mitchmindtree Date: Sat, 12 Dec 2015 11:04:03 +1100 Subject: [PATCH] Remove unnecessary reverse in depth_order creation now that we properly compare instantiation order in the following sort --- src/graph/depth_order.rs | 4 ---- 1 file changed, 4 deletions(-) diff --git a/src/graph/depth_order.rs b/src/graph/depth_order.rs index c9c476471..762abd57d 100644 --- a/src/graph/depth_order.rs +++ b/src/graph/depth_order.rs @@ -145,10 +145,6 @@ fn visit_by_depth(graph: &Graph, // node (perhaps in the `Container`). let mut child_sorter: Vec = graph.depth_children(idx).iter(&graph).nodes().collect(); - // Walking neighbors of a node in our graph returns then in the reverse order in which they - // were added. Reversing here will give more predictable render order behaviour i.e. widgets - // instantiated after other widgets will also be rendered after them by default. - child_sorter.reverse(); child_sorter.sort_by(|&a, &b| { use std::cmp::Ordering;