Asg 2: List of Pointers to Points

Objectives

Assignment

1. Using the C++ code from Assignment 01, rewrite the code so that the point_t objects are stored on a std::vector<point_t* > list (vector) of pointers.

Details

1. Your point_t object should provide the following:
   • Overloaded constructors:
     • point_t(double x=0.0, double y=0.0, double z=0.0);
     • point_t(std::vector<double> c);
   • The big three:
     1. copy constructors
        • point_t(const point_t& rhs);
        • point_t(point_t* rhs); NEW
     2. destructor (~point_t();), default ok (can comment this out)
     3. assignment operator (point_t operator=(const point_t& rhs);)
   • Input/output stream friend functions:
     • friend istream& operator>>(istream& s, point_t& rhs);
     • friend ostream& operator<<(ostream& s, const point_t& rhs);
   • The [ ] subscript operator.
   • Two distance member functions (double distance(point_t& rhs); and double distance(point_t* rhs);) that computes and returns the Euclidean distance between this point and the rhs point: sqrt((x₁-x₂)² + (y₁-y₂)²)
   • The point_t class should store the x- and y-coordinates in a private std::vector<double> container.

Requirements

1. Your code should be such that the main() routine from Assignment 01 should largely be unchanged, except for the following:
   • instead of declaring the temporary variable point_t point; to read in each point, you should now declare a pointer to the point_t class (its name should have a p at the end following the convention that variables with a p at the end signify they are pointers)
   • you must make sure that your overloaded i/o operators operator<<, operator>> can both accept pointers to point_t as arguments
   • you should then be adding the pointers to the vector and not the objects like before
   • to print out each point's coordinates you will need to de-reference the pointer object before using its subscript operator
   • calling the distance function should now be done with the -> pointer instead of the .
2. Make sure to create a new point_t* each time data is read in (this gets added to the list)
3. Make sure that you properly delete the list of points by deleteing each point pointer as you erase each one from the list

Requirements

1. This assignment is very similar to Assignment 00.5

Input

1. The pointdata.txt file used to test the above program is:

   15 14 13
   600 320 140
   104 29 23
   19 78 83
   450 321 33
   	

Output

1. Expected output with the above input file is:

   *** printing list
   15.00, 14.00, 13.00
   600.00, 320.00, 140.00
   104.00, 29.00, 23.00
   19.00, 78.00, 83.00
   450.00, 321.00, 33.00
   *** printing list again
   15.00, 14.00, 13.00
   600.00, 320.00, 140.00
   104.00, 29.00, 23.00
   19.00, 78.00, 83.00
   450.00, 321.00, 33.00
   *** printing point coords
   p_i[0] = 15.00 p_i[1] = 14.00 p_i[2] = 13.00
   p_i[0] = 600.00 p_i[1] = 320.00 p_i[2] = 140.00
   p_i[0] = 104.00 p_i[1] = 29.00 p_i[2] = 23.00
   p_i[0] = 19.00 p_i[1] = 78.00 p_i[2] = 83.00
   p_i[0] = 450.00 p_i[1] = 321.00 p_i[2] = 33.00
   *** checking distance function
   |p_0 - p_1| = 672.30
   *** deleting list
   *** deleting list again
   *** done
   	

Supplemental

1. Here is a Makefile that you can use to compile the project:

   .SUFFIXES: .c .o .cpp .cc .cxx .C
   
   UNAME = $(shell uname)
   PLATFORM = $(shell uname -p)
   
   CC = g++
   COPTS = -g -Wall
   
   INCDIR =
   LIBDIR =
   
   ifeq ("$(shell uname)", "Linux")
   LIBS = -lm
   else
   ifeq ("$(shell uname)", "Darwin")
   LIBS = -framework Foundation -lstdc++
   endif
   endif
   
   .c.o:
   	$(CC) -c $(INCDIR) $(COPTS) -o $@ $<
   
   .cpp.o:
   	$(CC) -c $(INCDIR) $(COPTS) -o $@ $<
   
   all : main
   
   OBJECTS = \
   point.o
   
   main : $(OBJECTS) main.o
   	$(CC) -o $@ $(INCDIR) $(COPTS) $(OBJECTS) $@.o $(LIBDIR) $(LIBS)
   
   point.o: point.h point.cpp
   
   clean :
   	rm -f *.o
   	rm -rf main main.app
   	

Turn in

1. A README file containing
   1. Course id--section no
   2. Name
   3. Brief solution description (e.g., program design, description of algorithm, etc., however appropriate).
   4. Lessons learned, identified interesting features of your program
   5. Any special usage instructions
2. Makefile
3. source code (.h headers and .cpp source)
4. object code (do a make clean before tar)

How to hand in

Grading scheme