File tree 5 files changed +2
-7
lines changed 5 files changed +2
-7
lines changed Original file line number Diff line number Diff line change 4
4
// child indices of a heap
5
5
static inline size_t left (size_t i) { return i << 1 ; }
6
6
static inline size_t right (size_t i) { return (i << 1 ) + 1 ; }
7
-
8
- inline size_t BinaryHeap::parent (size_t i) const { return i >> 1 ; }
7
+ static inline size_t parent (size_t i) { return i >> 1 ; }
9
8
10
9
bool BinaryHeap::is_valid () const {
11
10
if (heap_.empty ()) {
Original file line number Diff line number Diff line change @@ -11,7 +11,6 @@ class BinaryHeap : public KAryHeap {
11
11
12
12
private:
13
13
void sift_down (size_t hole) final ;
14
- size_t parent (size_t i) const final ;
15
14
};
16
15
17
16
#endif // VTR_BINARY_HEAP_H
Original file line number Diff line number Diff line change 2
2
#include " vtr_log.h"
3
3
4
4
static inline size_t first_child (size_t i) { return (i << 2 ) - 2 ; }
5
-
6
- inline size_t FourAryHeap::parent (size_t i) const { return (i + 2 ) >> 2 ; }
5
+ static inline size_t parent (size_t i) { return (i + 2 ) >> 2 ; }
7
6
8
7
inline size_t FourAryHeap::smallest_child (size_t i) const {
9
8
// Returns first_child(i) if i has no children
Original file line number Diff line number Diff line change @@ -11,7 +11,6 @@ class FourAryHeap : public KAryHeap {
11
11
12
12
private:
13
13
void sift_down (size_t hole) final ;
14
- size_t parent (size_t i) const final ;
15
14
size_t smallest_child (size_t i) const ;
16
15
};
17
16
Original file line number Diff line number Diff line change @@ -37,7 +37,6 @@ class KAryHeap : public HeapInterface {
37
37
void prune_heap ();
38
38
39
39
virtual void sift_down (size_t hole) = 0;
40
- virtual size_t parent (size_t i) const = 0;
41
40
42
41
HeapStorage storage_;
43
42
You can’t perform that action at this time.
0 commit comments