// TRIANGLE RECOGNITION
// Frans Coenen
// Tuesday 2 November 1999
// The University of Liverpool, UK

class TriangleRecog {

    // ------------------- FIELDS ------------------------
    
    private double longSide, shortSide1, shortSide2;
    
    // ------------------ METHODS -----------------------
    
    /** Three argument. Includes test to identify longest side. 
    @param sideA Input side A.
    @param sideB Input side B.
    @param sideC Input side C.		*/
    
    public TriangleRecog(double sideA, double sideB, double sideC) {
    	if (sideA > sideB) {
	     	shortSide1 = sideB;
	     	if(sideA > sideC) {
	     		longSide = sideA;
				shortSide2 = sideC;
				}
	    	else {
	        	longSide = sideC;
				shortSide2 = sideA;
				}
	    	}
		else {
	    	shortSide1 = sideA;
	    	if(sideB > sideC) {
	     		longSide = sideB;
				shortSide2 = sideC;
				}
	    	else {
	        	longSide = sideC;
				shortSide2 = sideB;
				}
	    	}
        }
    
    /** Method to check that triangle is a valid triangle (it might not be). 
    @Return false if not a valid triangle, and true otherwise */
     
    public boolean errorCheck() {
     	if (shortSide1 + shortSide2 > longSide) return(true);
		else return(false);
        }
	
    /** Method to identify equilateral and isosceles triangles. Returns true if 
    successful and false otherwise */
    
    public void equilatralOrIsosceles() {
        if (shortSide1 == shortSide2) {
            if (shortSide2 == longSide) System.out.println("Triangle is " + 
                                        "an equilateral");
            else System.out.println("TRIANGLE is an isosceles triangle");
	    	}
        else {
            if (shortSide1 == longSide || shortSide2 == longSide) 
                			System.out.println("TRIANGLE is an isosceles triangle");
            else System.out.println("TRIANGLE is an scalene triangle");

			}

    	// End TriangleRecog class	
    	}
    }