// Path: src/main/java/com/lmax/disruptor/util/Util.java
// public final class Util
// {
//     /**
//      * Calculate the next power of 2, greater than or equal to x.<p>
//      * From Hacker's Delight, Chapter 3, Harry S. Warren Jr.
//      *
//      * @param x Value to round up
//      * @return The next power of 2 from x inclusive
//      */
//     public static int ceilingNextPowerOfTwo(final int x)
//     {
//         return 1 << (32 - Integer.numberOfLeadingZeros(x - 1));
//     }
// 
//     /**
//      * Get the minimum sequence from an array of {@link com.lmax.disruptor.Sequence}s.
//      *
//      * @param sequences to compare.
//      * @return the minimum sequence found or Long.MAX_VALUE if the array is empty.
//      */
//     public static long getMinimumSequence(final Sequence[] sequences)
//     {
//         long minimum = Long.MAX_VALUE;
// 
//         for (Sequence sequence : sequences)
//         {
//             long value = sequence.get();
//             minimum = minimum < value ? minimum : value;
//         }
// 
//         return minimum;
//     }
// 
//     /**
//      * Get an array of {@link Sequence}s for the passed {@link EventProcessor}s
//      *
//      * @param processors for which to get the sequences
//      * @return the array of {@link Sequence}s
//      */
//     public static Sequence[] getSequencesFor(final EventProcessor... processors)
//     {
//         Sequence[] sequences = new Sequence[processors.length];
//         for (int i = 0; i < sequences.length; i++)
//         {
//             sequences[i] = processors[i].getSequence();
//         }
// 
//         return sequences;
//     }
// }


import com.lmax.disruptor.*;
import com.lmax.disruptor.util.Util;
import java.util.concurrent.Executor;
import java.util.concurrent.atomic.AtomicBoolean;
    {
        for (EventProcessor processor : processors)
        {
            eventProcessorRepository.add(processor);
        }

        return new EventHandlerGroup<T>(this, eventProcessorRepository, processors);
    }

    /**
     * Publish an event to the ring buffer.
     *
     * @param eventTranslator the translator that will load data into the event.
     */
    public void publishEvent(final EventTranslator<T> eventTranslator)
    {
        eventPublisher.publishEvent(eventTranslator);
    }

    /**
     * Starts the event processors and returns the fully configured ring buffer.
     * The ring buffer is set up to prevent overwriting any entry that is yet to
     * be processed by the slowest event processor.
     * This method must only be called once after all event processors have been added.
     *
     * @return the configured ring buffer.
     */
    public RingBuffer<T> start()
    {
        EventProcessor[] gatingProcessors = eventProcessorRepository.getLastEventProcessorsInChain();
// Path: src/main/java/com/lmax/disruptor/util/Util.java
// public final class Util
// {
//     /**
//      * Calculate the next power of 2, greater than or equal to x.<p>
//      * From Hacker's Delight, Chapter 3, Harry S. Warren Jr.
//      *
//      * @param x Value to round up
//      * @return The next power of 2 from x inclusive
//      */
//     public static int ceilingNextPowerOfTwo(final int x)
//     {
//         return 1 << (32 - Integer.numberOfLeadingZeros(x - 1));
//     }
// 
//     /**
//      * Get the minimum sequence from an array of {@link com.lmax.disruptor.Sequence}s.
//      *
//      * @param sequences to compare.
//      * @return the minimum sequence found or Long.MAX_VALUE if the array is empty.
//      */
//     public static long getMinimumSequence(final Sequence[] sequences)
//     {
//         long minimum = Long.MAX_VALUE;
// 
//         for (Sequence sequence : sequences)
//         {
//             long value = sequence.get();
//             minimum = minimum < value ? minimum : value;
//         }
// 
//         return minimum;
//     }
// 
//     /**
//      * Get an array of {@link Sequence}s for the passed {@link EventProcessor}s
//      *
//      * @param processors for which to get the sequences
//      * @return the array of {@link Sequence}s
//      */
//     public static Sequence[] getSequencesFor(final EventProcessor... processors)
//     {
//         Sequence[] sequences = new Sequence[processors.length];
//         for (int i = 0; i < sequences.length; i++)
//         {
//             sequences[i] = processors[i].getSequence();
//         }
// 
//         return sequences;
//     }
// }


// Path: src/main/java/com/lmax/disruptor/dsl/Disruptor.java
import com.lmax.disruptor.*;
import com.lmax.disruptor.util.Util;
import java.util.concurrent.Executor;
import java.util.concurrent.atomic.AtomicBoolean;

    {
        for (EventProcessor processor : processors)
        {
            eventProcessorRepository.add(processor);
        }

        return new EventHandlerGroup<T>(this, eventProcessorRepository, processors);
    }

    /**
     * Publish an event to the ring buffer.
     *
     * @param eventTranslator the translator that will load data into the event.
     */
    public void publishEvent(final EventTranslator<T> eventTranslator)
    {
        eventPublisher.publishEvent(eventTranslator);
    }

    /**
     * Starts the event processors and returns the fully configured ring buffer.
     * The ring buffer is set up to prevent overwriting any entry that is yet to
     * be processed by the slowest event processor.
     * This method must only be called once after all event processors have been added.
     *
     * @return the configured ring buffer.
     */
    public RingBuffer<T> start()
    {
        EventProcessor[] gatingProcessors = eventProcessorRepository.getLastEventProcessorsInChain();
        ringBuffer.setGatingSequences(Util.getSequencesFor(gatingProcessors));