summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBen Culkin <scorpress@gmail.com>2020-11-11 11:22:42 -0500
committerBen Culkin <scorpress@gmail.com>2020-11-11 11:22:42 -0500
commitc56a10f7c943dd9e9f04854395638babfaba6529 (patch)
tree87fe73268108bebc5d94e355f4eb50ac534d522b
parent6340caa7ec15be51c6d633a0519f3e0c76b25241 (diff)
Tweak some things
-rw-r--r--src/main/java/bjc/data/Tree.java6
1 files changed, 4 insertions, 2 deletions
diff --git a/src/main/java/bjc/data/Tree.java b/src/main/java/bjc/data/Tree.java
index 95f4d1e..83b33bd 100644
--- a/src/main/java/bjc/data/Tree.java
+++ b/src/main/java/bjc/data/Tree.java
@@ -28,8 +28,10 @@ public class Tree<ContainedType> implements ITree<ContainedType> {
/* Whether this node has children. */
/*
* @NOTE Why have both this boolean and childCount? Why not just do a childCount
- * == 0 whenever you'd check hasChildren? - Because hasChildren is set once and
- * not reset, and really what it indicates is that children has been allocated.
+ * == 0 whenever you'd check hasChildren?
+ *
+ * - Because hasChildren is set once and not reset, and really what it
+ * indicates is that children has been allocated.
*/
private boolean hasChildren;
/* The number of children this node has. */