Refactor docstrings

Author: MilesCranmer

src/Equation.jl

@@ -79,39 +79,18 @@ nodes, you can evaluate or print a given expression.
 
 # Constructors
 
-## Leafs
 
-    Node(; val=nothing, feature::Union{Integer,Nothing}=nothing)
-    Node{T}(; val=nothing, feature::Union{Integer,Nothing}=nothing) where {T}
+    Node([T]; val=nothing, feature=nothing, op=nothing, l=nothing, r=nothing, allocator=default_allocator)
+    Node{T}(; val=nothing, feature=nothing, op=nothing, l=nothing, r=nothing, allocator=default_allocator)
 
-Create a leaf node: either a constant, or a variable.
+Create a new node in an expression tree. If `T` is not specified in either the type or the
+first argument, it will be inferred from the value of `val` passed or `l` and/or `r`.
+If it cannot be inferred from these, it will default to `Float32`.
 
-- `::Type{T}`, optionally specify the type of the
-    node, if not already given by the type of
-    `val`.
-- `val`, if you are specifying a constant, pass
-    the value of the constant here.
-- `feature::Integer`, if you are specifying a variable,
-    pass the index of the variable here.
+You may also construct nodes via the convenience operators generated by creating an `OperatorEnum`.
 
-You can also create a leaf node from variable names:
-
-    Node(; var_string::String, variable_names::Array{String,1})
-    Node{T}(; var_string::String, variable_names::Array{String,1}) where {T}
-
-## Unary operator
-
-    Node(op::Integer, l::Node)
-
-Apply unary operator `op` (enumerating over the order given in `OperatorEnum`)
-to `Node` `l`.
-
-## Binary operator
-
-    Node(op::Integer, l::Node, r::Node)
-
-Apply binary operator `op` (enumerating over the order given in `OperatorEnum`)
-to `Node`s `l` and `r`.
+You may also choose to specify a default memory allocator for the node other than simply `Node{T}()`
+in the `allocator` keyword argument.
 """
 mutable struct Node{T} <: AbstractExpressionNode{T}
     degree::UInt8  # 0 for constant/variable, 1 for cos/sin, 2 for +/* etc.