IntersectionByteSlices returns the common elements between sets of byte slices.

IntersectionInt64 of any number of int64 slices with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

IntersectionSlot of any number of types.Slot slices with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

IntersectionUint64 of any number of uint64 slices with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

IsInInt64 returns true if a is in b and False otherwise.

IsInSlots returns true if a is in b and False otherwise.

IsInUint64 returns true if a is in b and False otherwise.

IsUint64Sorted verifies if a uint64 slice is sorted in ascending order.

NotInt64 returns the int64 in slice a that are not in slice b with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

NotSlot returns the types.Slot in slice b that are not in slice a with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

NotUint64 returns the uint64 in slice b that are not in slice a with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

Reverse reverses any slice in place Taken from https://github.com/faiface/generics/blob/8cf65f0b43803410724d8c671cb4d328543ba07d/examples/sliceutils/sliceutils.go.

SetUint64 returns a slice with only unique values from the provided list of indices.

SplitCommaSeparated values from the list.

SplitOffset returns the start index of a given list splits into chunks, it computes (listsize * index) / chunks.

SubsetUint64 returns true if the first array is completely contained in the second array with time complexity of approximately o(n).

UnionByteSlices returns the all elements between sets of byte slices.

UnionInt64 of any number of int64 slices with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

UnionUint64 of any number of uint64 slices with time complexity of approximately O(n) leveraging a map to check for element existence off by a constant factor of underlying map efficiency.

Unique returns an array with duplicates filtered based on the type given.

VerifyMaxLength takes a slice and a maximum length and validates the length.