(tx *bolt.Tx, keys ...[]byte)
| 181 | ) |
| 182 | |
| 183 | func getBucket(tx *bolt.Tx, keys ...[]byte) *bolt.Bucket { |
| 184 | bkt := tx.Bucket(keys[0]) |
| 185 | |
| 186 | for _, key := range keys[1:] { |
| 187 | if bkt == nil { |
| 188 | break |
| 189 | } |
| 190 | bkt = bkt.Bucket(key) |
| 191 | } |
| 192 | |
| 193 | return bkt |
| 194 | } |
| 195 | |
| 196 | func createBucketIfNotExists(tx *bolt.Tx, keys ...[]byte) (*bolt.Bucket, error) { |
| 197 | bkt, err := tx.CreateBucketIfNotExists(keys[0]) |
no outgoing calls
searching dependent graphs…