remove ambiguous bounding_box method + bug fixes

Author: maltezfaria

src/Interpolation/hyperrectangle.jl

@@ -153,7 +153,7 @@ Base.isapprox(h1::HyperCube,h2::HyperCube;kwargs...) = isapprox(h1.low_corner,h2
 # Utils
 ######
 
-function bounding_box(els,cube=false)
+function HyperRectangle(els,cube=false)
     isempty(els)  && (error("data cannot be empty") )
     lb  = first(els) |> coords
     ub  = first(els) |> coords
@@ -171,7 +171,6 @@ function bounding_box(els,cube=false)
     end
     return HyperRectangle(lb,ub)
 end
-HyperRectangle(data,cube=false) = bounding_box(data,cube)
 
 """
     split(rec::AbstractHyperRectangle,[axis]::Int,[place])

src/Mesh/submesh.jl

@@ -24,7 +24,7 @@ Base.view(m::GenericMesh,ent::AbstractEntity) = SubMesh(m,Domain(ent))
 Base.view(m::SubMesh,Ω::Domain)           = view(mesh(m),intersect(Ω,domain(m)))
 Base.view(m::SubMesh,ent::AbstractEntity) = view(m,Domain(ent))
 
-parent(m::SubMesh) = m.parent
+Base.parent(m::SubMesh) = m.parent
 domain(m::SubMesh) = m.domain
 
 # ElementIterator for submesh

src/Trees/clustertree.jl

@@ -7,7 +7,7 @@ additional `data` field of type `D` can be associated with each node to store
 node-specific information (it defaults to `D=Nothing`).
 
 # Fields:
-- `_elements::T` : vector containing the sorted elements.
+- `_elements::Vector{T}` : vector containing the sorted elements.
 - `container::S` : container for the elements in the current node.
 - `index_range::UnitRange{Int}` : indices of elements contained in the current node.
 - `loc2glob::Vector{Int}` : permutation from the local indexing system to the
@@ -154,7 +154,7 @@ end
 Split a `ClusterTree` into two, sorting all elements in the process.
 For each resulting child assign `child.parent=parentcluster`.
 
-Passing a `dir` and `pos` arguments splits the `bounding_box` box of `node`
+Passing a `dir` and `pos` arguments splits the `container` of `node`
 along direction `dir` at position `pos`, then sorts all points into the
 resulting  left/right nodes.