CIS 11: Data Structures and Algorithms

Project D

Complete Project 12e from Chapter 5 of the text. Directions are on page 277.

keyed_bag3();
keyed_bag3(const keyed_bag3& source);
~keyed_bag3();
keyed_bag3& operator =(const keyed_bag3& source);
void insert(const value_type& entry, int key);
bool erase(int key);
value_type get(int key) const;
size_type size() const;
size_type count(const value_type& target) const;
bool has_key(int key) const;

When you're satisfied with the definition and implementation, submit your work via the CATE form for Project D.

Legend: method/function keyword literal

2007/02/23