JAVA/CollectionFramework/TreeSet

package day18;

import java.util.Set;
import java.util.TreeSet;
import java.*;

public class Test11 {
	public static void main(String[] args) {
		TreeSet<Integer> tsi = new TreeSet<Integer>();
		TreeSet<String> tss = new TreeSet<String>();
		
		for(int i = 0 ; i<6;i++) {
		tsi.add((int)(Math.random()*46));
		}
		System.out.println(tsi);
		System.out.println(tsi.headSet(20));
		System.out.println(tsi.tailSet(20));
		
		tss.add("apple");
		tss.add("kiwi");
		tss.add("orange");
		tss.add("melon");
		tss.add("watermelon");
		tss.add("banana");
		tss.add("peach");
		tss.add("pineapple");
		System.out.println(tss);
		System.out.println(tss.subSet("m","y"));
	}

}

※개념정리

 

TreeSet<Integer> tsi = new TreeSet<Integer>( );

tsi.headSet(숫자) = [tsi 객체 < 숫자] 반환

tsi.tailSet(숫자) = [tsi 객체 > 숫자] 반환

 

TreeSet<String> tss = new TreeSet<String>( );

tss.subSet("F","T"); = F부터 T까지의 객체를 가진것들 반환