In c++, all a sort operation needs is a lessThan function. Complex sorts are EASY:<\/p>\n\n\n\n
struct AnalyzerJobs_lessthan\n{\n bool operator()(const AnalyzerJob* left, const AnalyzerJob* right) const\n {\n assert(left ->psq_->second && left ->psq_->second->p_shared_aps_ && left ->psq_->second->p_shared_aps_->p_ad_);\n assert(right->psq_->second && right->psq_->second->p_shared_aps_ && right->psq_->second->p_shared_aps_->p_ad_);\n\n \/\/ Primary sort\n \/\/ Critical jobs first\n \/\/ If only one is critical, it wins.\n if (left ->psq_->second->p_shared_aps_->bCriticalAnalysisNeeded() != right->psq_->second->p_shared_aps_->bCriticalAnalysisNeeded())\n return left ->psq_->second->p_shared_aps_->bCriticalAnalysisNeeded();\n\n \/\/ Secondary sort\n \/\/ If only one has never been analyzed, it wins.\n if (left->psq_->second->p_shared_aps_->bAnalyzed() != right->psq_->second->p_shared_aps_->bAnalyzed())\n return right->psq_->second->p_shared_aps_->bAnalyzed();\n\n \/\/ Tertiary sort by reverse timestamp of last analysis.\n double lefttime = left ->psq_->second->p_shared_aps_->analysis_finished_timestamp_;\n double righttime = right->psq_->second->p_shared_aps_->analysis_finished_timestamp_;\n return (lefttime > righttime);\n }\n};<\/code><\/pre>\n\n\n\nYou’d think JavaScript would keep that battle-tested methodology, but they decided it would be better to expect a result from the sort function of [ -1, 0, 1 ]. I’m assuming so they can eek out a bit of performance when sorting arrays that have a large number of “equal” items. Seems an outlier case to optimize for, but it probably puts it on some slightly higher score on some manic benchmark.<\/p>\n\n\n\n
So for even the simplest sort, you have to do this stupidity:<\/p>\n\n\n\n
myArray.sort(( a, b ) => ( a.value > b.value ? 1 : -1 ));<\/code><\/pre>\n\n\n\nIt seems to work as long as the sign is right, so this is also possible:<\/p>\n\n\n\n
myArray.sort(( a, b ) => ( a.value - b.value ));<\/code><\/pre>\n\n\n\n