*
     * @param boundary the alignment boundary
     * @return the number of bytes added for alignment
     */
    public int align(final int boundary) {
        final int m = boundary - 1;
        final int i = index - start;
        final int n = (i + m & ~m) - i;
        advance(n);
        return n;
    }

    /**
     * Encodes a small integer (1 byte) in NDR format.
     *

    @Override
    public void addIncludeUrlFilter(final String sessionId, final String url) {
        dataHelper.addIncludeUrlPattern(sessionId, url);
    }

    /*
     * (non-Javadoc)
     *
     * @see
     * org.codelibs.fess.crawler.service.impl.UrlFilterService#addIncludeUrlFilter(java
     * .lang.String, java.util.List)
     */
    @Override
    public void addIncludeUrlFilter(final String sessionId, final List<String> urlList) {

         * @param groups The groups.
         * @param roles The roles.
         */
        public SamlUser(final String nameId, final String sessionIndex, final String nameIdFormat, final String nameidNameQualifier,
                final String nameidSPNameQualifier, final String[] groups, final String[] roles) {
            this.nameId = nameId;
            this.sessionIndex = sessionIndex;

  private static final class Dummies {

    @Keep
    public static final class InMemoryPrintStream extends PrintStream {
      @Keep
      public InMemoryPrintStream() {
        super(new ByteArrayOutputStream());
      }
    }

    @Keep
    public static final class InMemoryPrintWriter extends PrintWriter {
      @Keep

final class GraphConstants {

  private GraphConstants() {}

  static final int EXPECTED_DEGREE = 2;

  static final int DEFAULT_NODE_COUNT = 10;
  static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE;

  // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps
  static final float INNER_LOAD_FACTOR = 1.0f;

     */
    @Override
    public void addRule(final Rule rule) {
        ruleList.add(rule);
    }

    /**
     * Adds a rule at the specified position in the rule list.
     * @param index the position to insert the rule
     * @param rule the rule to add
     */
    @Override
    public void addRule(final int index, final Rule rule) {
        ruleList.add(index, rule);
    }

    /*

    }

    /** Registered {@link Disposable} */
    protected static final Deque<Disposable> disposables = newLinkedList();

    /**
     * Registers a disposable resource.
     *
     * @param disposable
     *            A disposable resource. Must not be {@literal null}.
     */
    public static synchronized void add(final Disposable disposable) {
        assertArgumentNotNull("disposable", disposable);

     * @throws IOException if an I/O error occurs during handle creation
     */
    public SamrDomainHandle(final DcerpcHandle handle, final SamrPolicyHandle policyHandle, final int access, final rpc.sid_t sid)
            throws IOException {
        this.handle = handle;
        final MsrpcSamrOpenDomain rpc = new MsrpcSamrOpenDomain(policyHandle, access, sid, this);
        handle.sendrecv(rpc);
        if (rpc.retval != 0) {

     */
    public SamrPolicyHandle(final DcerpcHandle handle, String server, final int access) throws IOException {
        this.handle = handle;
        if (server == null) {
            server = "\\\\";
        }
        final MsrpcSamrConnect4 rpc = new MsrpcSamrConnect4(server, access, this);
        try {
            handle.sendrecv(rpc);
        } catch (final DcerpcException de) {

        @Override
        public E set(final int index, final E element) {
            return parent.set(index, element);
        }

        @Override
        public void add(final int index, final E element) {
            parent.add(index, element);
        }

        @Override
        public E remove(final int index) {
            return parent.remove(index);
        }

        @Override