CpSc 212 - SummerI’09 - Goddard
Assignment 2
Due 8pm Sunday 7 June
Efficient Range-Set Storage. You are to produce a class RangeSet that main-
tains a set of integers, including methods to update and display the set in terms of ranges.
For example, given the two ranges 17..21 and 22..25, the program will automatically merge
them to give 17..25. Input ranges may be given in any order. If there is only one number
in a range, only one number should be displayed. Example: given 3, 5, 1, 17..19, 4 the
output would be 1, 3..5, 17..19. The class must be able to handle an arbitrary number of
input ranges and there is no constraint on the ranges the user can enter.
Your class must store the range set as a linked list of the struct RNode.
struct RNode {
int start, end;
RNode* next;
}
Each RNode represents a range of integers. The linked list MUST be stored in increasing
order and in minimal form; that is, no two nodes’ ranges overlap. So, no matter what
sequence of operations gives rise to it, the set {1,3,4,5,17,18,19}must be stored as 3
nodes representing ranges 1..1,3..5 and 17..19 in that order.
Instructions
Produce a class which maintains a set of integers with methods to update and display
the set in terms of ranges. It should have the following methods:
void addRange(int rangeStart,int rangeEnd);
// adds all integers from RANGESTART to RANGEEND inclusive to the set
RangeSet union(const RangeSet &alpha, const RangeSet &beta);
// creates a new RangeSet that is the union of two supplied RangeSets
bool isInSet(int element) const;
// returns whether the value ELEMENT is in the set or not
void deleteRange(int rangeStart, int rangeEnd);
// deletes all integers from RANGESTART to RANGEEND inclusive
void deleteAllElements() const;
// makes the set empty
void dump(bool inIncreasingOrder) const
// prints out the set in a series of ranges with order specified
as well as a default constructor, a destructor, and an equality tester (==).
