<commit_before>public class Verifier
{
    public static final String INPUT_SIGNAL_1 = "03036732577212944063491565474664";
    public static final int[] SIGNAL_1_RESULT = {8, 4, 4, 6, 2, 0, 2, 6};

    public static final String INPUT_SIGNAL_2 = "02935109699940807407585447034323";
    public static final int[] SIGNAL_2_RESULT = {7, 8, 7, 2, 5, 2, 7, 0};

    public static final String INPUT_SIGNAL_3 = "03081770884921959731165446850517";
    public static final int[] SIGNAL_3_RESULT = {5, 3, 5, 5, 3, 7, 3, 1};

    public Verifier (boolean debug)
    {
        _debug = debug;
        _fft = new Compute(_debug);
    }

    /*
     * Computing 100*signal should be the same as computing the 100th instance (A)
     * and the 1st instance (B), as that is the only one which has a different
     * base? Then the total is 99*A + B. In theory. Need to test this out with a
     * value of n < 100.
     */

    public final boolean verify ()
    {
        boolean result = true;
        int[] signal = Util.replicate(INPUT_SIGNAL_1, Util.REPEAT_SIZE);
        int[] data = _fft.process(signal, Util.PHASES);
        long offset = Util.offset(INPUT_SIGNAL_1);

        //if (_debug)
            System.out.println("Offset for "+INPUT_SIGNAL_1+" is "+offset);

        System.out.println();
        Util.printSignal(signal, INPUT_SIGNAL_1.length());

        System.out.println();
        Util.printSignal(data, INPUT_SIGNAL_1.length());

        return result;
    }
    
    private boolean _debug;
    Compute _fft;
}<commit_msg>Update Verifier.java<commit_after>public class Verifier
{
    public static final String INPUT_SIGNAL_1 = "03036732577212944063491565474664";
    public static final int[] SIGNAL_1_RESULT = {8, 4, 4, 6, 2, 0, 2, 6};

    public static final String INPUT_SIGNAL_2 = "02935109699940807407585447034323";
    public static final int[] SIGNAL_2_RESULT = {7, 8, 7, 2, 5, 2, 7, 0};

    public static final String INPUT_SIGNAL_3 = "03081770884921959731165446850517";
    public static final int[] SIGNAL_3_RESULT = {5, 3, 5, 5, 3, 7, 3, 1};

    public Verifier (boolean debug)
    {
        _debug = debug;
        _fft = new Compute(_debug);
    }

    /*
     * Computing 100*signal should be the same as computing the 100th instance (A)
     * and the 1st instance (B), as that is the only one which has a different
     * base? Then the total is 99*A + B. In theory. Need to test this out with a
     * value of n < 100.
     */

    public final boolean verify ()
    {
        boolean result = true;
        int[] signal = Util.replicate(INPUT_SIGNAL_1, Util.REPEAT_SIZE);
        int[] data = _fft.process(signal, Util.PHASES);
        long offset = Util.offset(INPUT_SIGNAL_1);

        //if (_debug)
            System.out.println("Offset for "+INPUT_SIGNAL_1+" is "+offset);

        System.out.println();
        Util.printSignal(data, INPUT_SIGNAL_1.length());

        return result;
    }
    
    private boolean _debug;
    Compute _fft;
}
{'fraction_non_alphanumeric': 0.1039919490103992, 'fraction_numerical': 0.09560550150956056, 'mean_word_length': 2.741530740276035, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '7139248', 'n_tokens_mistral': 1179, 'n_tokens_neox': 976, 'n_words': 306}