(self, curNode, a)
| 248 | return node |
| 249 | |
| 250 | def __find(self, curNode, a): |
| 251 | if curNode is not None: |
| 252 | if curNode.contains(a): |
| 253 | return curNode |
| 254 | nextNode = curNode.chooseChild(a) |
| 255 | if nextNode is None: |
| 256 | return curNode |
| 257 | self.lastSearchDepth += 1 |
| 258 | return self.__find(nextNode, a) |
| 259 | |
| 260 | def __getLeftSibling(self, node): |
| 261 | """ Returns left sibling of a node """ |
no test coverage detected