queue-with-fixed-size, C++ (gcc)

Language: Layout:

// Implement Queue with Limited Size of Arrays
// https://www.cs.bu.edu/teaching/c/queue/array/types.html

// 2 Implement Queue with Limited Size of Array
// Implement a queue with a number of arrays, in which each array has fixed size.

#include <vector>
#include <iostream>
using namespace std;

class QueueFixed{
    vector<vector<int>> v;
    int N;
    int read;
    int write;
    int total;
public:
    QueueFixed(int n): N(n), read(0), write(0), total(0) {
        v = vector<vector<int>>(1,vector<int>(n,0));
    }

void push(int x) {
        //(*v.rbegin())[write++] = x;    // write 
        v[v.size()-1][write++] = x;

total++;                       // counter++        
        if(write == N) {
            v.push_back(vector<int>(4,0));  // checking
            write = 0;
        }
    }

int front(){
        if(total ==0) return -1;
        return v[0][read];
    }

void pop() {
        if(total == 0) return;
        read++;
        total--;
        if(read == N) {
            v.erase(v.begin());
            read = 0;
        }
    }

int size(){
        return total;
    }
};

int main() {
    QueueFixed q(3);
    for(int i =0; i<11; i++)
        q.push(i);

while(q.size()){
        cout << q.front() << endl;
        q.pop();
    }
    
    return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.53 sec, absolute running time: 0.07 sec, cpu time: 0.01 sec, memory peak: 3 Mb, absolute service time: 0,61 sec