C++ vector implementation memory leak, C++ (clang)

C++ vector implementation memory leak

Language: Layout:

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

class Vector {

private:
size_t sz;
size_t max_sz;
double* values;
static constexpr size_t min_sz {5};

public:

//default constructor
	Vector()
	{
		values = new double[min_sz];
		sz = 0;
		max_sz = 5;
	}

//constructor with submitted variable

Vector(size_t n)
	{
		if (n < min_sz)
		{
			n = min_sz;
		}
		values = new double[n];
		sz = 0; 
		max_sz = n;

}
	
	//copy constructor
	Vector (const Vector &v)
	{

max_sz=v.max_sz;
        sz=v.sz;
        values = new double[max_sz];
		
        for(size_t i=0;i<v.sz;i++)
        {
            values[i]=v.values[i];

}
		
	}

Vector (std::initializer_list<double> list)
	{

if(list.size() == 3)
		{
			std::initializer_list<double>::iterator it = list.begin();
			sz = *it++;
			max_sz = *it++;
			if (max_sz < min_sz)
			{
				max_sz = 5;
			}
			values = new double[max_sz];
			values[0] = *it;

}

//destructor
	~Vector()
	{
		delete[] values;
	}

//functions

size_t size() const
	{
		return sz;
	}
	
	bool empty() const
	{
		if (sz < 1) { return true; }

return false;
	}

void clear()
	{
		//set number of elements to 0, reserved memory isn't touched but can be overwritten by new assignments now
        
	sz = 0;

}

void reserve(size_t n)
	{
		if (n > max_sz)
		{
			double* tmp = new double[n];

for (size_t i = 0; i < n; i++)
			{
				tmp[i] = values[i];
			}  
            
        delete [] values;
		values = tmp;
            
		}

}

void shrink_to_fit()
	{
        if (sz != max_sz)
        {
            double* tmp = new double[sz];
		
            for (size_t i = 0; i < sz; i++)
            {
                tmp[i] = values[i];
            }

delete [] values;
            values = tmp;
        }
	}

void push_back(double x)
	{
		//check for space, if not enough space is allocated, allocate more
        
        if (sz+1 >= max_sz)
        {
            max_sz = max_sz *2;
            double* tmp = new double[max_sz];
            
            for (size_t i = 0; i < sz; i++)
            {
                tmp[i] = values[i];
            }
        
		delete [] values;
		values = tmp;
            
        }
        
        //then or otherwise, add the new element
        
		values[sz] = x;
        sz++;

}
	
	void pop_back()
	{
		//remove last element in vector, throw exception if vector is empty
        if (sz == 0)
            throw 10;
        
		sz--;		
	}

double& operator[](size_t index)
	{
		return values[index];
	}

const double& operator[](size_t index) const
	{
		return values[index];
	}

size_t capacity() const
	{
		return max_sz;
	}

friend ostream& operator<< (ostream& out, const Vector& v)
	{
		out << "[";
		for (size_t i = 0; i < v.sz; i++)
		{
			out << v.values[i];
            if (i+1 < v.sz)
            {
                out << ",";
            }
			
		}
        
        out << "]";
        
        return out; 
	}

};

int main(){

Vector y;
  cout << y << endl;
  {
    Vector x(0);
    for(double i{0};i<1;i+=0.1)
      x.push_back(i);
    cout << x << endl;
    x.pop_back();
    cout << x << endl;
    x.shrink_to_fit();
    cout << x << endl;
    x.push_back(10);
    const Vector tmp{x};
    const Vector tmp2{tmp};
    y = tmp2;
  }
  cout << y << endl;
  cerr << y << endl;
  Vector x{1,2,3};
  for(size_t i{4};i<10000;++i)
    x.push_back(i);
  cout << "Done" << endl;

return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.83 sec, absolute running time: 0.06 sec, cpu time: 0.02 sec, memory peak: 3 Mb, absolute service time: 0,9 sec

fork mode | history

Error(s):

[0,0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9,1]
*** Error in `/var/www/service/usercode/303380761/a.out': double free or corruption (!prev): 0x00000000025b50e0 ***
======= Backtrace: =========
/lib/x86_64-linux-gnu/libc.so.6(+0x777e5)[0x7f305f02d7e5]
/lib/x86_64-linux-gnu/libc.so.6(+0x7fe0a)[0x7f305f035e0a]
/lib/x86_64-linux-gnu/libc.so.6(cfree+0x4c)[0x7f305f03998c]
/var/www/service/usercode/303380761/a.out[0x401ea3]
/lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf0)[0x7f305efd6830]
/var/www/service/usercode/303380761/a.out[0x400f19]
======= Memory map: ========
00400000-00403000 r-xp 00000000 b6:342c1 2919345                         /var/www/service/usercode/303380761/a.out
00602000-00603000 r--p 00002000 b6:342c1 2919345                         /var/www/service/usercode/303380761/a.out
00603000-00604000 rw-p 00003000 b6:342c1 2919345                         /var/www/service/usercode/303380761/a.out
025b4000-025d6000 rw-p 00000000 00:00 0                                  [heap]
7f3058000000-7f3058021000 rw-p 00000000 00:00 0 
7f3058021000-7f305c000000 ---p 00000000 00:00 0 
7f305eb91000-7f305eb98000 r-xp 00000000 b6:342c1 10844                   /lib/x86_64-linux-gnu/librt-2.23.so
7f305eb98000-7f305ed97000 ---p 00007000 b6:342c1 10844                   /lib/x86_64-linux-gnu/librt-2.23.so
7f305ed97000-7f305ed98000 r--p 00006000 b6:342c1 10844                   /lib/x86_64-linux-gnu/librt-2.23.so
7f305ed98000-7f305ed99000 rw-p 00007000 b6:342c1 10844                   /lib/x86_64-linux-gnu/librt-2.23.so
7f305ed99000-7f305edb1000 r-xp 00000000 b6:342c1 10855                   /lib/x86_64-linux-gnu/libpthread-2.23.so
7f305edb1000-7f305efb0000 ---p 00018000 b6:342c1 10855                   /lib/x86_64-linux-gnu/libpthread-2.23.so
7f305efb0000-7f305efb1000 r--p 00017000 b6:342c1 10855                   /lib/x86_64-linux-gnu/libpthread-2.23.so
7f305efb1000-7f305efb2000 rw-p 00018000 b6:342c1 10855                   /lib/x86_64-linux-gnu/libpthread-2.23.so
7f305efb2000-7f305efb6000 rw-p 00000000 00:00 0 
7f305efb6000-7f305f175000 r-xp 00000000 b6:342c1 10849                   /lib/x86_64-linux-gnu/libc-2.23.so
7f305f175000-7f305f375000 ---p 001bf000 b6:342c1 10849                   /lib/x86_64-linux-gnu/libc-2.23.so
7f305f375000-7f305f379000 r--p 001bf000 b6:342c1 10849                   /lib/x86_64-linux-gnu/libc-2.23.so
7f305f379000-7f305f37b000 rw-p 001c3000 b6:342c1 10849                   /lib/x86_64-linux-gnu/libc-2.23.so
7f305f37b000-7f305f37f000 rw-p 00000000 00:00 0 
7f305f37f000-7f305f395000 r-xp 00000000 b6:342c1 105                     /lib/x86_64-linux-gnu/libgcc_s.so.1
7f305f395000-7f305f594000 ---p 00016000 b6:342c1 105                     /lib/x86_64-linux-gnu/libgcc_s.so.1
7f305f594000-7f305f595000 rw-p 00015000 b6:342c1 105                     /lib/x86_64-linux-gnu/libgcc_s.so.1
7f305f595000-7f305f69d000 r-xp 00000000 b6:342c1 10854                   /lib/x86_64-linux-gnu/libm-2.23.so
7f305f69d000-7f305f89c000 ---p 00108000 b6:342c1 10854                   /lib/x86_64-linux-gnu/libm-2.23.so
7f305f89c000-7f305f89d000 r--p 00107000 b6:342c1 10854                   /lib/x86_64-linux-gnu/libm-2.23.so
7f305f89d000-7f305f89e000 rw-p 00108000 b6:342c1 10854                   /lib/x86_64-linux-gnu/libm-2.23.so
7f305f89e000-7f305f982000 r-xp 00000000 b6:342c1 36350                   /usr/lib/x86_64-linux-gnu/libc++.so.1.0
7f305f982000-7f305fb82000 ---p 000e4000 b6:342c1 36350                   /usr/lib/x86_64-linux-gnu/libc++.so.1.0
7f305fb82000-7f305fb89000 rw-p 000e4000 b6:342c1 36350                   /usr/lib/x86_64-linux-gnu/libc++.so.1.0
7f305fb89000-7f305fb8c000 rw-p 00000000 00:00 0 
7f305fb8c000-7f305fbb2000 r-xp 00000000 b6:342c1 10838                   /lib/x86_64-linux-gnu/ld-2.23.so
7f305fd7e000-7f305fd83000 rw-p 00000000 00:00 0 
7f305fdae000-7f305fdb1000 rw-p 00000000 00:00 0 
7f305fdb1000-7f305fdb2000 r--p 00025000 b6:342c1 10838                   /lib/x86_64-linux-gnu/ld-2.23.so
7f305fdb2000-7f305fdb3000 rw-p 00026000 b6:342c1 10838                   /lib/x86_64-linux-gnu/ld-2.23.so
7f305fdb3000-7f305fdb4000 rw-p 00000000 00:00 0 
7ffc0dc9b000-7ffc0dcb0000 rw-p 00000000 00:00 0                          [stack]
7ffc0dcb7000-7ffc0dcb9000 r-xp 00000000 00:00 0                          [vdso]
ffffffffff600000-ffffffffff601000 r-xp 00000000 00:00 0                  [vsyscall]

Abort signal from abort(3) (SIGABRT)

[]
[0,0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9,1]
[0,0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9]
[0,0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9]
[0,0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9,1]
Done

λ

                                      .NET NoSQL database for rapid development