*
   * <p>We use this instead of java.util.BitSet because we need access to the array of longs and we
   * need compare-and-swap.
   */
  static final class LockFreeBitArray {
    private static final int LONG_ADDRESSABLE_BITS = 6;
    final AtomicLongArray data;
    private final LongAddable bitCount;

    LockFreeBitArray(long bits) {
      checkArgument(bits > 0, "data length is zero!");

    //                                                                          Definition
    //                                                                          ==========
    private static final long serialVersionUID = 1L;
    protected static final Class<?> suppressUnusedImportLocalDateTime = LocalDateTime.class;

    // ===================================================================================

    //                                                                          Definition
    //                                                                          ==========
    private static final long serialVersionUID = 1L;
    protected static final Class<?> suppressUnusedImportLocalDateTime = LocalDateTime.class;

    // ===================================================================================

    //                                                                          Definition
    //                                                                          ==========
    private static final long serialVersionUID = 1L;
    protected static final Class<?> suppressUnusedImportLocalDateTime = LocalDateTime.class;

    // ===================================================================================

    //                                                                          Definition
    //                                                                          ==========
    private static final long serialVersionUID = 1L;
    protected static final Class<?> suppressUnusedImportLocalDateTime = LocalDateTime.class;

    // ===================================================================================

import javax.xml.parsers.ParserConfigurationException;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;

public class ClassDocExtensionsBuilder {
    private final DslDocModel model;
    private final GenerationListener listener;

    public ClassDocExtensionsBuilder(DslDocModel model, GenerationListener listener) {
        this.model = model;
        this.listener = listener;
    }

    /**

import javax.crypto.BadPaddingException;

/**
 * @author shinsuke
 *
 */
public class BadPaddingRuntimeException extends ClRuntimeException {

    private static final long serialVersionUID = 1L;

    public BadPaddingRuntimeException(final BadPaddingException cause) {
        super("ECL0105", new Object[] { cause.getMessage() }, cause);
    }

import javax.crypto.IllegalBlockSizeException;

/**
 * @author shinsuke
 *
 */
public class IllegalBlockSizeRuntimeException extends ClRuntimeException {

    private static final long serialVersionUID = 1L;

    public IllegalBlockSizeRuntimeException(final IllegalBlockSizeException cause) {
        super("ECL0105", new Object[] { cause.getMessage() }, cause);
    }

package org.codelibs.fess.exception;

import org.apache.lucene.queryparser.classic.ParseException;

public class QueryParseException extends FessSystemException {

    private static final long serialVersionUID = 1L;

    public QueryParseException(final ParseException cause) {
        super(cause);
    }

    return new Builder<>(Ordering.natural());
  }

  /**
   * A builder for creating immutable sorted set instances, especially {@code public static final}
   * sets ("constant sets"), with a given comparator. Example:
   *
   * <pre>{@code
   * public static final ImmutableSortedSet<Number> LUCKY_NUMBERS =
   *     new ImmutableSortedSet.Builder<Number>(ODDS_FIRST_COMPARATOR)
   *         .addAll(SINGLE_DIGIT_PRIMES)