()
| 1121 | } |
| 1122 | |
| 1123 | func (n *node) nextSibling() *node { |
| 1124 | if n.parent == nil || n.parentIndex == n.parent.nrSegments { |
| 1125 | return nil |
| 1126 | } |
| 1127 | return n.parent.children[n.parentIndex+1] |
| 1128 | } |
| 1129 | |
| 1130 | // rebalanceBeforeInsert splits n and its ancestors if they are full, as |
| 1131 | // required for insertion, and returns an updated iterator to the position |
no outgoing calls
no test coverage detected