本着不放过任何一个吹嘘 Scala 机会的原则：

scala> val xs = List((1, "a", 34L), (2, "b", 35L), (3, "c", 36L))
val xs: List[(Int, String, Long)] = List((1,a,34), (2,b,35), (3,c,36))
                                                                                                                                                                                                                      
scala> xs.sortBy(x => (0-x._1, x._2))
val res0: List[(Int, String, Long)] = List((3,c,36), (2,b,35), (1,a,34))
                                                                                                                                                                                                                      
scala> xs.sortBy(x => (0-x._1, x._3))
val res1: List[(Int, String, Long)] = List((3,c,36), (2,b,35), (1,a,34))
                                                                                                                                                                                                                      
scala> xs.sortBy(_._1)
val res2: List[(Int, String, Long)] = List((1,a,34), (2,b,35), (3,c,36))


【 在 iStudy 的大作中提到: 】
: 标  题: Java 三元组用什么数据结构？
: 发信站: 水木社区 (Fri May 31 12:02:27 2024), 站内
:
: <key1,key2, Value1> 方便我对key1排序后再对key2排序。。。
:
:
: 第一想到Map<Pair<key1,key2>,Value1> 这个pair得用第三方的吧？
:
: 为什么后来的Java不出Dictionary数据结构？
:
:
:
:
:
: --
:
: ※ 来源:·水木社区 mysmth.net·[FROM: 58.37.127.*]
--
修改:xWvxYWYxvWx FROM 14.112.18.*
FROM 14.112.18.*