
org.neo4j.kernel.impl.util.OutOfOrderSequence 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
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.
/*
* 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.util;
/**
* The thinking behind an out-of-order sequence is that, to the outside, there's one "last number"
* which will never be decremented between times of looking at it. It can move in bigger strides
* than 1 though. That is because multiple threads can {@link #offer(long, long[]) tell} it that a certain number is "done",
* a number that not necessarily is the previously last one plus one. So if a gap is observed then the number
* that is the logical next one, whenever that arrives, will move the externally visible number to
* the highest gap-free number set.
*/
public interface OutOfOrderSequence
{
/**
* Offers a number to this sequence.
*
* @param number number to offer this sequence
* @param meta meta data about the number
* @return {@code true} if highest gap-free number changed as part of this call, otherwise {@code false}.
*/
boolean offer( long number, long[] meta );
/**
* @return {@code long[]} with the highest offered gap-free number and its meta data.
*/
long[] get();
/**
* @return the highest gap-free number, without its meta data.
*/
long getHighestGapFreeNumber();
/**
* @return true if the pair number/meta data has been offered
*/
boolean seen( long number, long[] meta );
/**
* Used in recovery. I don't like the visibility of this method at all.
*/
void set( long number, long[] meta );
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy