CSC 1061 Vectors

A sequence of characters, used to represent text data.

Splitting a string into smaller parts based on a given delimiter, like spaces or commas.

A special function that allows you to split a string into separate parts based on a character you specify.

It is needed to prevent memory leaks when a Record object is destroyed. It frees up the memory used by the dynamically allocated array.

It is used to allocate memory for the fields array dynamically, making sure there's enough space to store the split parts.

Vectors are linear sequence containers that represent arrays that can change in size. They have many similarities to arrays, such as their contiguous storage of elements and efficient access through offsets. However, unlike arrays, vectors can dynamically resize.

Vectors, like arrays, store elements in contiguous memory locations. This allows for efficient access using offsets on pointers.

Vector elements are accessed through indexes, starting from zero. For instance, vector[0] refers to the first element and vector[n] refers to the (n+1)th element.

Dynamic arrays allocate memory on the heap, enabling them to grow in size as needed. This allows for efficient handling of varying data sizes.

The reserve() function in C++ allows you to pre-allocate memory for a vector, potentially improving performance by avoiding reallocations during growth. It provides a capacity for the vector, setting the minimum amount of memory that the vector can hold.

If you access elements in a vector using an index outside its valid range, you might encounter a runtime error or unexpected behavior. This commonly leads to crashes and unpredictable program behavior.

Static arrays have a fixed size, while dynamic arrays can dynamically grow their size. Static arrays are allocated on the stack, while dynamic arrays are allocated on the heap.

A sequence container that represents dynamic arrays. Vectors can change in size, adding or removing elements as needed.

A data structure that uses dynamically allocated memory to efficiently store and manage collections of elements.

A special function that runs automatically when a class object goes out of scope, cleaning up dynamically allocated memory.

A special pointer value indicating that no memory is currently allocated, often used to signal an empty or invalid memory state.

The act of allocating memory on the heap, which allows for flexible memory management and resizing.

To modify the size of a data structure, either by expanding or shrinking the allocated memory to accommodate more or fewer elements.

A string that contains information about some record or entity, often used for storage and retrieval.

A technique for breaking down a string into individual parts based on a specific delimiter character.

A function that takes a record object as input and splits it into separate fields based on a given delimiter character.

A technique for growing the size of a data structure by adding one element at a time, often used when the exact size of the final structure is not known in advance.