All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.neo4j.kernel.impl.index.schema.EntityTokenRangeImpl Maven / Gradle / Ivy

Go to download

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: 5.26.1
Show newest version
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.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.index.schema;

import org.eclipse.collections.api.list.primitive.LongList;
import org.eclipse.collections.api.list.primitive.MutableLongList;
import org.eclipse.collections.impl.list.mutable.primitive.LongArrayList;

import org.neo4j.common.EntityType;

import static java.lang.Math.toIntExact;
import static org.neo4j.collection.PrimitiveLongCollections.EMPTY_LONG_ARRAY;
import static org.neo4j.kernel.impl.index.schema.TokenScanValue.RANGE_SIZE;

/**
 * Represents a range of entities and token ids attached to those entities. All entities in the range are present in
 * {@link #entities() entities array}, but not all entity ids will have corresponding {@link #tokens(long) tokens},
 * where an empty long[] will be returned instead.
 */
public class EntityTokenRangeImpl implements EntityTokenRange
{
    public static final long[][] NO_TOKENS = new long[RANGE_SIZE][];
    private final long idRange;
    private final long[] entities;
    private final long[][] tokens;
    private final EntityType entityType;
    private final long lowRangeId;
    private final long highRangeId;

    /**
     * @param idRange entity id range, e.g. in which id span the entities are.
     * @param tokens long[][] where first dimension is relative entity id in this range, i.e. 0-rangeSize
     * and second the token ids for that entity, potentially empty if there are none for that entity.
     * The first dimension must be the size of the range.
     */
    public EntityTokenRangeImpl( long idRange, long[][] tokens, EntityType entityType )
    {
        this.idRange = idRange;
        this.tokens = tokens;
        this.entityType = entityType;
        int rangeSize = tokens.length;
        this.lowRangeId = idRange * rangeSize;
        this.highRangeId = lowRangeId + rangeSize - 1;

        this.entities = new long[rangeSize];
        for ( int i = 0; i < rangeSize; i++ )
        {
            entities[i] = lowRangeId + i;
        }
    }

    @Override
    public long id()
    {
        return idRange;
    }

    @Override
    public boolean covers( long entityId )
    {
        return entityId >= lowRangeId && entityId <= highRangeId;
    }

    @Override
    public boolean isBelow( long entityId )
    {
        return highRangeId < entityId;
    }

    @Override
    public long[] entities()
    {
        return entities;
    }

    @Override
    public long[] tokens( long entityId )
    {
        int index = toIntExact( entityId - lowRangeId );
        assert index >= 0 && index < tokens.length : "entityId:" + entityId + ", idRange:" + idRange;
        return tokens[index] != null ? tokens[index] : EMPTY_LONG_ARRAY;
    }

    private static String toString( String prefix, long[] entities, long[][] tokens )
    {
        StringBuilder result = new StringBuilder( prefix );
        result.append( "; {" );
        for ( int i = 0; i < entities.length; i++ )
        {
            if ( i != 0 )
            {
                result.append( ", " );
            }
            result.append( "Entity[" ).append( entities[i] ).append( "]: Tokens[" );
            String sep = "";
            if ( tokens[i] != null )
            {
                for ( long tokenId : tokens[i] )
                {
                    result.append( sep ).append( tokenId );
                    sep = ", ";
                }
            }
            else
            {
                result.append( "null" );
            }
            result.append( ']' );
        }
        return result.append( "}]" ).toString();
    }

    @Override
    public String toString()
    {
        String rangeName = entityType == EntityType.NODE ? "NodeLabelRange" : "RelationshipTypeRange";
        String rangeString = lowRangeId + "-" + (highRangeId + 1);
        String prefix = rangeName + "[idRange=" + rangeString;
        return toString( prefix, entities, tokens );
    }

    static void readBitmap( long bitmap, long tokenId, MutableLongList[] tokensPerEntity )
    {
        while ( bitmap != 0 )
        {
            int relativeEntityId = Long.numberOfTrailingZeros( bitmap );
            if ( tokensPerEntity[relativeEntityId] == null )
            {
                tokensPerEntity[relativeEntityId] = new LongArrayList();
            }
            tokensPerEntity[relativeEntityId].add( tokenId );
            bitmap &= bitmap - 1;
        }
    }

    static long[][] convertState( LongList[] state )
    {
        long[][] tokenIdsByEntityIndex = new long[state.length][];
        for ( int i = 0; i < state.length; i++ )
        {
            final LongList tokenIdList = state[i];
            if ( tokenIdList != null )
            {
                tokenIdsByEntityIndex[i] = tokenIdList.toArray();
            }
        }
        return tokenIdsByEntityIndex;
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy