/* By: ljiriste <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/06/21 09:51:43 by ljiriste #+# #+# */
-/* Updated: 2024/06/21 11:07:45 by ljiriste ### ########.fr */
+/* Updated: 2024/06/21 13:09:00 by ljiriste ### ########.fr */
/* */
/* ************************************************************************** */
#define MAX_WIDTH 80
-static void print_last_at_depth(t_parse_tree_node *node, size_t depth, char branches[MAX_WIDTH]);
-static void print_node_at_depth(t_parse_tree_node *node, size_t depth, char branches[MAX_WIDTH]);
+static void print_last_at_depth(t_parse_tree_node *node,
+ size_t depth, char branches[MAX_WIDTH]);
+static void print_node_at_depth(t_parse_tree_node *node,
+ size_t depth, char branches[MAX_WIDTH]);
-static void print_children_at_depth(t_parse_tree_node *node, size_t depth, char branches[MAX_WIDTH])
+static void print_children_at_depth(t_parse_tree_node *node,
+ size_t depth, char branches[MAX_WIDTH])
{
size_t i;
i = 0;
while (i + 1 < node->children.size)
{
- print_node_at_depth(ft_vec_access(&node->children, i), depth + 1, branches);
+ print_node_at_depth(ft_vec_access(&node->children, i),
+ depth + 1, branches);
++i;
}
if (i < node->children.size)
- print_last_at_depth(ft_vec_access(&node->children, i), depth + 1, branches);
+ print_last_at_depth(ft_vec_access(&node->children, i),
+ depth + 1, branches);
if (depth > 0)
branches[ft_strlen(branches) - 1] = '\0';
branches[ft_strlen(branches) - 1] = '\0';
return ;
}
-static void print_last_at_depth(t_parse_tree_node *node, size_t depth, char branches[MAX_WIDTH])
+static void print_last_at_depth(t_parse_tree_node *node,
+ size_t depth, char branches[MAX_WIDTH])
{
if (!node)
{
print_children_at_depth(node, depth, branches);
}
-static void print_node_at_depth(t_parse_tree_node *node, size_t depth, char branches[MAX_WIDTH])
+static void print_node_at_depth(t_parse_tree_node *node,
+ size_t depth, char branches[MAX_WIDTH])
{
if (!node)
{