go.etcd.io/bbolt.node.inodes (field)
74 uses
go.etcd.io/bbolt (current package)
bucket.go#L518: for _, inode := range n.inodes {
bucket.go#L597: for _, inode := range n.inodes {
cursor.go#L177: pgid = ref.node.inodes[ref.index].pgid
cursor.go#L198: pgid = ref.node.inodes[ref.index].pgid
cursor.go#L270: index := sort.Search(len(n.inodes), func(i int) bool {
cursor.go#L273: ret := bytes.Compare(n.inodes[i].key, key)
cursor.go#L285: c.search(key, n.inodes[index].pgid)
cursor.go#L318: index := sort.Search(len(n.inodes), func(i int) bool {
cursor.go#L319: return bytes.Compare(n.inodes[i].key, key) != -1
cursor.go#L344: inode := &ref.node.inodes[ref.index]
cursor.go#L393: return len(r.node.inodes)
node.go#L20: inodes inodes
node.go#L42: for i := 0; i < len(n.inodes); i++ {
node.go#L43: item := &n.inodes[i]
node.go#L54: for i := 0; i < len(n.inodes); i++ {
node.go#L55: item := &n.inodes[i]
node.go#L77: return n.bucket.node(n.inodes[index].pgid, n)
node.go#L82: index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, child.key) != -1 })
node.go#L88: return len(n.inodes)
node.go#L126: index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, oldKey) != -1 })
node.go#L129: exact := (len(n.inodes) > 0 && index < len(n.inodes) && bytes.Equal(n.inodes[index].key, oldKey))
node.go#L131: n.inodes = append(n.inodes, inode{})
node.go#L132: copy(n.inodes[index+1:], n.inodes[index:])
node.go#L135: inode := &n.inodes[index]
node.go#L146: index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, key) != -1 })
node.go#L149: if index >= len(n.inodes) || !bytes.Equal(n.inodes[index].key, key) {
node.go#L154: n.inodes = append(n.inodes[:index], n.inodes[index+1:]...)
node.go#L164: n.inodes = make(inodes, int(p.count))
node.go#L167: inode := &n.inodes[i]
node.go#L182: if len(n.inodes) > 0 {
node.go#L183: n.key = n.inodes[0].key
node.go#L199: if len(n.inodes) >= 0xFFFF {
node.go#L200: panic(fmt.Sprintf("inode overflow: %d (pgid=%d)", len(n.inodes), p.id))
node.go#L202: p.count = uint16(len(n.inodes))
node.go#L211: off := unsafe.Sizeof(*p) + n.pageElementSize()*uintptr(len(n.inodes))
node.go#L212: for i, item := range n.inodes {
node.go#L272: if len(n.inodes) <= (minKeysPerPage*2) || n.sizeLessThan(pageSize) {
node.go#L299: next.inodes = n.inodes[splitIndex:]
node.go#L300: n.inodes = n.inodes[:splitIndex]
node.go#L315: for i := 0; i < len(n.inodes)-minKeysPerPage; i++ {
node.go#L317: inode := n.inodes[i]
node.go#L381: key = node.inodes[0].key
node.go#L384: node.parent.put(key, node.inodes[0].key, nil, node.pgid, 0)
node.go#L385: node.key = node.inodes[0].key
node.go#L416: if n.size() > threshold && len(n.inodes) > n.minKeys() {
node.go#L423: if !n.isLeaf && len(n.inodes) == 1 {
node.go#L425: child := n.bucket.node(n.inodes[0].pgid, n)
node.go#L427: n.inodes = child.inodes[:]
node.go#L431: for _, inode := range n.inodes {
node.go#L470: for _, inode := range target.inodes {
node.go#L479: n.inodes = append(n.inodes, target.inodes...)
node.go#L486: for _, inode := range n.inodes {
node.go#L495: target.inodes = append(target.inodes, n.inodes...)
node.go#L527: for i := range n.inodes {
node.go#L528: inode := &n.inodes[i]
node.go#L589: return bytes.Compare(s[i].inodes[0].key, s[j].inodes[0].key) == -1