The Big Programming Thread - Page 773

import java.awt.EventQueue;
import java.awt.event.WindowEvent;
import java.awt.event.WindowListener;

import javax.swing.JFrame;

public class TestApp {
	
	public static void main(String[] args) {
		EventQueue.invokeLater(() -> new TestApp());
	}
	
	private JFrame frame;
	
	public TestApp() {
		frame = new JFrame("Test App");
		frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
		frame.setSize(640, 480);
		frame.setLocationRelativeTo(null);
		
		// This is an annonymous inner class of type WindowListener
		frame.addWindowListener(new WindowListener() {
			@Override
			public void windowOpened(WindowEvent e) {
				System.out.println("TestApp.windowOpened()");
			}
			@Override
			public void windowIconified(WindowEvent e) {
				System.out.println("TestApp.windowIconified()");
			}
			@Override
			public void windowDeiconified(WindowEvent e) {
				System.out.println("TestApp.windowDeiconified()");
			}
			@Override
			public void windowDeactivated(WindowEvent e) {
				System.out.println("TestApp.windowDeactivated()");
			}
			@Override
			public void windowClosing(WindowEvent e) {
				System.out.println("TestApp.windowClosing()");
			}
			@Override
			public void windowClosed(WindowEvent e) {
				System.out.println("TestApp.windowClosed()");
			}
			@Override
			public void windowActivated(WindowEvent e) {
				System.out.println("TestApp.windowActivated()");
			}
		});// End of the annonymous inner class.
		
		frame.setVisible(true);
	}
}

		public T next() {
			if (this.hasNext()) {
				int current = cursor;
				cursor++;
				
				//Time to sort them
		T sortedLeft, sortedMid = null, sortedRight;		
				
		if(left.compareTo(middle) < 0){
			sortedLeft = left;
		}	else	{
			sortedLeft = middle;
		}
		if(right.compareTo(sortedLeft) < 0){
			sortedLeft = right;
		}
		
		if(left.compareTo(middle) > 0){
			sortedRight = left;
		}	else	{
			sortedRight = middle;
		}
		if(right.compareTo(sortedRight) > 0){
			sortedRight = right;
		}
		
		if(middle.compareTo(sortedRight) == 0 && middle.compareTo(sortedLeft) == 0) {
			sortedMid = middle;
		}
		
		if(middle != sortedLeft && middle != sortedRight){
			sortedMid = middle;
		}
		if(left != sortedLeft && left != sortedRight){
			sortedMid = left;
		}
		if(right != sortedLeft && right != sortedRight){
			sortedMid = middle;
		}
		if(sortedMid == null){
			sortedMid = middle;
		}
		
		
		if(current == 0 ) {
			return sortedLeft;
		}
		if(current == 1) {
			return sortedMid;
		}
		if(current == 2) {
			return sortedRight;
		}
		
		
		
		
	
		}
			throw new NoSuchElementException();
	}