- github.com/armon/go-radix: [7fddfc3](https://github.com/armon/go-radix/tree/7fddfc3)
- github.com/bgentry/speakeasy: [v0.1.0](https://github.com/bgentry/speakeasy/tree/v0.1.0)
- github.com/bits-and-blooms/bitset: [v1.2.0](https://github.com/bits-and-blooms/bitset/tree/v1.2.0)
- github.com/bketelsen/crypt: [v0.0.4](https://github.com/bketelsen/crypt/tree/v0.0.4)

pkg syscall (linux-arm-cgo), type EpollEvent struct, Pad int32
pkg syscall (linux-arm-cgo), type EpollEvent struct, PadFd int32
pkg syscall (linux-arm-cgo), type FdSet struct
pkg syscall (linux-arm-cgo), type FdSet struct, Bits [32]int32
pkg syscall (linux-arm-cgo), type Fsid struct
pkg syscall (linux-arm-cgo), type Fsid struct, X__val [2]int32
pkg syscall (linux-arm-cgo), type ICMPv6Filter struct

pkg log/syslog (darwin-arm64-cgo), method (*Writer) Write([]uint8) (int, error)
pkg log/syslog (darwin-arm64-cgo), type Priority int
pkg log/syslog (darwin-arm64-cgo), type Writer struct
pkg math/bits (darwin-arm64), const UintSize = 64
pkg math/bits (darwin-arm64-cgo), const UintSize = 64
pkg os (darwin-arm64), const DevNull = "/dev/null"
pkg os (darwin-arm64), const O_APPEND = 8
pkg os (darwin-arm64), const O_CREATE = 512

## Dependencies

### Added
- github.com/bits-and-blooms/bitset: [v1.2.0](https://github.com/bits-and-blooms/bitset/tree/v1.2.0)

### Changed
- github.com/cilium/ebpf: [v0.5.0 → v0.6.2](https://github.com/cilium/ebpf/compare/v0.5.0...v0.6.2)

## Urgent Upgrade Notes
### (No, really, you MUST read this before you upgrade)
#### Cluster Lifecycle

   * type of the returned array is that of the specified array. If the queue fits in the specified
   * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
   * specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more

### Added
- github.com/antihax/optional: [v1.0.0](https://github.com/antihax/optional/tree/v1.0.0)
- github.com/benbjohnson/clock: [v1.0.3](https://github.com/benbjohnson/clock/tree/v1.0.3)
- github.com/bits-and-blooms/bitset: [v1.2.0](https://github.com/bits-and-blooms/bitset/tree/v1.2.0)
- github.com/certifi/gocertifi: [2c3bb06](https://github.com/certifi/gocertifi/tree/2c3bb06)

   * array is that of the specified array. The returned array elements are in no particular order.
   * If the queue fits in the specified array, it is returned therein. Otherwise, a new array is
   * allocated with the runtime type of the specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more

pkg math/big, method (*Int) AndNot(*Int, *Int) *Int
pkg math/big, method (*Int) Binomial(int64, int64) *Int
pkg math/big, method (*Int) Bit(int) uint
pkg math/big, method (*Int) BitLen() int
pkg math/big, method (*Int) Bits() []Word
pkg math/big, method (*Int) Bytes() []uint8
pkg math/big, method (*Int) Cmp(*Int) int
pkg math/big, method (*Int) Div(*Int, *Int) *Int
pkg math/big, method (*Int) DivMod(*Int, *Int, *Int) (*Int, *Int)

### Expiry or removal events

An object that is in transition tier will be deleted once the object hits expiry date or if removed via `mc rm` (`mc rm --vid` in the case of delete of a specific object version). Other rules specific to legal hold and object locking precede any lifecycle rules.

### Additional notes