code: func SortedIntersectUint64(args ...[]uint64) []uint64 {
  	// create an array to hold the intersection and write the first array to it
  	tempIntersection := args[0]
  	argsLen := len(args)
  
  	for k := 1; k < argsLen; k++ {
  		// do we have any intersections?
  		switch len(tempIntersection) {
  		case 0:
  			// nope! Give them an empty array!
  			return tempIntersection
  
  		default:
  			// yup, keep chugging
  			tempIntersection = sortedIntersectUintHelper(tempIntersection, args[k])
  		}
  	}
  
  	return tempIntersection
  }
docs: // SortedIntersectUint64 finds the intersection of two sorted arrays.
  //
  // Deprecated: use Intersect instead.