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

        [TensorFloat-32](https://blogs.nvidia.com/blog/2020/05/14/tensorfloat-32-precision-format/).
        Specifically, inputs to such ops are rounded from 23 bits of precision
        to 10 bits of precision. This is unlikely to cause issues in practice
        for deep learning models. In some cases, TensorFloat-32 is also used for
        complex64 ops. TensorFloat-32 can be disabled by running

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

## 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)

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)

            try {
                return clazz.getMethod(name, paramTypes);
            } catch (NoSuchMethodException e) {
                // If the class does not have the method, then neither its superclass
                // nor any of its interfaces has it so quickly return null.
                return null;
            }
        }

        //  try the superclass
        Class<?> superclazz = clazz.getSuperclass();

   * 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