CONSTANT // static const int DEFAULT_CAPACITY = ____ // IntSet::DEFAULT_CAPACITY is the initial capacity of an // IntSet that is created by the default constructor (i.e., // IntSet::DEFAULT_CAPACITY is the highest # of distinct // values "an IntSet created by the default constructor" // can accommodate). // // CONSTRUCTOR // IntSet(int initial_capacity = DEFAULT_CAPACITY) // Post: The invoking IntSet is initialized to an empty // IntSet (i.e., one containing no relevant elements); // the initial capacity is given by initial_capacity if // initial_capacity is >= 1, otherwise it is given by // IntSet:DEFAULT_CAPACITY. // Note: When the IntSet is put to use after construction, // its capacity will be resized as necessary. // // CONSTANT MEMBER FUNCTIONS (ACCESSORS) // int size() const // Pre: (none) // Post: Number of elements in the invoking IntSet is returned. // bool isEmpty() const // Pre: (none) // Post: True is returned if the invoking IntSet has no relevant // elements, otherwise false is returned. // bool contains(int anInt) const // Pre: (none) // Post: true is returned if the invoking IntSet has anInt as an // element, otherwise false is returned. // bool isSubsetOf(const IntSet& otherIntSet) const // Pre: (none) // Post: True is returned if all elements of the invoking IntSet // are also elements of otherIntSet, otherwise false is // returned. // By definition, true is returned if the invoking IntSet // is empty (i.e., an empty IntSet is always isSubsetOf // another IntSet, even if the other IntSet is also empty). // void DumpData(std::ostream& out) const // Pre: (none) // Post: Contents of the invoking IntSet have been inserted into // out with 2 spaces separating one item from another if // if there are 2 or more items. // IntSet unionWith(const IntSet& otherIntSet) const // Pre: (none) // Post: An IntSet representing the union of the invoking IntSet // and otherIntSet is returned. // Note: Equivalently (see postcondition of add), the IntSet // returned is one that initially is an exact copy of the // invoking IntSet but subsequently has all elements of // otherIntSet added. // IntSet intersect(const IntSet& otherIntSet) const // Pre: (none) // Post: An IntSet representing the intersection of the invoking // IntSet and otherIntSet is returned. // Note: Equivalently (see postcondition of remove), the IntSet // returned is one that initially is an exact copy of the // invoking IntSet but subsequently has all of its elements // that are not also elements of otherIntSet removed. // IntSet subtract(const IntSet& otherIntSet) const // Pre: (none) // Post: An IntSet representing the difference between the invoking // IntSet and otherIntSet is returned. // Note: Equivalently (see postcondition of remove), the IntSet // returned is one that initially is an exact copy of the // invoking IntSet but subsequently has all elements of // otherIntSet removed. // // MODIFICATION MEMBER FUNCTIONS (MUTATORS) // void reset() // Pre: (none) // Post: The invoking IntSet is reset to become an empty IntSet. // (i.e., one containing no relevant elements). // bool add(int anInt) // Pre: (none) // Post: If contains(anInt) returns false, anInt has been // added to the invoking IntSet as a new element and // true is returned, otherwise the invoking IntSet is // unchanged and false is returned. // bool remove(int anInt) // Pre: (none) // Post: If contains(anInt) returns true, anInt has been // removed from the invoking IntSet and true is // returned, otherwise the invoking IntSet is unchanged // and false is returned. // // NON-MEMBER FUNCTIONS // bool operator==(const IntSet& is1, const IntSet& is2) // Pre: (none) // Post: True is returned if is1 and is2 have the same elements, // otherwise false is returned; for e.g.: {1,2,3}, {1,3,2}, // {2,1,3}, {2,3,1}, {3,1,2}, and {3,2,1} are all equal. // Note: By definition, two empty IntSet's are equal. // // VALUE SEMANTICS // Assignment and the copy constructor may be used with IntSet // objects. f
/ CONSTANT
// static const int DEFAULT_CAPACITY = ____
// IntSet::DEFAULT_CAPACITY is the initial capacity of an
// IntSet that is created by the default constructor (i.e.,
// IntSet::DEFAULT_CAPACITY is the highest # of distinct
// values "an IntSet created by the default constructor"
// can accommodate).
//
// CONSTRUCTOR
// IntSet(int initial_capacity = DEFAULT_CAPACITY)
// Post: The invoking IntSet is initialized to an empty
// IntSet (i.e., one containing no relevant elements);
// the initial capacity is given by initial_capacity if
// initial_capacity is >= 1, otherwise it is given by
// IntSet:DEFAULT_CAPACITY.
// Note: When the IntSet is put to use after construction,
// its capacity will be resized as necessary.
//
// CONSTANT MEMBER FUNCTIONS (ACCESSORS)
// int size() const
// Pre: (none)
// Post: Number of elements in the invoking IntSet is returned.
// bool isEmpty() const
// Pre: (none)
// Post: True is returned if the invoking IntSet has no relevant
// elements, otherwise false is returned.
// bool contains(int anInt) const
// Pre: (none)
// Post: true is returned if the invoking IntSet has anInt as an
// element, otherwise false is returned.
// bool isSubsetOf(const IntSet& otherIntSet) const
// Pre: (none)
// Post: True is returned if all elements of the invoking IntSet
// are also elements of otherIntSet, otherwise false is
// returned.
// By definition, true is returned if the invoking IntSet
// is empty (i.e., an empty IntSet is always isSubsetOf
// another IntSet, even if the other IntSet is also empty).
// void DumpData(std::ostream& out) const
// Pre: (none)
// Post: Contents of the invoking IntSet have been inserted into
// out with 2 spaces separating one item from another if
// if there are 2 or more items.
// IntSet unionWith(const IntSet& otherIntSet) const
// Pre: (none)
// Post: An IntSet representing the union of the invoking IntSet
// and otherIntSet is returned.
// Note: Equivalently (see postcondition of add), the IntSet
// returned is one that initially is an exact copy of the
// invoking IntSet but subsequently has all elements of
// otherIntSet added.
// IntSet intersect(const IntSet& otherIntSet) const
// Pre: (none)
// Post: An IntSet representing the intersection of the invoking
// IntSet and otherIntSet is returned.
// Note: Equivalently (see postcondition of remove), the IntSet
// returned is one that initially is an exact copy of the
// invoking IntSet but subsequently has all of its elements
// that are not also elements of otherIntSet removed.
// IntSet subtract(const IntSet& otherIntSet) const
// Pre: (none)
// Post: An IntSet representing the difference between the invoking
// IntSet and otherIntSet is returned.
// Note: Equivalently (see postcondition of remove), the IntSet
// returned is one that initially is an exact copy of the
// invoking IntSet but subsequently has all elements of
// otherIntSet removed.
//
// MODIFICATION MEMBER FUNCTIONS (MUTATORS)
// void reset()
// Pre: (none)
// Post: The invoking IntSet is reset to become an empty IntSet.
// (i.e., one containing no relevant elements).
// bool add(int anInt)
// Pre: (none)
// Post: If contains(anInt) returns false, anInt has been
// added to the invoking IntSet as a new element and
// true is returned, otherwise the invoking IntSet is
// unchanged and false is returned.
// bool remove(int anInt)
// Pre: (none)
// Post: If contains(anInt) returns true, anInt has been
// removed from the invoking IntSet and true is
// returned, otherwise the invoking IntSet is unchanged
// and false is returned.
//
// NON-MEMBER FUNCTIONS
// bool operator==(const IntSet& is1, const IntSet& is2)
// Pre: (none)
// Post: True is returned if is1 and is2 have the same elements,
// otherwise false is returned; for e.g.: {1,2,3}, {1,3,2},
// {2,1,3}, {2,3,1}, {3,1,2}, and {3,2,1} are all equal.
// Note: By definition, two empty IntSet's are equal.
//
// VALUE SEMANTICS
// Assignment and the copy constructor may be used with IntSet
// objects.
f
![79 void IntSet: :resize(int new_capacity)
80
{
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
118
119
120
121
122
123
124
125
126
}
127
128
129
130
131
132
133
134
135
136
137
138
IntSet :: IntSet (int initial_capacity)
{
cout << "IntSet(...) is not implemented yet...' << endl;
}
IntSet :: IntSet (const IntSet& src)
cout << "copy constructor is not implemented yet... << endl;
}
IntSet::~IntSet()
cout << "destructor is not implemented yet..." << endl;
{
105
106
107 {
108
}
109
110 }
111
112
113 {
114
115
116
117
cout << "resize() is not implemented yet..." << endl;
IntSet& IntSet::operator= (const IntSet& rhs)
{
cout << "operator-() is not implemented yet..." << endl;
return *this;
}
int IntSet: :size() const
cout << "size() is not implemented yet..." << endl;
return 0; // dummy value returned
bool IntSet::isEmpty() const
cout << "isEmpty() is not implemented yet.... << endl;
return false; // dummy value returned
}
bool IntSet: :contains (int anInt) const
{
}
cout << "contains() is not implemented yet..." << endl;
return false; // dummy value returned
}
bool IntSet::isSubset of (const IntSet& other IntSet) const
cout << "isSubsetof() is not implemented yet..." << endl;
return false; // dummy value returned
}
void IntSet::DumpData (ostream& out) const
{ // already implemented ... DON'T change anything
if (used > 0)
out <<data[0];
for (int i = 1; i < used; ++i)
out << "
<<data[i];](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa3dbb91f-777d-47b2-aa94-40b3e17142a5%2Ff827dd01-e4c0-4641-9be0-838771f61796%2Fnk9gwpk_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
