Documentation ¶
Index ¶
- func Detach(ctx context.Context) context.Context
- func Err(errors ...error) error
- func GetStacktrace(all bool) string
- func IsSortedAndUnique[T Sortable[T]](s []T) bool
- func IsSortedAndUniqueByHash[T ~[]byte](s []T) bool
- func IsSortedAndUniqueOrdered[T cmp.Ordered](s []T) bool
- func IsSortedBytes[T ~[]byte](s []T) bool
- func RandomBytes(n int) []byte
- func Sort[T Sortable[T]](s []T)
- func SortByHash[T ~[]byte](s []T)
- func Zero[T any]() T
- func ZeroSlice[T any](s []T)
- type Atomic
- type BytesPool
- type Sortable
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func GetStacktrace ¶ added in v1.11.10
func IsSortedAndUnique ¶
Returns true iff the elements in [s] are unique and sorted.
func IsSortedAndUniqueByHash ¶ added in v1.11.10
Returns true iff the elements in [s] are unique and sorted based by their hashes.
func IsSortedAndUniqueOrdered ¶ added in v1.11.10
Returns true iff the elements in [s] are unique and sorted.
func IsSortedBytes ¶ added in v1.11.10
Returns true iff the elements in [s] are sorted.
func RandomBytes ¶ added in v1.11.10
RandomBytes returns a slice of n random bytes Intended for use in testing
func SortByHash ¶ added in v1.11.10
func SortByHash[T ~[]byte](s []T)
Sorts the elements of [s] based on their hashes.
Types ¶
type Atomic ¶ added in v1.11.10
type Atomic[T any] struct { // contains filtered or unexported fields }
func (*Atomic[T]) MarshalJSON ¶ added in v1.11.10
func (*Atomic[T]) UnmarshalJSON ¶ added in v1.11.10
type BytesPool ¶ added in v1.11.10
BytesPool tracks buckets of available buffers to be allocated. Each bucket allocates buffers of the following length:
0 1 3 7 15 31 63 127 ... MaxInt
In order to allocate a buffer of length 19 (for example), we calculate the number of bits required to represent 19 (5). And therefore allocate a slice from bucket 5, which has length 31. This is the bucket which produces the smallest slices that are at least length 19.
When replacing a buffer of length 19, we calculate the number of bits required to represent 20 (5). And therefore place the slice into bucket 4, which has length 15. This is the bucket which produces the largest slices that a length 19 slice can be used for.
func NewBytesPool ¶ added in v1.11.10
func NewBytesPool() *BytesPool
Source Files ¶
Directories ¶
Path | Synopsis |
---|---|
crypto
|
|
keychain
Package keychain is a generated GoMock package.
|
Package keychain is a generated GoMock package. |
Package filesystem is a generated GoMock package.
|
Package filesystem is a generated GoMock package. |
Package hashing is a generated GoMock package.
|
Package hashing is a generated GoMock package. |
Package logging is a generated GoMock package.
|
Package logging is a generated GoMock package. |
Package resource is a generated GoMock package.
|
Package resource is a generated GoMock package. |