org.neo4j.kernel.impl.index.schema.NativeIndexKey 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: 5.25.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.neo4j.index.internal.gbptree.GBPTree;
import org.neo4j.values.storable.Value;
import org.neo4j.values.storable.ValueGroup;
import org.neo4j.values.utils.TemporalValueWriterAdapter;

abstract class NativeIndexKey> extends TemporalValueWriterAdapter
{
    public static final int ENTITY_ID_SIZE = Long.BYTES;
    static final int NO_ENTITY_ID = -1;

    enum Inclusion
    {
        LOW,
        NEUTRAL,
        HIGH
    }

    private static final boolean DEFAULT_COMPARE_ID = true;

    private long entityId;
    private boolean compareId = DEFAULT_COMPARE_ID;

    /**
     * Marks that comparisons with this key requires also comparing entityId, this allows functionality
     * of inclusive/exclusive bounds of range queries.
     * This is because {@link GBPTree} only support from inclusive and to exclusive.
     * 
     * Note that {@code compareId} is only an in memory state.
     */
    void setCompareId( boolean compareId )
    {
        this.compareId = compareId;
    }

    boolean getCompareId()
    {
        return compareId;
    }

    long getEntityId()
    {
        return entityId;
    }

    void setEntityId( long entityId )
    {
        this.entityId = entityId;
    }

    final void initFromValue( int stateSlot, Value value, Inclusion inclusion )
    {
        assertValidValue( stateSlot, value );
        writeValue( stateSlot, value, inclusion );
    }

    abstract void writeValue( int stateSlot, Value value, Inclusion inclusion );

    abstract void assertValidValue( int stateSlot, Value value );

    /**
     * Initializes this key with entity id and resets other flags to default values.
     * Doesn't touch value data.
     *
     * @param entityId entity id to set for this key.
     */
    void initialize( long entityId )
    {
        this.compareId = DEFAULT_COMPARE_ID;
        setEntityId( entityId );
    }

    abstract Value[] asValues();

    abstract void initValueAsLowest( int stateSlot, ValueGroup valueGroup );

    abstract void initValueAsHighest( int stateSlot, ValueGroup valueGroup );

    abstract int numberOfStateSlots();

    final void initValuesAsLowest()
    {
        int slots = numberOfStateSlots();
        for ( int i = 0; i < slots; i++ )
        {
            initValueAsLowest( i, ValueGroup.UNKNOWN );
        }
    }

    final void initValuesAsHighest()
    {
        int slots = numberOfStateSlots();
        for ( int i = 0; i < slots; i++ )
        {
            initValueAsHighest( i, ValueGroup.UNKNOWN );
        }
    }

    /**
     * Compares the value of this key to that of another key.
     * This method is expected to be called in scenarios where inconsistent reads may happen (and later retried).
     *
     * @param other the key to compare to.
     * @return comparison against the {@code other} key.
     */
    abstract int compareValueTo( SELF other );
}