//   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.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

//   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.

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 1 images

Blurred answer
Knowledge Booster
Data members
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY