// Arup Guha
// 10/28/2026
// Example program using TreeSet

import java.util.*;

public class TestTreeSet {

	public static void main(String[] args) {

		Random rndObj = new Random();
		
		// Object we're testing.
		TreeSet<Integer> myTreeSet = new TreeSet<Integer>();
		
		// 30 random tests.
		for (int loop=0; loop<30; loop++) {
		
			// Add a random value.
			int add = rndObj.nextInt(100);
			System.out.println("adding "+add);
			myTreeSet.add(add);
			
			// Test below.
			int x = rndObj.nextInt(100);
			Integer below = myTreeSet.lower(x);
			
			// Print out result.
			if (below != null)
				System.out.println("largest int < "+x+" is "+below);
			else
				System.out.println("nothing less than "+x);
			
			// Test floor and print.
			Integer myF = myTreeSet.floor(x);
			if (myF != null)
				System.out.println("largest int <= "+x+" is "+below);
			else
				System.out.println("nothing <= "+x);
				
			// Test above.
			Integer above = myTreeSet.higher(x);
			if (above != null)
				System.out.println("largest int > "+x+" is "+above);
			else
				System.out.println("nothing > "+x);
			
			// Test ceiling.
			Integer myC = myTreeSet.ceiling(x);
			if (myC != null)
				System.out.println("largest int >= "+x+" is "+myC);
			else
				System.out.println("nothing >= "+x);
		}
		
		// Remove everything in order...
		while (myTreeSet.size() > 0) {
			System.out.println("polling "+myTreeSet.pollFirst());
		}
	}

}