|
94 | 94 | root = first(level_sequence) |
95 | 95 | prev = root |
96 | 96 | for level in view(level_sequence, |
97 | | - (firstindex(level_sequence) + 1):lastindex(level_sequence)) |
| 97 | + (firstindex(level_sequence) + 1):lastindex(level_sequence)) |
98 | 98 | if (level <= root) || (level > prev + 1) |
99 | 99 | return false |
100 | 100 | end |
@@ -905,7 +905,7 @@ function all_partitions(t::RootedTree) |
905 | 905 | forests = [partition_forest(t, edge_set)] |
906 | 906 | skeletons = [partition_skeleton(t, edge_set)] |
907 | 907 |
|
908 | | - for edge_set_value in 1:(2^length(edge_set) - 1) |
| 908 | + for edge_set_value in 1:(2 ^ length(edge_set) - 1) |
909 | 909 | binary_digits!(edge_set, edge_set_value) |
910 | 910 | push!(forests, partition_forest(t, edge_set)) |
911 | 911 | push!(skeletons, partition_skeleton(t, edge_set)) |
@@ -1056,10 +1056,8 @@ end |
1056 | 1056 |
|
1057 | 1057 | # necessary for simple and convenient use since the iterates may be modified |
1058 | 1058 | function Base.collect(partitions::PartitionIterator{TreeInput, |
1059 | | - TreeOutput}) where { |
1060 | | - TreeInput, |
1061 | | - TreeOutput |
1062 | | - } |
| 1059 | + TreeOutput}) where {TreeInput, |
| 1060 | + TreeOutput} |
1063 | 1061 | iterates = Vector{Tuple{Vector{TreeOutput}, TreeOutput}}() |
1064 | 1062 | sizehint!(iterates, length(partitions)) |
1065 | 1063 | for (forest, skeleton) in partitions |
@@ -1092,7 +1090,7 @@ function all_splittings(t::RootedTree) |
1092 | 1090 | forests = Vector{Vector{RootedTree{T, Vector{T}}}}() |
1093 | 1091 | subtrees = Vector{RootedTree{T, Vector{T}}}() # ordered subtrees |
1094 | 1092 |
|
1095 | | - for node_set_value in 0:(2^order(t) - 1) |
| 1093 | + for node_set_value in 0:(2 ^ order(t) - 1) |
1096 | 1094 | binary_digits!(node_set, node_set_value) |
1097 | 1095 |
|
1098 | 1096 | # Check that if a node is removed then all of its descendants are removed |
|
0 commit comments