|
@@ -834,6 +834,7 @@ private:
|
|
/// the top node
|
|
/// the top node
|
|
///
|
|
///
|
|
/// \exception None
|
|
/// \exception None
|
|
|
|
+ // cppcheck-suppress unusedPrivateFunction (false positive, it is used)
|
|
void pop() {
|
|
void pop() {
|
|
assert(!isEmpty());
|
|
assert(!isEmpty());
|
|
--level_count_;
|
|
--level_count_;
|
|
@@ -846,6 +847,7 @@ private:
|
|
/// otherwise the node should be the root node of DomainTree.
|
|
/// otherwise the node should be the root node of DomainTree.
|
|
///
|
|
///
|
|
/// \exception None
|
|
/// \exception None
|
|
|
|
+ // cppcheck-suppress unusedPrivateFunction (false positive, it is used)
|
|
void push(const DomainTreeNode<T>* node) {
|
|
void push(const DomainTreeNode<T>* node) {
|
|
assert(level_count_ < RBT_MAX_LEVEL);
|
|
assert(level_count_ < RBT_MAX_LEVEL);
|
|
nodes_[level_count_++] = node;
|
|
nodes_[level_count_++] = node;
|