IntSet IntSet::unionWith(const IntSet& other IntSet) const |{ } assert((size() + thisisNew (otherIntSet)) <= MAX_SIZE); //Assert whether the size of the combined array is less than or equal to the MAX SIZE for (int i = 0; i < other IntSet.used; i++) { // Loop through each of the elements in the otherIntSet add (other IntSet.data[i]); // add each element to the data array using the add method. } IntSet IntSet::intersect(const IntSet& otherIntSet) const { for (int i = 0; i < used; i++) { //Loop through each of the elements in the data array. if (other IntSet.contains (data[i]) == 0) { //If the otherIntSet does not contain the data[i], remove (data[i]); //then remove the data[i] using the remove method. i--;
IntSet IntSet::unionWith(const IntSet& other IntSet) const |{ } assert((size() + thisisNew (otherIntSet)) <= MAX_SIZE); //Assert whether the size of the combined array is less than or equal to the MAX SIZE for (int i = 0; i < other IntSet.used; i++) { // Loop through each of the elements in the otherIntSet add (other IntSet.data[i]); // add each element to the data array using the add method. } IntSet IntSet::intersect(const IntSet& otherIntSet) const { for (int i = 0; i < used; i++) { //Loop through each of the elements in the data array. if (other IntSet.contains (data[i]) == 0) { //If the otherIntSet does not contain the data[i], remove (data[i]); //then remove the data[i] using the remove method. i--;
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...
Related questions
Question
![42 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
28 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
C:\Users\r1821655\OneDrive\Dropbox\Screenshots\...
120 21 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
C:\Users\r1821655\OneDrive\Dropbox\Screenshots\...
130 21 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
108
111
[Error] 'thisisNew' was not declared in this scope
[Error] passing 'const IntSet' as 'this' argument of 'bool IntSet::add(int)' discards qualifiers [-fpermissive]
In member function 'IntSet IntSet::intersect(const IntSet&) const':
[Error] passing 'const IntSet' as 'this' argument of 'bool IntSet::remove(int)' discards qualifiers [-fpermissive]
In member function 'IntSet IntSet::subtract(const IntSet&) const':
[Error] passing 'const IntSet' as 'this' argument of 'bool IntSet::remove(int)' discards qualifiers [-fpermissive]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff7dc95d2-023f-40ca-9530-c6f4e0f4a7a0%2F0f0ad1ca-d9db-4824-b13e-4a764e0e09a8%2Fgz1g5hw_processed.png&w=3840&q=75)
Transcribed Image Text:42 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
28 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
C:\Users\r1821655\OneDrive\Dropbox\Screenshots\...
120 21 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
C:\Users\r1821655\OneDrive\Dropbox\Screenshots\...
130 21 C:\Users\r1821655\OneDrive\Dropbox\Screenshots\One...
108
111
[Error] 'thisisNew' was not declared in this scope
[Error] passing 'const IntSet' as 'this' argument of 'bool IntSet::add(int)' discards qualifiers [-fpermissive]
In member function 'IntSet IntSet::intersect(const IntSet&) const':
[Error] passing 'const IntSet' as 'this' argument of 'bool IntSet::remove(int)' discards qualifiers [-fpermissive]
In member function 'IntSet IntSet::subtract(const IntSet&) const':
[Error] passing 'const IntSet' as 'this' argument of 'bool IntSet::remove(int)' discards qualifiers [-fpermissive]
![106
107 {
108
109
110
111
112
113
114 }
115
116 IntSet IntSet::intersect(const IntSet& otherIntSet) const
117 {
118
119
120
121
122
123
124
125
126
127
000
128
IntSet IntSet: :unionWith(const IntSet& otherIntSet) const
assert((size() + thisisNew (other IntSet)) <= MAX_SIZE); //Assert whether the size of the combined array is less than or equal to the MAX SIZE
for (int i = 0; i < otherIntSet.used; i++) { // Loop through each of the elements in the other IntSet
add (other IntSet.data[i]); // add each element to the data array using the add method.
}
129
130
131
132
133
134
135
IntSet IntSet::subtract (const IntSet& otherIntSet) const
{
}
for (int i = 0; i < used; i++) { //Loop through each of the elements in the data array.
if (other IntSet.contains (data[i]) == 0) { //If the otherIntSet does not contain the data[i],
remove (data[i]); //then remove the data[i] using the remove method.
i--;
}
for (int i = 0; i < used; i++) { //Loop through each of the elements in the data array
if (otherIntSet.contains (data[i]) == 1) { //If the otherIntSet contains the data[i]
remove (data[i]); //remove the data[i] using the remove method
i--;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff7dc95d2-023f-40ca-9530-c6f4e0f4a7a0%2F0f0ad1ca-d9db-4824-b13e-4a764e0e09a8%2Fp90spa_processed.png&w=3840&q=75)
Transcribed Image Text:106
107 {
108
109
110
111
112
113
114 }
115
116 IntSet IntSet::intersect(const IntSet& otherIntSet) const
117 {
118
119
120
121
122
123
124
125
126
127
000
128
IntSet IntSet: :unionWith(const IntSet& otherIntSet) const
assert((size() + thisisNew (other IntSet)) <= MAX_SIZE); //Assert whether the size of the combined array is less than or equal to the MAX SIZE
for (int i = 0; i < otherIntSet.used; i++) { // Loop through each of the elements in the other IntSet
add (other IntSet.data[i]); // add each element to the data array using the add method.
}
129
130
131
132
133
134
135
IntSet IntSet::subtract (const IntSet& otherIntSet) const
{
}
for (int i = 0; i < used; i++) { //Loop through each of the elements in the data array.
if (other IntSet.contains (data[i]) == 0) { //If the otherIntSet does not contain the data[i],
remove (data[i]); //then remove the data[i] using the remove method.
i--;
}
for (int i = 0; i < used; i++) { //Loop through each of the elements in the data array
if (otherIntSet.contains (data[i]) == 1) { //If the otherIntSet contains the data[i]
remove (data[i]); //remove the data[i] using the remove method
i--;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY