Passing dynamically allocated array through constructor

[cher1201]

Below I have a custom constructor, that takes in an array, the array size, and name of the set as per my instructors specifications. However, when I run this program I am getting a segmentation core dump. The set being referred to here is a data member ( int *set) and psize is the physical size of the array. How can I fix this?

  Set::Set( int array[] , int size, char name ){

        set = array;

        psize = ( size > 0 ? size: DEFAULTSIZE);
        psize = size;

        if (!array){
                cout << "Cannot Allocate Memory, exiting program... " << endl;
                exit(1);
        }

        Set::name = name;
}
int main(){
        int arr1[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int arr2[3] = {2, 4, 11};

        Set A( arr1, 10, 'A');
        Set B( arr2, 3, 'B');
        cout << A << B; //I overloaded the ostream operator
}

[ne555]

> dynamically allocated array
I don't see that.


> How can I fix this?
first step is to identify the problem
http://www.cplusplus.com/forum/general/112111/

[JLBorges]

#include <iostream>
#include <algorithm>

struct Set {

    Set() = default ; // empty set
    Set( const int array[] , std::size_t size, char name ) ;
    ~Set() { delete[] set_buffer ; }

    // TODO: copy constructor, copy assignment, move constructor, move assignment
    // TODO: other set operations

    int* set_buffer = nullptr ; // dynamically allocated; holds the elements
                                // strongly consider using std::vector<> for this
    std::size_t psize = 0 ;
    char name = 'X' ;
};

Set::Set( const int array[] , std::size_t size, char name )
    : set_buffer( new int[size]{} ), // allocate memory to hold the elements
      psize(size), name(name) {

    if( array != nullptr ) {

        // copy the contents of array
        std::uninitialized_copy( array, array+size, set_buffer ) ;

        // since this is a set, we need to remove duplicate elements
        std::sort( set_buffer, set_buffer+size ) ;
        const auto iter = std::unique( set_buffer, set_buffer+size ) ;
        psize = iter - set_buffer ; // adjust the size to the size of unique elements
    }
}

std::ostream& operator<< ( std::ostream& stm, const Set& s ) {

    stm << "Set '" << s.name << "' : [ " ;
    for( std::size_t i = 0 ; i < s.psize ; ++i ) stm << s.set_buffer[i] << ' ' ;
    return stm << "] (size:" << s.psize << ')' ;
}

int main() {

    const int arr1[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    const std::size_t arr1_sz = sizeof(arr1) / sizeof( arr1[0] ) ;

    const int arr2[] = { 2, 4, 11, 4, 2, 4, 11, 2 };
    const std::size_t arr2_sz = sizeof(arr2) / sizeof( arr2[0] ) ;

    Set A( arr1, arr1_sz, 'A' );
    Set B( arr2, arr2_sz, 'B' );
    std::cout << A << '\n' << B << '\n' ; //I overloaded the ostream operator
}

http://coliru.stacked-crooked.com/a/b4dd99e97b290ac4