<commit_before>package ru.ifmo.nds.domtree;

import ru.ifmo.nds.util.DominanceHelper;

class Node implements Comparable<Node> {
    double[] point;
    Node next, child;
    final int index;

    Node(int index) {
        this.index = index;
        this.next = null;
        this.child = null;
    }

    void initialize(double[] point) {
        this.point = point;
        this.next = null;
        this.child = null;
    }

    boolean strictlyDominatesAssumingLexicographicallySmaller(Node other) {
        return DominanceHelper.strictlyDominatesAssumingLexicographicallySmaller(point, other.point, point.length - 1);
    }

    int dominanceComparison(Node other) {
        return DominanceHelper.dominanceComparison(point, other.point, point.length);
    }

    // assumes b != null && b.next == null
    static Node concatenate(Node a, Node b) {
        if (a == null) {
            return b;
        }
        int bIndex = b.index;
        if (a.index > bIndex) {
            b.next = a;
            return b;
        }
        Node prev = a, next = a.next;
        while (next != null) {
            if (next.index > bIndex) {
                b.next = next;
                break;
            }
            prev = next;
            next = next.next;
        }
        prev.next = b;
        return a;
    }

    @Override
    public int compareTo(Node o) {
        return index - o.index;
    }
}<commit_msg>Drop the unused method in Node.<commit_after>package ru.ifmo.nds.domtree;

import ru.ifmo.nds.util.DominanceHelper;

class Node implements Comparable<Node> {
    double[] point;
    Node next, child;
    final int index;

    Node(int index) {
        this.index = index;
        this.next = null;
        this.child = null;
    }

    void initialize(double[] point) {
        this.point = point;
        this.next = null;
        this.child = null;
    }

    boolean strictlyDominatesAssumingLexicographicallySmaller(Node other) {
        return DominanceHelper.strictlyDominatesAssumingLexicographicallySmaller(point, other.point, point.length - 1);
    }

    int dominanceComparison(Node other) {
        return DominanceHelper.dominanceComparison(point, other.point, point.length);
    }

    @Override
    public int compareTo(Node o) {
        return index - o.index;
    }
}
{'fraction_non_alphanumeric': 0.10030395136778116, 'fraction_numerical': 0.0008684324793747286, 'mean_word_length': 2.011764705882353, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 7, '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': '3630736', 'n_tokens_mistral': 706, 'n_tokens_neox': 678, 'n_words': 165}