Final Capstone Move Semantics Project

Hard Move Semantics PRO

🔒 Login to Unlock

Problem Statement

Write a C++ program implementing a high-performance dynamic vector container adhering strictly to the Rule of Five, leveraging move constructors, move assignments, and noexcept guarantees for zero-cost resource transfers.

Input Format

Number of elements N, followed by N space-separated integers.

Output Format

Print elements from moved vector instance separated by a space.

Constraints

1 <= N <= 50

Sample Input

5
10 20 30 40 50

Sample Output

10 20 30 40 50

Explanation

Capstone project integrating rvalue references, move constructors, move assignment operators, and rule of five semantics for maximum runtime performance.

Starter Code

#include <iostream>

template <typename T>
class HighPerfVector {
private:
    T *arr;
    int capacity;
    int size;

public:
    HighPerfVector() : capacity(2), size(0) {
        arr = new T[capacity];
    }

    ~HighPerfVector() {
        delete[] arr;
    }

    // Implement move constructor and move assignment operator here

    void push_back(T val) {
        if (size == capacity) {
            capacity *= 2;
            T *newArr = new T[capacity];
            for (int i = 0; i < size; i++) newArr[i] = arr[i];
            delete[] arr;
            arr = newArr;
        }
        arr[size++] = val;
    }

    int getSize() const { return size; }
    T& operator[](int idx) { return arr[idx]; }
};

int main() {
    int n;
    if (std::cin >> n) {
        HighPerfVector<int> v1;
        for (int i = 0; i < n; i++) {
            int val;
            std::cin >> val;
            v1.push_back(val);
        }
        HighPerfVector<int> v2 = std::move(v1);
        for (int i = 0; i < v2.getSize(); i++) {
            std::cout << v2[i];
            if (i < v2.getSize() - 1) std::cout << " ";
        }
        std::cout << "n";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock