code: func consistentOrderByteSlice(content map[string][]byte) [][]byte {
  	keys := []string{}
  	sortedContent := [][]byte{}
  	for key := range content {
  		keys = append(keys, key)
  	}
  	sort.Strings(keys)
  	for _, key := range keys {
  		sortedContent = append(sortedContent, content[key])
  	}
  	return sortedContent
  }
docs: // consistentOrderByteSlice takes a map of a string key and a byte slice, and returns a byte slice of byte slices
  // with consistent ordering, where the keys in the map determine the ordering of the return value. This has to be
  // done as the order of a for...range loop over a map in go is undeterministic, and could otherwise lead to flakes
  // in e.g. unit tests when marshalling content with a random order