1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
// FILE: bag6.h (part of the namespace main_savitch_10)
// TEMPLATE CLASS PROVIDED: bag<Item>
// (a container template class for a collection of items)
//
// TYPEDEFS for the bag<Item> class:
// bag<Item>::value_type
// bag<Item>::value_type is the data type of the items in the bag. It may
// be any of the C++ built-in types (int, char, etc.), or a class with a
// default constructor, a copy constructor, an assignment operator, and a
// less-than operator forming a strict weak ordering.
//
// bag<Item>::size_type
// bag<Item>::size_type is the data type of any variable that keeps track
// of how many items are in a bag.
//
// CONSTRUCTOR for the bag<Item> class:
// bag( )
// Postcondition: The bag is empty.
//
// MODIFICATION MEMBER FUNCTIONS for the bag<Item> class:
// size_type erase(const Item& target)
// Postcondition: All copies of target have been removed from the bag. The
// return value is the number of copies removed (which could be zero).
//
// bool erase_one(const Item& target)
// Postcondition: If target was in the bag, then one copy of target has been
// removed from the bag; otherwise the bag is unchanged. A true return value
// indicates that one copy was removed; false indicates that nothing was
// removed.
//
// void insert(const Item& entry)
// Postcondition: A new copy of entry has been inserted into the bag.
//
// void operator +=(const bag& addend)
// Postcondition: Each item in addend has been added to this bag.
//
// CONSTANT MEMBER FUNCTIONS for the bag<Item> class:
// size_type size( ) const
// Postcondition: Return value is the total number of items in the bag.
//
// size_type count(const Item& target) const
// Postcondition: Return value is number of times target is in the bag.
//
// NONMEMBER FUNCTIONS for the bag class:
// bag operator +(const bag& b1, const bag& b2)
// Postcondition: The bag returned is the union of b1 and b2.
//
// VALUE SEMANTICS for the bag class:
// Assignments and the copy constructor may be used with bag objects.
//
// DYNAMIC MEMORY USAGE by the bag:
// If there is insufficient dynamic memory, then the following functions
// throw bad_alloc: The constructors, insert, operator +=, operator +, and
// the assignment operator.
#ifndef BAG6_H
#define BAG6_H
#include <cstdlib> // Provides NULL and size_t
#include "bintree.h" // Provides binary_tree_node and related functions
namespace main_savitch_10
{
template <class Item>
class bag
{
public:
// TYPEDEFS
typedef std::size_t size_type;
typedef Item value_type;
// CONSTRUCTORS and DESTRUCTOR
bag( );
bag(const bag& source);
~bag( );
// MODIFICATION functions
size_type erase(const Item& target);
bool erase_one(const Item& target);
void insert(const Item& entry);
void operator +=(const bag& addend);
void operator =(const bag& source);
// CONSTANT functions
size_type size( ) const;
size_type count(const Item& target) const;
private:
binary_tree_node<Item> *root_ptr; // Root pointer of binary search tree
void insert_all(binary_tree_node<Item>* addroot_ptr);
};
// NONMEMBER functions for the bag<Item> template class
template <class Item>
bag<Item> operator +(const bag<Item>& b1, const bag<Item>& b2);
}
#include "bag6.template" // Include the implementation.
#endif
|