2. 程式人生 > >Java 8 list 物件欄位升序降序

Java 8 list 物件欄位升序降序

阿新 • • 發佈：2018-12-25

原文：https://www.concretepage.com/java/jdk-8/java-8-stream-sorted-example

Stream sorted() using Natural Ordering, Comparator and Reverse Ordering

Find the syntax of sorted() method. 

1. sorted(): It sorts the elements of stream using natural ordering. The element class must implement Comparable interface. 

2. 
sorted(Comparator<? super T> comparator): Here we create an instance of Comparator using lambda expression. We can sort the stream elements in ascending and descending order. 

The following line of code will sort the list in natural ordering.
list.stream().sorted()
To reverse the natural ordering 
Comparator provides reverseOrder() method. We use it as follows.
list.stream().sorted(Comparator.reverseOrder())
The following line of code is using Comparator to sort the list.
list.stream().sorted(Comparator.comparing(Student::getAge))
To reverse the ordering, Comparator provides reversed() method. We use this method as follows.

list.stream().sorted(Comparator.comparing(Student::getAge).reversed())

Stream sorted() with List

Here we are sorting a List of objects of Student class. First we will sort by natural ordering and then using Comparator. We will reverse both ordering natural ordering as well as ordering provided by Comparator in our example. 
SortList.java
package com.concretepage;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.stream.Collectors;
public class SortList {
	public static void main(String[] args) {
		List<Student> list = new ArrayList<Student>();
		list.add(new Student(1, "Mahesh", 12));
		list.add(new Student(2, "Suresh", 15));
		list.add(new Student(3, "Nilesh", 10));
		
		System.out.println("---Natural Sorting by Name---");
		List<Student> slist = list.stream().sorted().collect(Collectors.toList());
		slist.forEach(e -> System.out.println("Id:"+ e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));
		
		System.out.println("---Natural Sorting by Name in reverse order---");
		slist = list.stream().sorted(Comparator.reverseOrder()).collect(Collectors.toList());
		slist.forEach(e -> System.out.println("Id:"+ e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));		
		
		System.out.println("---Sorting using Comparator by Age---");
		slist = list.stream().sorted(Comparator.comparing(Student::getAge)).collect(Collectors.toList());
		slist.forEach(e -> System.out.println("Id:"+ e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));
		
		System.out.println("---Sorting using Comparator by Age with reverse order---");
		slist = list.stream().sorted(Comparator.comparing(Student::getAge).reversed()).collect(Collectors.toList());
		slist.forEach(e -> System.out.println("Id:"+ e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));
	}
}
Student.java
package com.concretepage;
public class Student implements Comparable<Student> {
	private int id;
	private String name;
	private int age;
	public Student(int id, String name, int age) {
		this.id = id;
		this.name = name;
		this.age = age;
	}
	public int getId() {
		return id;
	}
	public String getName() {
		return name;
	}
	public int getAge() {
		return age;
	}
	@Override
	public int compareTo(Student ob) {
		return name.compareTo(ob.getName());
	}
        @Override
        public boolean equals(final Object obj) {
          if (obj == null) {
             return false;
          }
          final Student std = (Student) obj;
          if (this == std) {
             return true;
          } else {
             return (this.name.equals(std.name) && (this.age == std.age));
          }
        }
        @Override
        public int hashCode() {
          int hashno = 7;
          hashno = 13 * hashno + (name == null ? 0 : name.hashCode());
          return hashno;
        }	
}
Output
---Natural Sorting by Name---
Id:1, Name: Mahesh, Age:12
Id:3, Name: Nilesh, Age:10
Id:2, Name: Suresh, Age:15
---Natural Sorting by Name in reverse order---
Id:2, Name: Suresh, Age:15
Id:3, Name: Nilesh, Age:10
Id:1, Name: Mahesh, Age:12
---Sorting using Comparator by Age---
Id:3, Name: Nilesh, Age:10
Id:1, Name: Mahesh, Age:12
Id:2, Name: Suresh, Age:15
---Sorting using Comparator by Age with reverse order---
Id:2, Name: Suresh, Age:15
Id:1, Name: Mahesh, Age:12
Id:3, Name: Nilesh, Age:10

Stream sorted() with Set

Here we are sorting the Set of objects of Student class. This class must override equals() and hashCode()methods to identify unique elements. For natural ordering Student class needs to implement Comparableinterface. In our example we will sort our Set using natural ordering as well as ordering provided by Comparator. 
SortSet.java
package com.concretepage;
import java.util.Comparator;
import java.util.HashSet;
import java.util.Set;
public class SortSet {
	public static void main(String[] args) {
		Set<Student> set = new HashSet<Student>();
		set.add(new Student(1, "Mahesh", 12));
		set.add(new Student(2, "Suresh", 15));
		set.add(new Student(3, "Nilesh", 10));
		
		System.out.println("---Natural Sorting by Name---");
		set.stream().sorted().forEach(e -> System.out.println("Id:"
		          + e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));
		
		System.out.println("---Natural Sorting by Name in reverse order---");
		set.stream().sorted(Comparator.reverseOrder()).forEach(e -> System.out.println("Id:"
		          + e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));		
		
		System.out.println("---Sorting using Comparator by Age---");
		set.stream().sorted(Comparator.comparing(Student::getAge))
		  .forEach(e -> System.out.println("Id:"+ e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));
		
		System.out.println("---Sorting using Comparator by Age in reverse order---");
		set.stream().sorted(Comparator.comparing(Student::getAge).reversed())
		  .forEach(e -> System.out.println("Id:"+ e.getId()+", Name: "+e.getName()+", Age:"+e.getAge()));
	}
}
Output
---Natural Sorting by Name---
Id:1, Name: Mahesh, Age:12
Id:3, Name: Nilesh, Age:10
Id:2, Name: Suresh, Age:15
---Natural Sorting by Name in reverse order---
Id:2, Name: Suresh, Age:15
Id:3, Name: Nilesh, Age:10
Id:1, Name: Mahesh, Age:12
---Sorting using Comparator by Age---
Id:3, Name: Nilesh, Age:10
Id:1, Name: Mahesh, Age:12
Id:2, Name: Suresh, Age:15
---Sorting using Comparator by Age in reverse order---
Id:2, Name: Suresh, Age:15
Id:1, Name: Mahesh, Age:12
Id:3, Name: Nilesh, Age:10

Stream sorted() with Map

Here we are sorting a Map by key as well as value. 
SortMap.java
package com.concretepage;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
public class SortMap {
	public static void main(String[] args) {
		Map<Integer, String> map = new HashMap<>();
		map.put(15, "Mahesh");
		map.put(10, "Suresh");
		map.put(30, "Nilesh");
		
		System.out.println("---Sort by Map Value---");
	        map.entrySet().stream().sorted(Comparator.comparing(Map.Entry::getValue))
	          .forEach(e -> System.out.println("Key: "+ e.getKey() +", Value: "+ e.getValue()));

		System.out.println("---Sort by Map Key---");
	        map.entrySet().stream().sorted(Comparator.comparing(Map.Entry::getKey))
	          .forEach(e -> System.out.println("Key: "+ e.getKey() +", Value: "+ e.getValue()));
	}
}
Output
---Sort by Map Value---
Key: 15, Value: Mahesh
Key: 30, Value: Nilesh
Key: 10, Value: Suresh
---Sort by Map Key---
Key: 10, Value: Suresh
Key: 15, Value: Mahesh
Key: 30, Value: Nilesh
Here we are sorting a map whose values are custom objects. 
SortMapOfCustomObject.java
package com.concretepage;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
public class SortMapOfCustomObject {
	public static void main(String[] args) {
		Map<Integer, Student> map = new HashMap<>();
		map.put(1, new Student(1, "Mahesh", 12));
		map.put(2, new Student(2, "Suresh", 15));
		map.put(3, new Student(3, "Nilesh", 10));
                //Map Sorting by Value i.e student's natural ordering i.e by name
	        map.entrySet().stream().sorted(Comparator.comparing(Map.Entry::getValue))
	    	.forEach(e -> {
				Integer key = (Integer)e.getKey();
				Student std = (Student)e.getValue();
	    		System.out.println("Key: " + key +", value: ("+ std.getId() +", "+ std.getName()+", "+ std.getAge()+")"); 
	    	});
	}
}
Output
Key: 1, value: (1, Mahesh, 12)
Key: 3, value: (3, Nilesh, 10)
Key: 2, value: (2, Suresh, 15)

相關推薦

Java 8 list 物件欄位升序降序

原文：https://www.concretepage.com/java/jdk-8/java-8-stream-sorted-exampleStream sorted() using Natural Ordering, Comparator and Reverse Orde

mysql8基礎 select...order by...desc 按照一個欄位進行降序排列

資料，資料，命根就在資料 ! 操作資料庫時，一定要謹慎小心。師萬物 這裡的程式碼看看就好，要有自己的判斷。遇到抉擇，要不恥上下問。 example stu@Ubuntu:~$ mysql -u root -p Enter password: Welc

java 之list集合按照欄位升序或降序

實體類我就不寫了，直接上資料吧！ List<PersionInfo> list=new ArrayList<>(); PersionInfo info1=new Per

MySQL中的升序降序以及欄位的升序降序

MySQL中 升序為asc 降序為desc 例如：            升序：select   *  from  表名 order by  表中的欄位 asc(

java list集合資料升序降序排序

1，Sting型別的List集合排序 List<String> list=new ArrayList<>();         list.add("易皇星");         list.add("阿弟");         list.add("冰球

java List 根據某個欄位進行升降序排列

開發十年，就只剩下這套架構體系了！ >>>   

jsp頁面中JSTL/EL標籤引用java後臺靜態static欄位的方法總結

分享一下我老師大神的人工智慧教程！零基礎，通俗易懂！http://blog.csdn.net/jiangjunshow 也歡迎大家轉載本篇文章。分享知識，造福人民，實現我們中華民族偉大復興！        

list按照欄位去重

private static ArrayList<InformationDetailVo> removeDuplicate(List<InformationDetailVo> list) { Set<InformationDetailVo&g

Mybatis框架--Ibatis框架踩坑01 -- Java中BigInteger型別欄位問題！

       在Mybatis框架、 Ibatis框架中， 不支援Java中的 java.math.BigInteger 型別欄位， 支援 java.math.BigDecimal 型別欄位。若Java實體類中，使用 java.math.BigInteger 型別欄位，在

java mongo 修改某個欄位值

Query query = new Query(); query.addCriteria(Criteria.where("videoNum").is(videoNum)); query.addCriteria(Criteria.where("userno").is(user

根據物件中某一屬性進行升序降序排序的javascript實現

背景知識： sort() 方法用於對陣列的元素進行排序,並返回陣列。預設排序順序是根據字串Unicode碼點。 語法：arrayObject.sort(sortby)；引數sortby可選。規定排序順序。必須是函式。 注：如果呼叫該方法時沒有使用引數，將按

[java] 取得資料庫的欄位schema

sample code: import java.sql.Connection; import java.sql.DatabaseMetaData; import java.sql.DriverManager; import java.sql.ResultSet; public class Ma

Spring mvc整合Mybatis，選擇性儲存物件欄位資料

前言 我們平時使用mybatis儲存物件資料時，經常可能只是修改其中某一倆個欄位的值，這個時候，我們為了減少資料庫更新帶來的效能、行鎖等不必要的消耗，可能會重新寫一個介面，只負責修改需要修改的值。 但是，隨著業務系統的變更，業務欄位的增加，越來越多的欄位需要

報表結果按照兩個欄位升序排列

需求背景        報表中使用select函式取數時，需要根據兩個欄位升序排列。如從僱員表（employee）中取數，並按照學歷（degree）和性別（sex）欄位升序排列。 分析        報表資料集函式ds.select()函式說明中的一個例子： 例4：ds1.

多行的資料中根據物件欄位給各個radio設值

開發中經常遇到這種情況： 後臺傳一個集合到頁面，我們需要遍歷它，常見使用<c:foreach>進行， 對各個欄位設定值。 那麼對於radio這種怎麼處理？ 當然是是使用js來完成，該例子使用Jquery解決。 如下圖一個超級簡單的頁面, 整理筆記的時候比較少，沒來得及寫個像樣點的

JAVA Map 升序|降序|隨機|去重排序

一、Map簡介 在講解Map排序之前，我們先來稍微瞭解下map。map是鍵值對的集合介面，它的實現類主要包括：HashMap,TreeMap,Hashtable以及LinkedHashMap等。其中這四者的區別如下（簡單介紹）： 1、HashMap：我們最

Java程式碼：陣列選擇排序 （升序降序）

public class test9 {public static void main(String[] args){int []a={12,2,45,65,99,3,21};System.out.println("原陣列為："+"\n"+a[0]+"\t"+a[1]+"\t

list 展示欄位過長小技巧

1、有內容的應該控制長度 <th class="center" style="width:350px;">資料簡介</th> <td> <c:choose>    <c:when test="${fn:length(v

Java TreeMap 升序|降序排列

import java.util.Comparator; import java.util.TreeMap; public class Main { public static void main(

java將list物件轉換為json字串資料顯示為空的資訊

1、首先是一個main 方法 public static void main(String[] args){ List l=new ArrayList(); ImageInfo a=