/**
 * Ntanasis Periklis - A.M.:3070130
 * Chatzipetros Mike - A.M.:3070175
 *
 * check LICENSE.txt in the parent directory
 *
 * The MIT License
 *
 * Copyright (c) 2009 Ntanasis Periklis and Chatzipetors Mike
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

package djchord;

import basic.SHA1;
import basic.SHAhash;
import java.io.UnsupportedEncodingException;
import java.security.NoSuchAlgorithmException;

/**
 *
 *@author Ntanasis Periklis and Chatzipetros Mike
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws NoSuchAlgorithmException, UnsupportedEncodingException {
        // TODO code application logic here

        //test code goes here!
        SHAhash a,b;
        a = SHA1.getHash("hi");
        b = SHA1.getHash("toast");

        System.out.println("The hashes are:\n"+a+"\n"+b);
        System.out.println("c".compareTo("2"));
        //when the result of compareTo
        System.out.println(a.getStringHash().compareTo(b.getStringHash()));//the correct order is numbers < capital letters < non capital letters
    }

}

@@ -1691,53 +1691,8 @@
 n %7B%0A
-        // TODO code application logic here%0A%0A
     
@@ -1900,22 +1900,68 @@
 %22c%22.
-compareTo(%222%22)
+getBytes()%5B0%5D);%0A        System.out.println(%222%22.getBytes()%5B0%5D
 );%0A 
@@ -2031,51 +2031,19 @@
 n(a.
-getStringHash().compareTo(b.getStringHash()
+compareTo(b
 ));/
@@ -2120,9 +2120,8 @@
     %7D%0A%0A%7D
-%0A

test main