Puzzle.java

// Levenstain never called! It's all in the repository! Watch the first chars in git show e0cfd6. -- Joric

// Decompiled by Jad v1.5.8d. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/kpdus/jad.html
// Decompiler options: packimports(3)
// Source File Name:   Puzzle.java

import java.io.PrintStream;
import java.util.Arrays;
import java.util.Locale;

public class Puzzle
{

    public Puzzle()
    {
    }

    public static void main(String args[])
    {
        if(args.length == 1)
        {
            System.out.println("A component of software configuration management, version control, also known as revision control or source control, is the management of changes to documents, computer programs, large web sites, and other collections of information.");
            System.exit(0);
        }
        if(args.length == 2)
        {
            System.out.println("In computing, the diff utility is a data comparison tool that calculates and displays the differences between two files.");
            System.exit(0);
        }
        if(args.length == 50)
        {
            System.out.println("This is a GIT repository you are in!");
            System.exit(0);
        }
        System.out.println("Study the past if you would define the future. Go back and try again!");
        System.out.println();
        System.out.println(" * Run with a parameter for the hint");
        System.out.println(" * Run with two parameters for the hint no two");
        System.out.println(" * There just might be one more hint somewhere");
    }

    public static int getLevenshteinDistance(CharSequence charsequence, CharSequence charsequence1)
    {
        if(charsequence == null || charsequence1 == null)
            throw new IllegalArgumentException("Strings must not be null");
        int i = charsequence.length();
        int j = charsequence1.length();
        if(i == 0)
            return j;
        if(j == 0)
            return i;
        if(i > j)
        {
            CharSequence charsequence2 = charsequence;
            charsequence = charsequence1;
            charsequence1 = charsequence2;
            i = j;
            j = charsequence1.length();
        }
        int ai[] = new int[i + 1];
        int ai1[] = new int[i + 1];
        for(int k = 0; k <= i; k++)
            ai[k] = k;

        for(int i1 = 1; i1 <= j; i1++)
        {
            char c = charsequence1.charAt(i1 - 1);
            ai1[0] = i1;
            for(int l = 1; l <= i; l++)
            {
                int j1 = charsequence.charAt(l - 1) != c ? 1 : 0;
                ai1[l] = Math.min(Math.min(ai1[l - 1] + 1, ai[l] + 1), ai[l - 1] + j1);
            }

            int ai2[] = ai;
            ai = ai1;
            ai1 = ai2;
        }

        return ai[i];
    }

    public static int getLevenshteinDistance(CharSequence charsequence, CharSequence charsequence1, int i)
    {
        if(charsequence == null || charsequence1 == null)
            throw new IllegalArgumentException("Strings must not be null");
        if(i < 0)
            throw new IllegalArgumentException("Threshold must not be negative");
        int j = charsequence.length();
        int k = charsequence1.length();
        if(j == 0)
            return k > i ? -1 : k;
        if(k == 0)
            return j > i ? -1 : j;
        if(j > k)
        {
            CharSequence charsequence2 = charsequence;
            charsequence = charsequence1;
            charsequence1 = charsequence2;
            j = k;
            k = charsequence1.length();
        }
        int ai[] = new int[j + 1];
        int ai1[] = new int[j + 1];
        int l = Math.min(j, i) + 1;
        for(int i1 = 0; i1 < l; i1++)
            ai[i1] = i1;

        Arrays.fill(ai, l, ai.length, 0x7fffffff);
        Arrays.fill(ai1, 0x7fffffff);
        for(int j1 = 1; j1 <= k; j1++)
        {
            char c = charsequence1.charAt(j1 - 1);
            ai1[0] = j1;
            int k1 = Math.max(1, j1 - i);
            int l1 = j1 <= 0x7fffffff - i ? Math.min(j, j1 + i) : j;
            if(k1 > l1)
                return -1;
            if(k1 > 1)
                ai1[k1 - 1] = 0x7fffffff;
            for(int i2 = k1; i2 <= l1; i2++)
                if(charsequence.charAt(i2 - 1) == c)
                    ai1[i2] = ai[i2 - 1];
                else
                    ai1[i2] = 1 + Math.min(Math.min(ai1[i2 - 1], ai[i2]), ai[i2 - 1]);

            int ai2[] = ai;
            ai = ai1;
            ai1 = ai2;
        }

        if(ai[j] <= i)
            return ai[j];
        else
            return -1;
    }

    public static int getFuzzyDistance(CharSequence charsequence, CharSequence charsequence1, Locale locale)
    {
        if(charsequence == null || charsequence1 == null)
            throw new IllegalArgumentException("Strings must not be null");
        if(locale == null)
            throw new IllegalArgumentException("Locale must not be null");
        String s = charsequence.toString().toLowerCase(locale);
        String s1 = charsequence1.toString().toLowerCase(locale);
        int i = 0;
        int j = 0;
        int k = 0x80000000;
        for(int l = 0; l < s1.length(); l++)
        {
            char c = s1.charAt(l);
            for(boolean flag = false; j < s.length() && !flag; j++)
            {
                char c1 = s.charAt(j);
                if(c != c1)
                    continue;
                i++;
                if(k + 1 == j)
                    i += 2;
                k = j;
                flag = true;
            }

        }

        return i;
    }

    private static final String FIRST_HINT = "A component of software configuration management, version control, also known as revision control or source control, is the management of changes to documents, computer programs, large web sites, and other collections of information.";
    private static final String SECOND_HINT = "In computing, the diff utility is a data comparison tool that calculates and displays the differences between two files.";
    private static final String THIRD_HINT = "This is a GIT repository you are in!";
}