Vector

implements List and RandomAccess

• Underlying Data Structure: Resizable data.structure.primary.array (Private)
• Duplicates - Allowed
• Insertion Order - Preserved
• null insetion - Allowed
• Best choice for: Frequent retrievel
• Worst choice for: Frequent insertion/deletion in middle
• Constructors:
  1. Vector v = new Vector();
  2. Vector v = new Vector(int initialCapacity);
  3. Vector v = new Vector(int initialCapacity, int incrementalCapacity);
  4. Vector v = new Vector(Collection C);
• Default initial capacity: 10
• Load factor/fill ratio:
• New Capacity: 2C

Vector is legacy class ⇒ Longer method names

• Adding

  • Collection Interface - add(Object O)
  • List - add(int index, Object O)
  • In vector, addElement(Object O)

• Removing

  • Collection Interface - remove(Object O)
  • List
    • remove(int index)
    • clear()
  • In vector,
    • removeElement(Object O)
    • removeElementAt(int index)
    • removeAllElements()

Child classes/interfaces

Stack

---

Children

1. Stack

---

Backlinks

• Collection Frameworks Cheatsheet (cs)
• List (cs)
• Enumeration (cs)
• Stack (cs)