org.neo4j.kernel.impl.store.LabelIdArray Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of neo4j-kernel Show documentation

Neo4j kernel is a lightweight, embedded Java database designed to store data structured as graphs rather than tables. For more information, see http://neo4j.org.

There is a newer version: 2025.02.0

Show newest version

/*
 * Copyright (c) 2002-2015 "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 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see .
 */
package org.neo4j.kernel.impl.store;

import java.util.Arrays;

import static java.lang.System.arraycopy;

public class LabelIdArray
{
    static long[] concatAndSort( long[] existing, long additional )
    {
        assertNotContains( existing, additional );

        long[] result = new long[existing.length + 1];
        arraycopy( existing, 0, result, 0, existing.length );
        result[existing.length] = additional;
        Arrays.sort( result );
        return result;
    }

    private static void assertNotContains( long[] existingLabels, long labelId )
    {
        if ( Arrays.binarySearch( existingLabels, labelId ) >= 0 )
        {
            throw new IllegalStateException( "Label " + labelId + " already exists." );
        }
    }

    static long[] filter( long[] ids, long excludeId )
    {
        boolean found = false;
        for ( int i = 0; i < ids.length; i++ )
        {
            if ( ids[i] == excludeId )
            {
                found = true;
                break;
            }
        }
        if ( !found )
        {
            throw new IllegalStateException( "Label " + excludeId + " not found." );
        }

        long[] result = new long[ids.length - 1];
        int writerIndex = 0;
        for ( int i = 0; i < ids.length; i++ )
        {
            if ( ids[i] != excludeId )
            {
                result[writerIndex++] = ids[i];
            }
        }
        return result;
    }

    public static long[] prependNodeId( long nodeId, long[] labelIds )
    {
        long[] result = new long[ labelIds.length + 1 ];
        arraycopy( labelIds, 0, result, 1, labelIds.length );
        result[0] = nodeId;
        return result;
    }

    public static long[] stripNodeId( long[] storedLongs )
    {
        return Arrays.copyOfRange( storedLongs, 1, storedLongs.length );
    }
}