// then re-insert after sorting so we can reuse tmp for future sort calls.
	*tmp = (*tmp)[:0]
	for n.kids != nil {
		*tmp = append(*tmp, n.kids)
		n.kids.setParent(nil)
	}
	sort.Sort(http2sortPriorityNodeSiblings(*tmp))
	for i := len(*tmp) - 1; i >= 0; i-- {
		(*tmp)[i].setParent(n) // setParent inserts at the head of n.kids
	}
	for k := n.kids; k != nil; k = k.next {

message LinuxContainerUser {
  // UID is the primary uid initially attached to the first process in the container
  optional int64 uid = 1;

  // GID is the primary gid initially attached to the first process in the container
  optional int64 gid = 2;

  // SupplementalGroups are the supplemental groups initially attached to the first process in the container
  // +optional
  // +listType=atomic