Consider the following class: #ifndef BIDCOLLECTION_H #define BIDCOLLECTION_H #include "bids.h" class BidCollection { int MaxSize; int size; Bid* elements; // array of bids public: /** * Create a collection capable of holding the indicated number of bids */ BidCollection (int MaxBids = 1000); BidCollection (const BidCollection&); ~BidCollection (); BidCollection& operator= (const BidCollection&); // Access to attributes int getMaxSize() const {return MaxSize;} int getSize() const {return size;} // Access to individual elements const Bid& get(int index) const {return elements[index];} // Collection operations void addInTimeOrder (const Bid& value); // Adds this bid into a position such that // all bids are ordered by the time the bid was placed //Pre: getSize() < getMaxSize() void remove (int index); // Remove the bid at the indicated position //Pre: 0 <= index < getSize() /** * Read all bids from the indicated file */ void readBids (std::string fileName); bool operator== (const BidCollection&) const; }; If you were doing a *unit test for this ADT, what is the minimum number of test functions you should expect to provide?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

Consider the following class:

#ifndef

BIDCOLLECTION_H

#define

BIDCOLLECTION_H

#include "bids.h" class BidCollection {

int MaxSize;

int size;

Bid* elements; //

array of bids public:

/**

*

Create a collection capable of holding the indicated number of bids

*/

BidCollection (int MaxBids = 1000);

BidCollection (const BidCollection&);

~BidCollection ();

BidCollection& operator= (const BidCollection&);

// Access to attributes

int getMaxSize()

const {return MaxSize;}

int getSize()

const {return size;}

// Access to individual elements

const Bid& get(int index) const {return elements[index];}

// Collection operations

void addInTimeOrder (const Bid& value);

// Adds this bid into a position such that

// all bids are ordered by the time the bid was placed

//Pre: getSize() < getMaxSize() void remove (int index);

// Remove the bid at the indicated position

//Pre: 0 <= index < getSize()

/**

* Read all bids from the indicated file

*/

void readBids (std::string fileName);

bool operator==

(const BidCollection&) const; };

If you were doing a *unit test for this ADT, what is the minimum number of test functions you should expect to provide?

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
User Defined DataType
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education