func funcSortDesc(vals []Value, args Expressions, enh *EvalNodeHelper) Vector {
	// NaN should sort to the bottom, so take ascending sort with NaN first and
	// reverse it.
	byValueSorter := vectorByValueHeap(vals[0].(Vector))
	sort.Sort(sort.Reverse(byValueSorter))
	return Vector(byValueSorter)
}
func funcSortDesc(vals []Value, args Expressions, enh *EvalNodeHelper) Vector {
	
	
	byValueSorter := vectorByValueHeap(vals[0].(Vector))
	sort.Sort(sort.Reverse(byValueSorter))
	return Vector(byValueSorter)
}
func funcSortDesc ( vals [ ] Value , args Expressions , enh * EvalNodeHelper ) Vector { // NaN should sort to the bottom, so take ascending sort with NaN first and // reverse it. byValueSorter := vectorByValueHeap ( vals [ 0 ] . ( Vector ) ) sort . Sort ( sort . Reverse ( byValueSorter ) ) return Vector ( byValueSorter ) }
// === sortDesc(node ValueTypeVector) Vector ===
=== sortDesc ( node ValueTypeVector ) Vector ===