go.etcd.io/bbolt.node.parent (field)
43 uses
go.etcd.io/bbolt (current package)
bucket.go#L652: n := &node{bucket: b, parent: parent}
node.go#L18: parent *node
node.go#L25: if n.parent == nil {
node.go#L28: return n.parent.root()
node.go#L93: if n.parent == nil {
node.go#L96: index := n.parent.childIndex(n)
node.go#L97: if index >= n.parent.numChildren()-1 {
node.go#L100: return n.parent.childAt(index + 1)
node.go#L105: if n.parent == nil {
node.go#L108: index := n.parent.childIndex(n)
node.go#L112: return n.parent.childAt(index - 1)
node.go#L290: if n.parent == nil {
node.go#L291: n.parent = &node{bucket: n.bucket, children: []*node{n}}
node.go#L295: next := &node{bucket: n.bucket, isLeaf: n.isLeaf, parent: n.parent}
node.go#L296: n.parent.children = append(n.parent.children, next)
node.go#L378: if node.parent != nil {
node.go#L384: node.parent.put(key, node.inodes[0].key, nil, node.pgid, 0)
node.go#L395: if n.parent != nil && n.parent.pgid == 0 {
node.go#L397: return n.parent.spill()
node.go#L421: if n.parent == nil {
node.go#L433: child.parent = n
node.go#L438: child.parent = nil
node.go#L448: n.parent.del(n.key)
node.go#L449: n.parent.removeChild(n)
node.go#L452: n.parent.rebalance()
node.go#L456: _assert(n.parent.numChildren() > 1, "parent must have at least 2 children")
node.go#L460: var useNextSibling = (n.parent.childIndex(n) == 0)
node.go#L472: child.parent.removeChild(child)
node.go#L473: child.parent = n
node.go#L474: child.parent.children = append(child.parent.children, child)
node.go#L480: n.parent.del(target.key)
node.go#L481: n.parent.removeChild(target)
node.go#L488: child.parent.removeChild(child)
node.go#L489: child.parent = target
node.go#L490: child.parent.children = append(child.parent.children, child)
node.go#L496: n.parent.del(n.key)
node.go#L497: n.parent.removeChild(n)
node.go#L503: n.parent.rebalance()