Java 從Set里面取出有序的記錄詳解及實(shí)例
創(chuàng)新互聯(lián)公司專注為客戶提供全方位的互聯(lián)網(wǎng)綜合服務(wù),包含不限于成都做網(wǎng)站、網(wǎng)站建設(shè)、外貿(mào)營銷網(wǎng)站建設(shè)、科爾沁右翼中網(wǎng)絡(luò)推廣、小程序制作、科爾沁右翼中網(wǎng)絡(luò)營銷、科爾沁右翼中企業(yè)策劃、科爾沁右翼中品牌公關(guān)、搜索引擎seo、人物專訪、企業(yè)宣傳片、企業(yè)代運(yùn)營等,從售前售中售后,我們都將竭誠為您服務(wù),您的肯定,是我們最大的嘉獎(jiǎng);創(chuàng)新互聯(lián)公司為所有大學(xué)生創(chuàng)業(yè)者提供科爾沁右翼中建站搭建服務(wù),24小時(shí)服務(wù)熱線:13518219792,官方網(wǎng)址:chinadenli.net
Set里面的記錄是無序的,如果想使用Set,然后又想里面的記錄是有序的,就可以使用TreeSet,而不是HashSet,在使用TreeSet的時(shí)候,里面的元素必須是實(shí)現(xiàn)了Comparable接口的,TreeSet在進(jìn)行排序的時(shí)候就是通過比較它們的Comparable接口的實(shí)現(xiàn)!
下面是HashSet的無序和TreeSet的有序的比較:
Test類:
import java.util.HashSet; import java.util.Iterator; import java.util.Set; import java.util.TreeSet; public class Test { public static void main(String args[]) { useHashSet(); useTreeSet(); } /** * Set默認(rèn)是無序的,一般從Set里面拿出來的數(shù)據(jù)每次的順序都會(huì)是不一樣的,如果想里面的順序一樣 * 就使用TreeSet */ public static void useHashSet() { System.out.println("-----------------HashSet Start------------------"); Set<User> set = new HashSet<User>(); for (int i = 0; i < 10; i++) { User user = new User((i + 1), "uname" + (i + 1), "pswd" + (i + 1)); set.add(user); } Iterator<User> iter = set.iterator(); while (iter.hasNext()) System.out.println(iter.next()); System.out.println("------------------HashSet End----------------------"); } /** * TreeSet是有序的,TreeSet在給里面的元素排序是通過它們的Comparable接口的實(shí)現(xiàn)來比較的,所以, * 如果里面的對(duì)象沒有實(shí)現(xiàn)Comparable接口,則TreeSet在運(yùn)行時(shí)就會(huì)報(bào)錯(cuò),所以如果想從Set里面拿出來的數(shù)據(jù)是 * 有序的就得使里面的對(duì)象實(shí)現(xiàn)Comparable接口,User2是實(shí)現(xiàn)了Comparable接口的,并對(duì)它們的id進(jìn)行比較,id大 * 的就會(huì)排在后面 */ public static void useTreeSet() { System.out.println("-----------------TreeSet Start------------------"); Set<User2> set = new TreeSet<User2>(); for (int i = 0; i < 10; i++) { User2 user = new User2((i + 1), "uname" + (i + 1), "pswd" + (i + 1)); set.add(user); } Iterator<User2> iter = set.iterator(); while (iter.hasNext()) System.out.println(iter.next()); System.out.println("------------------TreeSet End----------------------"); } }
User類:
public class User { private int id; private String username; private String password; public User() { } public User(int id, String username, String password) { this.id = id; this.username = username; this.password = password; } public int getId() { return id; } public void setId(int id) { this.id = id; } public String getUsername() { return username; } public void setUsername(String username) { this.username = username; } public String getPassword() { return password; } public void setPassword(String password) { this.password = password; } @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + id; return result; } @Override public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (getClass() != obj.getClass()) return false; User other = (User) obj; if (id != other.id) return false; return true; } @Override public String toString() { return " id = " + id + ", \r\n username = " + username + ", \r\n password = " + password; } }
User2類:
public class User2 implements Comparable<User2> { private int id; private String username; private String password; public User2() { } public User2(int id, String username, String password) { this.id = id; this.username = username; this.password = password; } public int getId() { return id; } public void setId(int id) { this.id = id; } public String getUsername() { return username; } public void setUsername(String username) { this.username = username; } public String getPassword() { return password; } public void setPassword(String password) { this.password = password; } @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + id; return result; } @Override public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (getClass() != obj.getClass()) return false; User2 other = (User2) obj; if (id != other.id) return false; return true; } @Override public String toString() { return " id = " + id + ", \r\n username = " + username + ", \r\n password = " + password; } @Override public int compareTo(User2 user) { // TODO Auto-generated method stub //這里我的實(shí)現(xiàn)是按照id進(jìn)行排序 if (user == null) return 1; if (id > user.getId()) return 1; else if (id == user.getId()) return 0; else return -1; } }
運(yùn)行結(jié)果:
-----------------HashSet Start------------------ id = 3, username = uname3, password = pswd3 id = 4, username = uname4, password = pswd4 id = 1, username = uname1, password = pswd1 id = 2, username = uname2, password = pswd2 id = 7, username = uname7, password = pswd7 id = 8, username = uname8, password = pswd8 id = 5, username = uname5, password = pswd5 id = 6, username = uname6, password = pswd6 id = 9, username = uname9, password = pswd9 id = 10, username = uname10, password = pswd10 ------------------HashSet End---------------------- -----------------TreeSet Start------------------ id = 1, username = uname1, password = pswd1 id = 2, username = uname2, password = pswd2 id = 3, username = uname3, password = pswd3 id = 4, username = uname4, password = pswd4 id = 5, username = uname5, password = pswd5 id = 6, username = uname6, password = pswd6 id = 7, username = uname7, password = pswd7 id = 8, username = uname8, password = pswd8 id = 9, username = uname9, password = pswd9 id = 10, username = uname10, password = pswd10 ------------------TreeSet End----------------------
感謝閱讀,希望能幫助到大家,謝謝大家對(duì)本站的支持!
本文名稱:Java從Set里面取出有序的記錄詳解及實(shí)例
網(wǎng)頁URL:http://chinadenli.net/article22/jsepjc.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供云服務(wù)器、網(wǎng)站設(shè)計(jì)、品牌網(wǎng)站建設(shè)、定制開發(fā)、網(wǎng)頁設(shè)計(jì)公司、做網(wǎng)站
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請(qǐng)盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場,如需處理請(qǐng)聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來源: 創(chuàng)新互聯(lián)