Initialize TreeSet in Java - Java 147

Initialize TreeSet in Java – Java 147

Initialize TreeSet in Java

初始化 TreeSet 元素不能直接用於基本類型,如 int 、 char 等,必須將基本型別其包裝成類別,才能存入集合,介紹常見的 add 、 addAll 、 doubleBrace 等方法,了解初始化 Set 的不同操作和方法, Initialize TreeSet Java 會隨著元素增加或移除,大小自動增長或縮小,本篇增加了範例,並透過單元測試來驗證產出結果。

檔案目錄

./
   +- src
       +- test
       |   +- org
       |       +- ruoxue
       |           +- java_147
       |               +- set
       |                   +- treeset
       |                       +- InitializeTreeSetTest.java   

單元測試

Java Initialize TreeSet 提供初始化操作 Set 中的元素。

Fruit

Java Initialize TreeSet 建立 Fruit 物件,覆寫 equals 、 hashCode ,定義屬性和方法,用來建立一個物件。

	@NoArgsConstructor
	@Getter
	@Setter
	@Builder
	public static class Fruit implements Comparable<Fruit> {

		private String name;
		private double quantity;
		private int type;

		public Fruit(String name, double quantity, int type) {
			this.name = name;
			this.quantity = quantity;
			this.type = type;
		}

		public String toString() {
			ToStringBuilder builder = new ToStringBuilder(this, ToStringStyle.JSON_STYLE);
			builder.appendSuper(super.toString());
			builder.append("name", name);
			builder.append("quantity", quantity);
			builder.append("type", type);
			return builder.toString();
		}

		public boolean equals(Object object) {
			if (!(object instanceof Fruit)) {
				return false;
			}
			if (this == object) {
				return true;
			}
			Fruit other = (Fruit) object;
			return new EqualsBuilder().append(getName(), other.getName()).isEquals();
		}

		public int hashCode() {
			return new HashCodeBuilder().append(getName()).toHashCode();
		}

		@Override
		public int compareTo(Fruit o) {
			return this.name.compareTo(o.name);
		}
	}

add

Java Initialize TreeSet 建立一個 TreeSet ,初始化三個元素。

	@Test
	public void add() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		System.out.println(set);
		assertEquals(expectedSize, set.size());
	}
[{"name":"Longan","quantity":1.0,"type":1}, {"name":"Pear","quantity":2.0,"type":1}, {"name":"Tomato","quantity":3.0,"type":1}]

doubleBrace

Java Initialize TreeSet 建立一個 TreeSet ,初始化三個元素,代表建立並載入一個新的類別,對效能有不良影響。

	@Test
	public void doubleBrace() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>() {
			private static final long serialVersionUID = -1234223135233714632L;
			{
				add(new Fruit("Longan", 1, 1));
				add(new Fruit("Tomato", 3, 1));
				add(new Fruit("Pear", 2, 1));
			}
		};
		System.out.println(set);
		assertEquals(expectedSize, set.size());
	}
[{"name":"Longan","quantity":1.0,"type":1}, {"name":"Pear","quantity":2.0,"type":1}, {"name":"Tomato","quantity":3.0,"type":1}]

addAll

Java Initialize TreeSet 建立兩個 TreeSet ,使用給定的 Set 物件,初始化三個元素。

	@Test
	public void addAll() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		Set<Fruit> newSet = new TreeSet<Fruit>();
		newSet.addAll(set);
		System.out.println(newSet);
		assertEquals(expectedSize, newSet.size());
	}
[{"name":"Longan","quantity":1.0,"type":1}, {"name":"Pear","quantity":2.0,"type":1}, {"name":"Tomato","quantity":3.0,"type":1}]

constructor

Java Initialize TreeSet 建立一個 TreeSet ,初始化三個元素。

	@Test
	public void constructor() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		Set<Fruit> newSet = new TreeSet<Fruit>(set);
		System.out.println(newSet);
		assertEquals(expectedSize, newSet.size());
	}
[{"name":"Longan","quantity":1.0,"type":1}, {"name":"Pear","quantity":2.0,"type":1}, {"name":"Tomato","quantity":3.0,"type":1}]

comparator

TreeSet Initialization Java 建構子傳入 Comparator 參數,建立一個 TreeSet ,初始化三個元素。

	@Test
	public void comparator() {
		int expectedSize = 3;
		Comparator<Fruit> quantityComparator = (o, o2) -> Double.compare(o.quantity, o2.quantity);
		Set<Fruit> set = new TreeSet<Fruit>(quantityComparator);
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		System.out.println(set);
		assertEquals(expectedSize, set.size());
	}
[{"name":"Longan","quantity":1.0,"type":1}, {"name":"Pear","quantity":2.0,"type":1}, {"name":"Tomato","quantity":3.0,"type":1}]

sortedSet

TreeSet Initialization Java 建構子傳入 SortedSet 參數,建立一個 TreeSet ,初始化三個元素。

	@Test
	public void sortedSet() {
		int expectedSize = 3;
		SortedSet<Fruit> set = new ConcurrentSkipListSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		Set<Fruit> newSet = new TreeSet<>(set);
		System.out.println(newSet);
		assertEquals(expectedSize, newSet.size());
	}
[{"name":"Longan","quantity":1.0,"type":1}, {"name":"Pear","quantity":2.0,"type":1}, {"name":"Tomato","quantity":3.0,"type":1}]

InitializeTreeSetTest.java

TreeSet Initialization Java 新增單元測試,驗證 Java TreeSet Initialize 是否符合預期。

package org.ruoxue.java_147.set.treeset;

import static org.junit.Assert.*;
import java.util.TreeSet;
import java.util.concurrent.ConcurrentSkipListSet;
import java.util.Comparator;
import java.util.Set;
import java.util.SortedSet;

import org.apache.commons.lang3.builder.EqualsBuilder;
import org.apache.commons.lang3.builder.HashCodeBuilder;
import org.apache.commons.lang3.builder.ToStringBuilder;
import org.apache.commons.lang3.builder.ToStringStyle;
import org.junit.Test;

import lombok.Builder;
import lombok.Getter;
import lombok.NoArgsConstructor;
import lombok.Setter;

public class InitializeTreeSetTest {

	@NoArgsConstructor
	@Getter
	@Setter
	@Builder
	public static class Fruit implements Comparable<Fruit> {

		private String name;
		private double quantity;
		private int type;

		public Fruit(String name, double quantity, int type) {
			this.name = name;
			this.quantity = quantity;
			this.type = type;
		}

		public String toString() {
			ToStringBuilder builder = new ToStringBuilder(this, ToStringStyle.JSON_STYLE);
			builder.appendSuper(super.toString());
			builder.append("name", name);
			builder.append("quantity", quantity);
			builder.append("type", type);
			return builder.toString();
		}

		public boolean equals(Object object) {
			if (!(object instanceof Fruit)) {
				return false;
			}
			if (this == object) {
				return true;
			}
			Fruit other = (Fruit) object;
			return new EqualsBuilder().append(getName(), other.getName()).isEquals();
		}

		public int hashCode() {
			return new HashCodeBuilder().append(getName()).toHashCode();
		}

		@Override
		public int compareTo(Fruit o) {
			return this.name.compareTo(o.name);
		}
	}

	@Test
	public void add() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		System.out.println(set);
		assertEquals(expectedSize, set.size());
	}

	@Test
	public void doubleBrace() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>() {
			private static final long serialVersionUID = -1234223135233714632L;
			{
				add(new Fruit("Longan", 1, 1));
				add(new Fruit("Tomato", 3, 1));
				add(new Fruit("Pear", 2, 1));
			}
		};
		System.out.println(set);
		assertEquals(expectedSize, set.size());
	}

	@Test
	public void addAll() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		Set<Fruit> newSet = new TreeSet<Fruit>();
		newSet.addAll(set);
		System.out.println(newSet);
		assertEquals(expectedSize, newSet.size());
	}

	@Test
	public void constructor() {
		int expectedSize = 3;
		Set<Fruit> set = new TreeSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		Set<Fruit> newSet = new TreeSet<Fruit>(set);
		System.out.println(newSet);
		assertEquals(expectedSize, newSet.size());
	}

	@Test
	public void comparator() {
		int expectedSize = 3;
		Comparator<Fruit> quantityComparator = (o, o2) -> Double.compare(o.quantity, o2.quantity);
		Set<Fruit> set = new TreeSet<Fruit>(quantityComparator);
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		System.out.println(set);
		assertEquals(expectedSize, set.size());
	}

	@Test
	public void sortedSet() {
		int expectedSize = 3;
		SortedSet<Fruit> set = new ConcurrentSkipListSet<Fruit>();
		set.add(new Fruit("Longan", 1, 1));
		set.add(new Fruit("Tomato", 3, 1));
		set.add(new Fruit("Pear", 2, 1));
		Set<Fruit> newSet = new TreeSet<>(set);
		System.out.println(newSet);
		assertEquals(expectedSize, newSet.size());
	}
}

心得分享

Java TreeSet Initialize 初始化 Set ,依照元素排序,元素不會重複儲存,具有唯一性,是一個非同步的操作,TreeSet Initialization Java 提供了幾種 TreeSet 初始化的操作範例,使用單元測試驗證產出結果。

發佈留言