type go.etcd.io/bbolt.node

53 uses

	go.etcd.io/bbolt (current package)
		bucket.go#L34: 	rootNode *node              // materialized node for the root page.
		bucket.go#L35: 	nodes    map[pgid]*node     // node cache
		bucket.go#L59: 		b.nodes = make(map[pgid]*node)
		bucket.go#L180: 		rootNode:    &node{isLeaf: true},
		bucket.go#L493: func (b *Bucket) forEachPageNode(fn func(*page, *node, int)) {
		bucket.go#L502: func (b *Bucket) _forEachPageNode(pgid pgid, depth int, fn func(*page, *node, int)) {
		bucket.go#L643: func (b *Bucket) node(pgid pgid, parent *node) *node {
		bucket.go#L652: 	n := &node{bucket: b, parent: parent}
		bucket.go#L682: 	b.forEachPageNode(func(p *page, n *node, _ int) {
		bucket.go#L705: func (b *Bucket) pageNode(id pgid) (*page, *node) {
		cursor.go#L268: func (c *Cursor) searchNode(key []byte, n *node) {
		cursor.go#L354: func (c *Cursor) node() *node {
		cursor.go#L378: 	node  *node
		node.go#L11: type node struct {
		node.go#L18: 	parent     *node
		node.go#L24: func (n *node) root() *node {
		node.go#L32: func (n *node) minKeys() int {
		node.go#L40: func (n *node) size() int {
		node.go#L52: func (n *node) sizeLessThan(v uintptr) bool {
		node.go#L65: func (n *node) pageElementSize() uintptr {
		node.go#L73: func (n *node) childAt(index int) *node {
		node.go#L81: func (n *node) childIndex(child *node) int {
		node.go#L87: func (n *node) numChildren() int {
		node.go#L92: func (n *node) nextSibling() *node {
		node.go#L104: func (n *node) prevSibling() *node {
		node.go#L116: func (n *node) put(oldKey, newKey, value []byte, pgid pgid, flags uint32) {
		node.go#L144: func (n *node) del(key []byte) {
		node.go#L161: func (n *node) read(p *page) {
		node.go#L191: func (n *node) write(p *page) {
		node.go#L246: func (n *node) split(pageSize uintptr) []*node {
		node.go#L247: 	var nodes []*node
		node.go#L269: func (n *node) splitTwo(pageSize uintptr) (*node, *node) {
		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#L311: func (n *node) splitIndex(threshold int) (index, sz uintptr) {
		node.go#L335: func (n *node) spill() error {
		node.go#L405: func (n *node) rebalance() {
		node.go#L459: 	var target *node
		node.go#L508: func (n *node) removeChild(target *node) {
		node.go#L519: func (n *node) dereference() {
		node.go#L550: func (n *node) free() {
		node.go#L584: type nodes []*node