/* * Copyright 2011 LMAX Ltd. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.lmax.disruptor.util; import com.lmax.disruptor.EventProcessor; import com.lmax.disruptor.Sequence; /** * Set of common functions used by the Disruptor */ 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; } }