UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-21 23:00:45 +01:00
Code Issues Packages Projects Releases Wiki Activity

[poincare] Remove wrong asserts

Browse Source
This commit is contained in:
Léa Saviot
2018-08-14 18:01:02 +02:00
parent c5a85edf8e
commit 06ac37cbc1
1 changed files with 0 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
poincare/include/poincare/tree_by_reference.h
View File

@@ -44,49 +44,38 @@ public:
bool isStatic() const { return node()->isStatic(); }
int nodeRetainCount() const {
assert(!isUninitialized());
return node()->retainCount();
}
void incrementNumberOfChildren(int increment = 1) {
assert(!isUninitialized());
node()->incrementNumberOfChildren(increment);
}
void decrementNumberOfChildren(int decrement = 1) {
assert(!isUninitialized());
node()->decrementNumberOfChildren(decrement);
}
int numberOfDescendants(bool includeSelf) const {
assert(!isUninitialized());
return node()->numberOfDescendants(includeSelf);
}
/* Hierarchy */
bool hasChild(TreeByReference t) const {
assert(!isUninitialized());
return node()->hasChild(t.node());
}
bool hasSibling(TreeByReference t) const {
assert(!isUninitialized());
return node()->hasSibling(t.node());
}
bool hasAncestor(TreeByReference t, bool includeSelf) const {
assert(!isUninitialized());
return node()->hasAncestor(t.node(), includeSelf);
}
int numberOfChildren() const {
assert(!isUninitialized());
return node()->numberOfChildren();
}
TreeByReference parent() const {
assert(!isUninitialized());
return TreeByReference(node()->parent());
}
TreeByReference childAtIndex(int i) const {
assert(!isUninitialized());
return TreeByReference(node()->childAtIndex(i));
}
int indexOfChild(TreeByReference t) const {
assert(!isUninitialized());
return node()->indexOfChild(t.node());
}