maps

Documentation

Index

• func Set[M map[K]struct{}, K comparable](ks ...K) (m M)
• func Split[M ~map[K]V, K comparable, V any](m M, sep int) []M
• func SplitN[M ~map[K]V, K comparable, V any](m M, sep int, n int) []M

Functions

func Set

func Set[M map[K]struct{}, K comparable](ks ...K) (m M)

Set implements a non-thread safe Set

func Split

func Split[M ~map[K]V, K comparable, V any](m M, sep int) []M

Split slices s into all submaps separated by sep and returns a slice of the submaps between those separators.

If s is less than sep and sep is more than zero, Split returns a slice of length 1 whose only element is s.

If s is nil, Split returns nil (zero submaps).

If both s and sep are empty or zero, Split returns an empty slice.

If sep is <= zero, Split splits after each element, as chunk size is 1.

It is equivalent to SplitN with a count of -1.

func SplitN

func SplitN[M ~map[K]V, K comparable, V any](m M, sep int, n int) []M

SplitN slices s into submaps and returns a slice of the submaps.

The count determines the number of submaps to return:

  n > 0: at most n submaps; the last submaps will be the unsplit remainder.
		The count determines the number of submaps to return:
  		sep > 0: Split splits every sep as chunk size; the last submaps will be the unsplit remainder.
  		sep <= 0: take len(S)/n as chunk size
  n == 0: the result is nil (zero submaps)
  n < 0: all submaps as n == len(s)

Edge cases for s and sep (for example, zero) are handled as described in the documentation for Split.