siddeshpillai/distributedsorting

Distributed Sorting on raspberry pis.

DistributedSorting

Distributed Sorting on raspberry pis.

http://www.jcraft.com/jsch/

distributedsorting's Issues

Tasks for the break

• Documentation. @parthsawant1991

Comparator Investigate

Comparator<String> comparator = new Comparator<String>() {
    public int compare(String a, String b) {
        Pattern pattern = Pattern.compile("[a-zA-Z]");
        Matcher match;

        // take the first characters
        int a_first = (int)a.charAt(0);
        int b_first = (int)b.charAt(0);

        String sa_1;
        String sa_2;
        String sb_1;
        String sb_2;

        int count;

        // check if the prefix is a number
        if(48 <= a_first && a_first <= 57) {
            sa_1 = "";
            sa_2 = a;
        }

        else {
            match = pattern.matcher(a);
            count = 0;
            while(match.find()) {
                count++;
            }
            sa_1 = a.substring(0, count);
            sa_2 = a.substring(count);
        }

        if(48 <= b_first && b_first <= 57) {
            sb_1 = "";
            sb_2 = b;
        }
        else {
            match = pattern.matcher(b);
            count = 0;
            while(match.find()) {
                count++;
            }
            sb_1 = b.substring(0, count);
            sb_2 = b.substring(count);  
        }

        if(a.compareTo(b) == 0) {
            return 1;
        }

        else {
            if(sa_1 != null && sb_1 != null) {
                if(sa_1.compareTo(sb_1) < 0) {
                    return 1;

                } else if (sa_1.compareTo(sb_1) > 0) {
                    return -1;
                }

                else {
                    if(!sa_2.equals("") && !sb_2.equals("")) {
                        int sa_int = Integer.parseInt(sa_2);
                        int sb_int = Integer.parseInt(sb_2);

                        if(sa_int < sb_int) {
                            return 1;
                        } 
                        else {
                            return -1;
                        }
                    } else {
                        if(sa_2.equals("")) {
                            return 1;
                        }
                        else {
                            return -1;
                        }
                    }   
                }       
            }
        }
        return 1;   
    }
};