others

src/Tree.jl

@@ -7,7 +7,7 @@ abstract type AbstractBranchTree{RT, N, B, LI, ND} <:
 end
 
 import Phylo.API: _hasinbound
-function _hasinbound(tree::AbstractBranchTree{<: Rooted}, name::String) 
+function _hasinbound(tree::AbstractBranchTree{<: Rooted}, name::String)
     return tree.nodes[name].inbound !== nothing
 end
 
@@ -429,7 +429,7 @@ end
 
 import Phylo.API: _addoutbound!
 function _addoutbound!(tree::BinaryTree{RT}, name::String, branch::B) where
-    {RT <: Rooted, N, B <: Branch{RT, String}}
+    {RT <: Rooted, B <: Branch{RT, String}}
     node = tree.nodes[name]
     node.outbounds[1] ≡ nothing ?
         node.outbounds = (branch, node.outbounds[2]) :

src/plot.jl

@@ -152,7 +152,7 @@ end
 
 _handlez(x, tree, names) = x
 _handlez(x::Union{String, Symbol}, tree, names) = [getnodedata(tree, name, x) for name in names]
-function _handlez(x::Dict, tree, names) where T
+function _handlez(x::Dict, tree, names)
     ret = fill(NaN, length(names))
     for (i, n) in enumerate(names)
         name = getnodename(tree, n)
@@ -293,10 +293,10 @@ end
 """
     map_depthfirst(FUN, start, tree, eltype = nothing)
 
-Apply `FUN` to each node in `tree` in depth-first order, and return the result. 
-`FUN` must take two arguments, `val` and `node`,  where `val` is the result of 
-applying `FUN` to the previous node, and `node` is the current node. `start` 
-specifies the initial value of `val`, and `eltype` specifies the type of the 
+Apply `FUN` to each node in `tree` in depth-first order, and return the result.
+`FUN` must take two arguments, `val` and `node`,  where `val` is the result of
+applying `FUN` to the previous node, and `node` is the current node. `start`
+specifies the initial value of `val`, and `eltype` specifies the type of the
 return value of `FUN`.
 
 ### Examples

src/routes.jl

@@ -160,7 +160,7 @@ function noderoute end
     return [getnodename(tree, n) for n in route]
 end
 @traitfn function noderoute(tree::T, node1::N, node2::N) where
-    {RT, N, T <: AbstractTree{OneTree}; MatchNodeType{T, N}}
+    {N, T <: AbstractTree{OneTree}; MatchNodeType{T, N}}
     branches1, nodes1 = _treehistory(tree, node1)
     branches2, nodes2 = _treehistory(tree, node2)
     nodes1[end] == nodes2[end] || error("No route between nodes in tree")