This paper presents elementary patterns for constructing and using Linear Indexed Data Structures (often known as Vectors and Arrays).

Patterns for building and using these structures include:

• Linear Indexed Data Structure (What is a Linear Indexed Data Structure and when to choose one?)
  • Fixed-Size Linear Data Structure
  • Expandable Linear Data Structure
  • Declare-Construct-Initialize (Variables)

• Appended Item (adding a new item to the end)
• Indexed Random Access (accessing an arbitrary element)
• Valid Index (staying in range)

• Linear Indexed Traversal (Repetition: traversing all the elements)
• Reverse Linear Indexed Traversal (Repetition: traversing all the elements in reverse order)
• Iterator Process All Items (Astrachan & Wallingford)

Acknowledgements