blocks|key|586540|text|您可以使用四种不同的比较函数-一个按item1排序，一个按item2排序，一个按item1排序，然后按item2排序，另一个按item2排序，然后按item1排序。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|586541|例如：|586542|arr.sort(function(a,b){
++if(a.item1+==+b.item1){
++++return+a.item2+>+b.item2+?+1+:+a.item2+<+b.item2+?+-1+:+0;
++}

++return+a.item1+>+b.item1+?+1+:+-1;
});|code-block|syntax|javascript|586543|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

You can have four different comparison functions - one sorting by item1, one by item2, one by item1 then item2 and one by item2 then item1.

E.g.:

<pre><code>arr.sort(function(a,b){
 if(a.item1 == b.item1){
 return a.item2 &gt; b.item2 ? 1 : a.item2 &lt; b.item2 ? -1 : 0;
 }

 return a.item1 &gt; b.item1 ? 1 : -1;
});
</code></pre>

blocks|key|586615|text|我最近也问了同样的问题。使用了与langpavel类似的解决方案，但我更喜欢将其一分为二。首先是一个链式的比较器帮助器，它允许多个排序规则，每个规则在相等的情况下作为平局断路器顺序应用：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|586616|++++type+Comparator<T>+=+(a:+T,+b:+T)+=>+number;+//+-1+%7C+0+%7C+1

++++/**
+++++*+Allow+to+chain+multiple+comparators,+each+one+called+to+break+equality+from+the+previous+one.
+++++*/
++++function+chainedComparator<T>(...comparators:+Comparator<T>[]):+Comparator<T>+{
++++++++return+(a:+T,+b:+T)+=>+{
++++++++++++let+order+=+0;
++++++++++++let+i+=+0;
++++
++++++++++++while+(!order+&&+comparators[i])+{
++++++++++++++++order+=+comparators[i%2B%2B](a,+b);
++++++++++++}
++++
++++++++++++return+order;
++++++++};
++++}|code-block|syntax|javascript|586617|我喜欢它，因为它接受并返回排序比较器。因此，如果你有一个其他比较器的集合，它们很容易使用。|586618|然后你可以用一个额外的帮手来简化你的生活。这个函数根据传递给每个项目的lambda的结果返回一个排序比较器。|586619|++++type+Comparable+=+string+%7C+number;

++++/**
+++++*+Returns+a+comparator+which+use+an+evaluationFunc+on+each+item+for+comparison
+++++*/
++++function+lambdaComparator<T>(evaluationFunc:+((item:+T)+=>+Comparable),+reversed+=+false):+Comparator<T>+{
++++++++return+(a:+T,+b:+T)+=>+{
++++++++++++const+valA+=+evaluationFunc(a);
++++++++++++const+valB+=+evaluationFunc(b);
++++++++++++let+order+=+0;
++++
++++++++++++if+(valA+<+valB)+{
++++++++++++++++order+=+-1;
++++++++++++}+else+if+(valA+>+valB)+{
++++++++++++++++order+=+1;
++++++++++++}
++++++++++++return+reversed+?+-order+:+order;
++++++++};
++++}|586620|这里的reversed不需要回答这个问题，但可以很容易地颠倒顺序。|offset|length|style|CODE|586621|要具体回答这个问题，请使用我们的两个比较器：|586622|++++arr.sort(chainedComparator(
++++++++lambdaComparator(a+=>+a.item1),
++++++++lambdaComparator(a+=>+a.item2.toLowerCase())+//+"banana"+before+"Melon"
++++));|586623|因为最初的问题是纯JavaScript的，精度:如果你不习惯使用TypeScript，你只需去掉输入<T>，:+T，:+((item:+T)+=>+Comparable)+everywhere和两行type就可以得到普通的JavaScript。|586624|entityMap^0|0|0|0|0|0|3|8|0|0|0|1E|3|1I|3|1M|R|2R|4|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|12|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|13|8|@]|9|@]|A|$]]|$1|K|3|L|5|D|7|14|8|@]|9|@]|A|$E|F]]|$1|M|3|N|5|6|7|15|8|@$O|16|P|17|Q|R]]|9|@]|A|$]]|$1|S|3|T|5|6|7|18|8|@]|9|@]|A|$]]|$1|U|3|V|5|D|7|19|8|@]|9|@]|A|$E|F]]|$1|W|3|X|5|6|7|1A|8|@$O|1B|P|1C|Q|R]|$O|1D|P|1E|Q|R]|$O|1F|P|1G|Q|R]|$O|1H|P|1I|Q|R]]|9|@]|A|$]]|$1|Y|3|-4|5|6|7|1J|8|@]|9|@]|A|$]]]|Z|$]]

I hit the same question lately. Came with a similar solution than langpavel, but I prefer to split the thing in two. First a chained comparator helper that will allows multiple sort rule, each applied in order as a tie-breaker in case of equality:
<pre><code> type Comparator&lt;T&gt; = (a: T, b: T) =&gt; number; // -1 | 0 | 1

 /**
 * Allow to chain multiple comparators, each one called to break equality from the previous one.
 */
 function chainedComparator&lt;T&gt;(...comparators: Comparator&lt;T&gt;[]): Comparator&lt;T&gt; {
 return (a: T, b: T) =&gt; {
 let order = 0;
 let i = 0;
 
 while (!order &amp;&amp; comparators[i]) {
 order = comparators[i++](a, b);
 }
 
 return order;
 };
 }
</code></pre>
I like it, because it takes and return sort comparator. So if you have a collection of other comparators, they are easy to use.
Then you can simplify a bit your life with an additional helper. This one return a sort comparator based on the result of the passed lambda over each items.
<pre><code> type Comparable = string | number;

 /**
 * Returns a comparator which use an evaluationFunc on each item for comparison
 */
 function lambdaComparator&lt;T&gt;(evaluationFunc: ((item: T) =&gt; Comparable), reversed = false): Comparator&lt;T&gt; {
 return (a: T, b: T) =&gt; {
 const valA = evaluationFunc(a);
 const valB = evaluationFunc(b);
 let order = 0;
 
 if (valA &lt; valB) {
 order = -1;
 } else if (valA &gt; valB) {
 order = 1;
 }
 return reversed ? -order : order;
 };
 }
</code></pre>
<code>reversed</code> here is not required to answer the question, but will allow to reverse the order easily.
To answer the question specifically, using our two comparators:
<pre><code> arr.sort(chainedComparator(
 lambdaComparator(a =&gt; a.item1),
 lambdaComparator(a =&gt; a.item2.toLowerCase()) // &quot;banana&quot; before &quot;Melon&quot;
 ));
</code></pre>
Because the original question was in pure JavaScript, precision: If you're not accustomed to TypeScript, you can get normal JavaScript just by removing the typing <code>&lt;T&gt;</code>, <code>: T</code>, <code>: ((item: T) =&gt; Comparable)</code> everywhere and the two <code>type</code> lines out.

blocks|key|586683|text|您可以只使用npm导入type-comparator，然后使用queue进行链接：|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|586684|const+comparator+=+queue([
++++map(x+=>+x.item1,+asc),
++++map(x+=>+x.item2,+asc)
]);
arr.sort(comparator);|code-block|syntax|javascript|586685|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lightness/type-comparator|1|https://github.com/lightness/type-comparator#function-queuecomparators^0|B|F|0|V|5|1|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]|$A|W|B|X|1|Y]]|C|$]]|$1|D|3|E|5|F|7|Z|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|10|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]|Q|$5|L|M|N|C|$O|R]]]]

You can just import <a href="https://github.com/lightness/type-comparator" rel="nofollow noreferrer">type-comparator</a> with npm and then use <a href="https://github.com/lightness/type-comparator#function-queuecomparators" rel="nofollow noreferrer">queue</a> to do the chaining:
<pre><code>const comparator = queue([
 map(x =&gt; x.item1, asc),
 map(x =&gt; x.item2, asc)
]);
arr.sort(comparator);
</code></pre>

I have an array of objects of the following form:

<pre><code>arr[0] = { 'item1' : 1234, 'item2' : 'a string' };
</code></pre>

I sort it first by <code>'item1'</code> which is straightforward. Now i want to sort <code>arr</code> (which is sorted by <code>'item1'</code>) again but this time by <code>'item2'</code> but only for the elements where <code>'item1'</code> is the same. The final array would look like:

<pre><code>arr = [
 { 'item1' : 1234, 'item2' : 'apple' },
 { 'item1' : 1234, 'item2' : 'banana' },
 { 'item1' : 1234, 'item2' : 'custard' },
 { 'item1' : 2156, 'item2' : 'melon' },
 { 'item1' : 4345, 'item2' : 'asparagus' } 
];
</code></pre>

I tried to write a sorting function for the second case like so:

<pre><code>arr.sort(function(a,b){
 if(a.item1 === b.item1){
 return a.item2 &gt; b.item2 ? 1 : a.item2 &lt; b.item2 : -1 : 0;
 }
});
</code></pre>

I could combine the two sorts in one function to get the final sorted array but there will be cases where I'll have to sort by just <code>'item1'</code> or just <code>'item2'</code>.

Javascript sort custom comparator function - sorting a sorted array

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我有一个以下形式的对象数组：arr[0] = { 'item1' : 1234, 'item2' : 'a string' };我首先根据'item1'对它进行排序，这很简单。现在，我想再次对arr (按'item1'排序)进行排序，但这次是按'item2'排序，但仅针对'item1'相同的元素。最终的数组将如下所示：...

问Javascript排序自定义比较器函数-对排序的数组进行排序
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Javascript排序自定义比较器函数-对排序的数组进行排序EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Javascript排序自定义比较器函数-对排序的数组进行排序
EN