super(originalMessage, cause);
        this.pluginDescriptor = pluginDescriptor;
        this.originalMessage = originalMessage;
    }

    /**
     * Ctor left for binary compatibility.
     *
     * @deprecated Use {@link #PluginConfigurationException(PluginDescriptor, String, Throwable)}
     */
    @Deprecated
    public PluginConfigurationException(

    }

    /**
     * @throws Exception
     */
    public void testObjectAndBinary() throws Exception {
        final String o = "hoge";
        final byte[] binary = SerializeUtil.fromObjectToBinary(o);
        assertEquals(o, SerializeUtil.fromBinaryToObject(binary));
    }

    public PluginContainerException(Plugin plugin, ClassRealm pluginRealm, String message, Throwable e) {
        super(plugin, message, e);

        this.pluginRealm = pluginRealm;
    }

    /**
     * Ctor left for binary compatibility.
     *
     * @deprecated Use {@link #PluginContainerException(Plugin, ClassRealm, String, Throwable)}
     */
    @Deprecated
    public PluginContainerException(

      // BigInteger.gcd is consistent with this decision.
      return b;
    } else if (b == 0) {
      return a; // similar logic
    }
    /*
     * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm. This is
     * >40% faster than the Euclidean algorithm in benchmarks.
     */
    int aTwos = Integer.numberOfTrailingZeros(a);
    a >>= aTwos; // divide out all 2s

   *    a     b
   *   / \   / \
   *  /   \ /   \
   * c     d     e
   *        \   /
   *         \ /
   *          f
   * }</pre>
   *
   * <p><b>Note on binary trees</b>
   *
   * <p>This method can be used to traverse over a binary tree. Given methods {@code
   * leftChild(node)} and {@code rightChild(node)}, this method can be called as
   *
   * <pre>{@code

    assertEquals(Integer.MAX_VALUE, ms.tailMultiset("a", CLOSED).size());
  }

  @J2ktIncompatible
  @GwtIncompatible // reflection
  @AndroidIncompatible // Reflection bug, or actual binary compatibility problem?
  public void testElementSetBridgeMethods() {
    for (Method m : TreeMultiset.class.getMethods()) {
      if (m.getName().equals("elementSet") && m.getReturnType().equals(SortedSet.class)) {

   *       </ul>
   *   <li>another java.util.Set delegate implementation. In most modern JDKs, normal java.util hash
   *       collections intelligently fall back to a binary search tree if hash table collisions are
   *       detected. Rather than going to all the trouble of reimplementing this ourselves, we
   *       simply switch over to use the JDK implementation wholesale if probable hash flooding is

     * @return シリアライズして復元したオブジェクト
     */
    public static Object serialize(final Object obj) {
        assertArgumentNotNull("obj", obj);

        final byte[] binary = fromObjectToBinary(obj);
        return fromBinaryToObject(binary);
    }

    /**
     * オブジェクトをbyteの配列に変換します。
     *
     * @param obj
     *            シリアライズするオブジェクト。{@literal null}であってはいけません
     * @return オブジェクトのbyte配列
     */

import com.google.common.base.Optional;
import com.google.common.primitives.Ints;
import java.util.List;
import java.util.Random;

/**
 * Benchmarks for the {@code TreeTraverser} operations on binary trees.
 *
 * @author Louis Wasserman
 */
public class BinaryTreeTraverserBenchmark {
  private static class BinaryNode {
    final int x;
    final Optional<BinaryNode> left;
    final Optional<BinaryNode> right;

        if (!member.isBinaryCompatible()) {
            if ((member instanceof JApiClass) && (member.getCompatibilityChanges().isEmpty())) {
                // A member of the class breaks binary compatibility.
                // That will be handled when the member is passed to `maybeViolation`.
                return null;
            }
            if (member instanceof JApiImplementedInterface) {