@Test public void testSetElementAt() { fail("Not yet implemented"); }
public synchronized void setElementAt(E obj, int index) { if (index >= elementCount) throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount); elementData[index].terminate(); elementData[index] = obj; obj.initialize(); }
Vector extends AbstractList<E> implements List<E>, RandomAccess { public synchronized void setElementAt(E obj, int index) { if (index >= elementCount) throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount); elementData[index].terminate(); elementData[index] = obj; obj.initialize(); } }
Vector extends AbstractList<E> implements List<E>, RandomAccess { public synchronized void setElementAt(E obj, int index) { if (index >= elementCount) throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount); elementData[index].terminate(); elementData[index] = obj; obj.initialize(); } Vector(int initialCapacity);  Vector(); }
Vector extends AbstractList<E> implements List<E>, RandomAccess { public synchronized void setElementAt(E obj, int index) { if (index >= elementCount) throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount); elementData[index].terminate(); elementData[index] = obj; obj.initialize(); } Vector(int initialCapacity);  Vector(); synchronized void copyInto(Object[] anArray); synchronized int capacity(); synchronized int size(); synchronized boolean isEmpty(); Enumeration<E> elements(); boolean contains(Object o); int indexOf(Object o); synchronized int indexOf(Object o, int index); synchronized int lastIndexOf(Object o); synchronized int lastIndexOf(Object o, int index); synchronized E elementAt(int index); synchronized E firstElement(); synchronized E lastElement(); synchronized void setElementAt(E obj, int index); synchronized void removeElementAt(int index); synchronized void insertElementAt(E obj, int index); synchronized void addElement(E obj); synchronized boolean removeElement(Object obj); synchronized void removeAllElements(); synchronized Object[] toArray(); synchronized T[] toArray(T[] a); synchronized E get(int index); synchronized E set(int index, E element); synchronized boolean add(E e); boolean remove(Object o); void add(int index, E element); synchronized E remove(int index); void clear(); synchronized boolean equals(Object o); synchronized int hashCode(); synchronized String toString(); }
Vector extends AbstractList<E> implements List<E>, RandomAccess { public synchronized void setElementAt(E obj, int index) { if (index >= elementCount) throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount); elementData[index].terminate(); elementData[index] = obj; obj.initialize(); } Vector(int initialCapacity);  Vector(); synchronized void copyInto(Object[] anArray); synchronized int capacity(); synchronized int size(); synchronized boolean isEmpty(); Enumeration<E> elements(); boolean contains(Object o); int indexOf(Object o); synchronized int indexOf(Object o, int index); synchronized int lastIndexOf(Object o); synchronized int lastIndexOf(Object o, int index); synchronized E elementAt(int index); synchronized E firstElement(); synchronized E lastElement(); synchronized void setElementAt(E obj, int index); synchronized void removeElementAt(int index); synchronized void insertElementAt(E obj, int index); synchronized void addElement(E obj); synchronized boolean removeElement(Object obj); synchronized void removeAllElements(); synchronized Object[] toArray(); synchronized T[] toArray(T[] a); synchronized E get(int index); synchronized E set(int index, E element); synchronized boolean add(E e); boolean remove(Object o); void add(int index, E element); synchronized E remove(int index); void clear(); synchronized boolean equals(Object o); synchronized int hashCode(); synchronized String toString();  }