@@ -50,15 +50,15 @@ BinaryHeap(ordering::Base.Ordering, xs::AbstractVector{T}) where T = BinaryHeap{
50
50
BinaryHeap {T, O} () where {T, O<: Base.Ordering } = BinaryHeap {T} (O ())
51
51
BinaryHeap {T, O} (xs:: AbstractVector ) where {T, O<: Base.Ordering } = BinaryHeap {T} (O (), xs)
52
52
53
- const BasicReverseOrdering = Base. ReverseOrdering{Base. ForwardOrdering}
53
+ const DefaultReverseOrdering = Base. ReverseOrdering{Base. ForwardOrdering}
54
54
55
55
# These constructors needed for BinaryMaxHeap, until we have https://github.com/JuliaLang/julia/pull/37822
56
- BinaryHeap {T, BasicReverseOrdering } () where {T} = BinaryHeap {T} (Base. Reverse)
57
- BinaryHeap {T, BasicReverseOrdering } (xs:: AbstractVector ) where {T} = BinaryHeap {T} (Base. Reverse, xs)
56
+ BinaryHeap {T, DefaultReverseOrdering } () where {T} = BinaryHeap {T} (Base. Reverse)
57
+ BinaryHeap {T, DefaultReverseOrdering } (xs:: AbstractVector ) where {T} = BinaryHeap {T} (Base. Reverse, xs)
58
58
59
59
# Forward/reverse ordering type aliases
60
60
const BinaryMinHeap{T} = BinaryHeap{T, Base. ForwardOrdering}
61
- const BinaryMaxHeap{T} = BinaryHeap{T, BasicReverseOrdering }
61
+ const BinaryMaxHeap{T} = BinaryHeap{T, DefaultReverseOrdering }
62
62
63
63
BinaryMinHeap (xs:: AbstractVector{T} ) where T = BinaryMinHeap {T} (xs)
64
64
BinaryMaxHeap (xs:: AbstractVector{T} ) where T = BinaryMaxHeap {T} (xs)
0 commit comments