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

org.apache.juli.logging.net.logstash.logback.encoder.com.lmax.disruptor.Sequenced Maven / Gradle / Ivy

There is a newer version: 10.1.24
Show newest version
package org.apache.juli.logging.net.logstash.logback.encoder.com.lmax.disruptor;

public interface Sequenced
{
    /**
     * The capacity of the data structure to hold entries.
     *
     * @return the size of the RingBuffer.
     */
    int getBufferSize();

    /**
     * Has the buffer got capacity to allocate another sequence.  This is a concurrent
     * method so the response should only be taken as an indication of available capacity.
     *
     * @param requiredCapacity in the buffer
     * @return true if the buffer has the capacity to allocate the next sequence otherwise false.
     */
    boolean hasAvailableCapacity(int requiredCapacity);

    /**
     * Get the remaining capacity for this sequencer.
     *
     * @return The number of slots remaining.
     */
    long remainingCapacity();

    /**
     * Claim the next event in sequence for publishing.
     *
     * @return the claimed sequence value
     */
    long next();

    /**
     * Claim the next n events in sequence for publishing.  This is for batch event producing.  Using batch producing
     * requires a little care and some math.
     * 
     * int n = 10;
     * long hi = sequencer.next(n);
     * long lo = hi - (n - 1);
     * for (long sequence = lo; sequence <= hi; sequence++) {
     *     // Do work.
     * }
     * sequencer.publish(lo, hi);
     * 
* * @param n the number of sequences to claim * @return the highest claimed sequence value */ long next(int n); /** * Attempt to claim the next event in sequence for publishing. Will return the * number of the slot if there is at least requiredCapacity slots * available. * * @return the claimed sequence value * @throws InsufficientCapacityException thrown if there is no space available in the ring buffer. */ long tryNext() throws InsufficientCapacityException; /** * Attempt to claim the next n events in sequence for publishing. Will return the * highest numbered slot if there is at least requiredCapacity slots * available. Have a look at {@link Sequencer#next()} for a description on how to * use this method. * * @param n the number of sequences to claim * @return the claimed sequence value * @throws InsufficientCapacityException thrown if there is no space available in the ring buffer. */ long tryNext(int n) throws InsufficientCapacityException; /** * Publishes a sequence. Call when the event has been filled. * * @param sequence the sequence to be published. */ void publish(long sequence); /** * Batch publish sequences. Called when all of the events have been filled. * * @param lo first sequence number to publish * @param hi last sequence number to publish */ void publish(long lo, long hi); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy