dtree

чување 5764cf7ae1da728031f46a86190c529a7cfe9f73
родитељ 5522517e68e9f86678654c6de9c91b086736f0cd
Аутор: Страхиња Радић <sr@strahinja.org>
Датум:   Wed, 10 Jul 2024 00:29:55 +0200

Update TODO{,.done}

Diffstat:
M
TODO
 | 
12
+-----------
A
TODO.done
 | 
18
++++++++++++++++++

измењених датотека: 2, додавања: 19(+), брисања: 11(-)
diff --git a/TODO b/TODO
@@ -1,14 +1,4 @@
 TODO
 ====
 
-[x] Fix SEGV
-	- It seems that free(root) after free_node(&root) does this
-
-[/] Check if everything can be done without reading the entire input and without
-    actual structs; indent seems like it can be enough for that
-	- Unfortunately, I don't see any other way to have a distinction between
-	  '`' and '+' besides having two passes, one for reading the input and
-	  the other for output, because there needs to be a way to know when a
-	  group of node's children ends. (Maybe with seek/rewind, but that can't
-	  be done for stdin, so the code would need to account for both cases.)
-	- Now looking at tree(1)'s source, it also creates a tree in memory.
+[ ] Check if argument is a file or something else
diff --git a/TODO.done b/TODO.done
@@ -0,0 +1,18 @@
+Done TODOs
+==========
+
+[x] Fix SEGV
+	- It seems that free(root) after free_node(&root) does this
+
+[/] Check if everything can be done without reading the entire input 
+    and without actual structs; indent seems like it can be enough for 
+    that
+	- Unfortunately, I don't see any other way to have a 
+	  distinction between '`' and '+' besides having two passes, 
+	  one for reading the input and the other for output, because 
+	  there needs to be a way to know when a group of node's 
+	  children ends. (Maybe with seek/rewind, but that can't be 
+	  done for stdin, so the code would need to account for both 
+	  cases.)
+	- Now looking at tree(1)'s source, it also creates a tree in 
+	  memory.