<commit_before>/**
 * Copyright (c) 2002-2010 "Neo Technology,"
 * Network Engine for Objects in Lund AB [http://neotechnology.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

package org.neo4j.helpers;

/**
 * Utility to handle pairs of objects.
 */
public abstract class Pair<T1, T2>
{
    Pair()
    {
    }

    /**
     * Create a new pair of objects.
     *
     * @param first the first object in the pair.
     * @param other the other object in the pair.
     */
    public static <T1, T2> Pair<T1, T2> of( final T1 first, final T2 other )
    {
        return new Pair<T1, T2>()
        {
            @Override
            public T1 first()
            {
                return first();
            }

            @Override
            public T2 other()
            {
                return other;
            }
        };
    }

    /**
     * @return the first object in the pair.
     */
    public abstract T1 first();

    /**
     * @return the other object in the pair.
     */
    public abstract T2 other();

    @Override
    public String toString()
    {
        return "(" + first() + ", " + other() + ")";
    }

    @Override
    public int hashCode()
    {
        return ( 31 * hashCode( first() ) ) | hashCode( other() );
    }

    @SuppressWarnings( "unchecked" )
    @Override
    public boolean equals( Object obj )
    {
        if ( this == obj ) return true;
        if ( obj instanceof Pair )
        {
            if ( obj.getClass() != this.getClass() ) return false;
            Pair that = (Pair) obj;
            return equals( this.first(), that.first() ) && equals( this.other(), that.other() );
        }
        return false;
    }

    static int hashCode( Object obj )
    {
        return obj == null ? 0 : obj.hashCode();
    }

    static boolean equals( Object obj1, Object obj2 )
    {
        return ( obj1 == obj2 ) || ( obj1 != null && obj1.equals( obj2 ) );
    }
}
<commit_msg>Very stupid coding mistake.<commit_after>/**
 * Copyright (c) 2002-2010 "Neo Technology,"
 * Network Engine for Objects in Lund AB [http://neotechnology.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

package org.neo4j.helpers;

/**
 * Utility to handle pairs of objects.
 */
public abstract class Pair<T1, T2>
{
    Pair()
    {
    }

    /**
     * Create a new pair of objects.
     *
     * @param first the first object in the pair.
     * @param other the other object in the pair.
     */
    public static <T1, T2> Pair<T1, T2> of( final T1 first, final T2 other )
    {
        return new Pair<T1, T2>()
        {
            @Override
            public T1 first()
            {
                return first;
            }

            @Override
            public T2 other()
            {
                return other;
            }
        };
    }

    /**
     * @return the first object in the pair.
     */
    public abstract T1 first();

    /**
     * @return the other object in the pair.
     */
    public abstract T2 other();

    @Override
    public String toString()
    {
        return "(" + first() + ", " + other() + ")";
    }

    @Override
    public int hashCode()
    {
        return ( 31 * hashCode( first() ) ) | hashCode( other() );
    }

    @SuppressWarnings( "unchecked" )
    @Override
    public boolean equals( Object obj )
    {
        if ( this == obj ) return true;
        if ( obj instanceof Pair )
        {
            if ( obj.getClass() != this.getClass() ) return false;
            Pair that = (Pair) obj;
            return equals( this.first(), that.first() ) && equals( this.other(), that.other() );
        }
        return false;
    }

    static int hashCode( Object obj )
    {
        return obj == null ? 0 : obj.hashCode();
    }

    static boolean equals( Object obj1, Object obj2 )
    {
        return ( obj1 == obj2 ) || ( obj1 != null && obj1.equals( obj2 ) );
    }
}

{'fraction_non_alphanumeric': 0.1072391220639199, 'fraction_numerical': 0.013862148633038121, 'mean_word_length': 1.9300620417371686, 'pattern_counts': {'":': 0, '<': 13, '<?xml version=': 0, '>': 13, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, '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': '3012897', 'n_tokens_mistral': 1514, 'n_tokens_neox': 1453, 'n_words': 571}