Check off roadmap

editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs

@@ -104,10 +104,10 @@ impl MessageHandler<GraphOperationMessage, GraphOperationMessageData<'_>> for Gr
 				}
 			}
 			GraphOperationMessage::MoveUpstreamSiblingsToChild { new_parent, mut upstream_sibling_ids } => {
-				//Start with the furthest upstream node, move it as a child of the new folder, and continue downstream for each layer in vec
+				// Start with the furthest upstream node, move it as a child of the new folder, and continue downstream for each layer in vec
 				upstream_sibling_ids.reverse();
 				for node_to_move in upstream_sibling_ids.clone() {
-					//Connect pre node to post node, or disconnect pre node if post node doesn't exist
+					// Connect pre node to post node, or disconnect pre node if post node doesn't exist
 					let mut pre_node_id = new_parent;
 					loop {
 						let Some(NodeInput::Node { node_id, .. }) = document_network.nodes.get(&pre_node_id).expect("Current node should always exist").inputs.get(0) else {
@@ -137,9 +137,9 @@ impl MessageHandler<GraphOperationMessage, GraphOperationMessageData<'_>> for Gr
 						return;
 					};
 
-					//Insert upstream_sibling_node at top of group stack
+					// Insert upstream_sibling_node at top of group stack
 					if let NodeInput::Node { node_id, .. } = parent_secondary_input {
-						//If there is already a node at the top of the stack, insert upstream_sibling_node in between
+						// If there is already a node at the top of the stack, insert upstream_sibling_node in between
 						let current_child = *node_id;
 						let Some(upstream_sibling_input) = document_network.nodes.get_mut(&node_to_move).expect("Upstream sibling should always exist").inputs.get_mut(0) else {
 							log::error!("Could not get upstream sibling node input");

editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs

@@ -164,7 +164,7 @@ impl<'a> MessageHandler<NodeGraphMessage, NodeGraphHandlerData<'a>> for NodeGrap
 						// that do not feed into the delete_nodes set or the output node will be deleted.
 						let mut stack = vec![upstream_id];
 						let mut can_delete = true;
-						//TODO: Add iteration limit to force break in case of infinite while loop
+						// TODO: Add iteration limit to force break in case of infinite while loop
 						while let Some(current_node) = stack.pop() {
 							if let Some(downstream_nodes) = outward_links.get(&current_node) {
 								for downstream_node in downstream_nodes {
@@ -414,7 +414,7 @@ impl<'a> MessageHandler<NodeGraphMessage, NodeGraphHandlerData<'a>> for NodeGrap
 						node.metadata.position += IVec2::new(displacement_x, displacement_y)
 					}
 				}
-				//Since document structure doesn't change, just update the nodes
+				// Since document structure doesn't change, just update the nodes
 				if graph_view_overlay_open {
 					let links = Self::collect_links(network);
 					let nodes = self.collect_nodes(&links, network);
@@ -1022,7 +1022,7 @@ impl NodeGraphMessageHandler {
 	fn send_graph(&self, network: &NodeNetwork, graph_open: bool, metadata: &mut DocumentMetadata, selected_nodes: &mut SelectedNodes, collapsed: &CollapsedLayers, responses: &mut VecDeque<Message>) {
 		responses.add(DocumentMessage::DocumentStructureChanged);
 		responses.add(PropertiesPanelMessage::Refresh);
-		//TODO: Move update_layer_panel into message so load structure here can be removed, since load structure is already called in DocumentStructureChanged
+		// TODO: Move update_layer_panel into message so load structure here can be removed, since load structure is already called in DocumentStructureChanged
 		metadata.load_structure(network, selected_nodes);
 		Self::update_layer_panel(network, metadata, collapsed, responses);
 		if graph_open {
@@ -1152,7 +1152,7 @@ impl NodeGraphMessageHandler {
 		let input_count = node_input_count + exposed_value_count;
 		let Some(definition) = resolve_document_node_type(&node.name) else { return false };
 		let output_count = definition.outputs.len();
-		//TODO: Eventually allow nodes at the bottom of a stack to be layers, where `input_count` is 0
+		// TODO: Eventually allow nodes at the bottom of a stack to be layers, where `input_count` is 0
 		if !node.has_primary_output || output_count != 1 || input_count == 0 || input_count > 2 {
 			return false;
 		}

website/content/features.md

@@ -113,7 +113,7 @@ Always on the bleeding edge and built to last— Graphite is written on a robust
 		<div class="informational ongoing heading" title="Began February 2024" data-year="2024">
 			<h3>— Alpha 3 —</h3>
 		</div>
-		<div class="informational ongoing" title="Development Ongoing">
+		<div class="informational complete" title="Development Complete">
 			<img class="atlas" style="--atlas-index: 3" src="https://static.graphite.rs/icons/icon-atlas-roadmap__2.png" alt="" />
 			<span>Stackable adjustment layers</span>
 		</div>