code: func activeQComp(podInfo1, podInfo2 interface{}) bool {
  	pInfo1 := podInfo1.(*podInfo)
  	pInfo2 := podInfo2.(*podInfo)
  	prio1 := util.GetPodPriority(pInfo1.pod)
  	prio2 := util.GetPodPriority(pInfo2.pod)
  	return (prio1 > prio2) || (prio1 == prio2 && pInfo1.timestamp.Before(pInfo2.timestamp))
  }
docs: // activeQComp is the function used by the activeQ heap algorithm to sort pods.
  // It sorts pods based on their priority. When priorities are equal, it uses
  // podInfo.timestamp.