Skip to content

Commit

Permalink
Fix deprecations (#19)
Browse files Browse the repository at this point in the history
  • Loading branch information
femtocleaner[bot] authored and Keno committed Jun 28, 2018
1 parent f5f6a5b commit 862a675
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 5 deletions.
6 changes: 1 addition & 5 deletions src/AbstractTrees.jl
Expand Up @@ -56,10 +56,6 @@ children(kv::Pair{K,V}) where {K,V} = (kv[2],)
printnode(io::IO, d::Dict{K,V}) where {K,V} = print(io, Dict{K,V})
printnode(io::IO, d::Vector{T}) where {T} = print(io, Vector{T})

if VERSION < v"0.7.0-DEV.1661"
nextind(x::Tuple, i::Integer) = i + 1
end

# Node equality predicate
nodeequal(a, b) = a === b

Expand Down Expand Up @@ -155,7 +151,7 @@ function _print_tree(printnode::Function, io::IO, tree, maxdepth = 5; depth = 0,
end
print_tree(f::Function, io::IO, tree, args...; kwargs...) = _print_tree(f, io, tree, args...; kwargs...)
print_tree(io::IO, tree, args...; kwargs...) = print_tree(printnode, io, tree, args...; kwargs...)
print_tree(tree, args...; kwargs...) = print_tree(STDOUT::IO, tree, args...; kwargs...)
print_tree(tree, args...; kwargs...) = print_tree(stdout::IO, tree, args...; kwargs...)

# Tree Indexing
struct Tree
Expand Down
1 change: 1 addition & 0 deletions test/runtests.jl
@@ -1,6 +1,7 @@
try
AbstractTrees
workspace()
catch
end
using AbstractTrees
using Test
Expand Down

0 comments on commit 862a675

Please sign in to comment.