code: // from gee.cs.oswego.edu/home/jsr166/jsr166
  
  package jsr166tests.jtreg.util.AbstractSequentialList;
  
  /*
   * Copyright 1999 Sun Microsystems, Inc.  All Rights Reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
   *
   * This code is distributed in the hope that it will be useful, but WITHOUT
   * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
   * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
   * version 2 for more details (a copy is included in the LICENSE file that
   * accompanied this code).
   *
   * You should have received a copy of the GNU General Public License version
   * 2 along with this work; if not, write to the Free Software Foundation,
   * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
   *
   * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
   * CA 95054 USA or visit www.sun.com if you need additional information or
   * have any questions.
   */
  
  /**
   * @test
   * @bug 4295163
   * @summary AddAll(int, Collection) intersperses the Collection with this List.
   */
  
  import java.util.*;
  
  public class AddAll {
      public static void main(String[] args) throws Exception {
          List t = new FooList();
          t.add("b"); t.add("a"); t.add("r");
          t.addAll(0, Arrays.asList(new String[] {"f","o","o"}));
          if (!t.equals(Arrays.asList(new String[] {"f","o","o","b","a","r"})))
              throw new Exception("addAll is broken");
      }
  }
  
  class FooList extends AbstractSequentialList {
      List a = new ArrayList();
  
      public int size() {
          return a.size();
      }
  
      public ListIterator listIterator(int index) {
          return a.listIterator(index);
      }
  }
  