Due Date: See Blackboard

Transcription

1 Source File: ~/2315/45/lab45.(C CPP cpp c++ cc cxx cp) Input: under control of main function Output: under control of main function Value: 4 Integer data is usually represented in a single word on a computer. The number of bits in a word determines the range of integers representable. For example, a 16-bit word allows integers in the range from through Doubling the word size to 32 bits increases the range from through In this latter case, results that are representable within ten digits are possible. It is desirable to be able to represent integral results that are larger (in absolute value) than this. In this assignment you are to develop a class for representing large integers. The large integer will be implemented as a list of chars. Each node in the list will contain a digit of the large integer. The large integer is to be stored such that the least significant digit is contained in the first node, the next-to-least significant digit in the second node, and so on. No leading zeroes should be stored with the large integer. The number zero (0) should be stored as a single digit of zero (0). For this assignment, you are to create several constructors and overloaded operators that can be used for comparing large integers. A header file is shown in Figure 1, a sample main function for testing your implementation is shown in Figure 2, and a sample execution sequence is shown in Figure 3. To use the Makefile as distributed in class, add a target of lab45 to targets2srcfiles. For the constructor that takes a string parameter, if the fsaforint function returns false, the number should be stored as zero. 1 #ifndef LAB45_H 2 #define LAB45_H 3 4 #include <iostream> 5 #include <string> 6 #include <list> 7 8 using namespace std; 9 10 typedef enum {NEGATIVE, ZERO, POSITIVE} Sign; int fsaforint(string s); class BigInt 15 { 16 friend ostream& operator<<( ostream& output, const BigInt& ); 17 friend istream& operator>>( istream& input, BigInt& ); 18 public: 19 BigInt(); // constructor; digits = 0 20 BigInt( int num ); // constructor; digits = num 21 BigInt( const string str ); // constructor; digits = str 22 BigInt( const BigInt& other ); // copy constructor bool operator==( const BigInt& rhs ) const; // Equality 25 bool operator< ( const BigInt& rhs ) const; // Less Than 26 Figure 1. /usr/local/2315/include/lab45.h (Part 1 of 2) CS 2315 Data Structures and Algorithms Page 1

2 27 private: 28 Sign sign; // Sign of # 29 list<char> digits; // List of digits of # 30 }; #endif Figure 1. /usr/local/2315/include/lab45.h (Part 2 of 2) 1 #include <lab45.h> 2 #include <cstdlib> 3 #include <iomanip> 4 5 using namespace std; 6 7 void comparezeroes(const BigInt& a, const BigInt& b, const BigInt& c, 8 const BigInt& d, const BigInt& e, const BigInt& f, 9 string v1, string v2, string v3, 10 string v4, string v5, string v6); int main() 13 { 14 BigInt a, b(-507), c("abc"), d("275"), 15 e(" "); 16 BigInt f(e), g(" 0 "), h(" -0 "); 17 BigInt i(" +0 "), j(+0), k(-0); cout << boolalpha; 20 cout << "a = " << a << endl; 21 cout << "g = " << g << endl; 22 cout << "h = " << h << endl; 23 cout << "i = " << i << endl; 24 cout << "j = " << j << endl; 25 cout << "k = " << k << endl; comparezeroes(a, g, h, i, j, k, "a", "g", "h", "i", "j", "k"); 28 comparezeroes(g, h, i, j, k, a, "g", "h", "i", "j", "k", "a"); 29 comparezeroes(h, i, j, k, a, g, "h", "i", "j", "k", "a", "g"); 30 comparezeroes(i, j, k, a, g, h, "i", "j", "k", "a", "g", "h"); 31 comparezeroes(j, k, a, g, h, i, "j", "k", "a", "g", "h", "i"); 32 comparezeroes(k, a, g, h, i, j, "k", "a", "g", "h", "i", "j"); 33 Figure 2. /usr/local/2315/src/lab45main.c (Part 1 of 3) Page 2 CS 2315 Data Structures and Algorithms

3 34 cout << "a = " << a << endl << "b = " << b << endl; 35 cout << "c = " << c << endl << "d = " << d << endl; 36 cout << "e = " << e << endl << "f = " << f << endl; 37 c = a = b; 38 cout << "a = " << a << endl << "b = " << b << endl; 39 cout << "c = " << c << endl; 40 cout << "a == b = " << (a == b) << endl; 41 cout << "c == b = " << (c == b) << endl; while (cin >> a >> b) 44 { 45 cout << "a = " << a << " b = " << b << endl; 46 cout << a << " == " << b << " = " << (a == b) << endl; 47 cout << a << " < " << b << " = " << (a < b) << endl; 48 } return EXIT_SUCCESS; 51 } void comparezeroes(const BigInt& a, const BigInt& b, const BigInt& c, 54 const BigInt& d, const BigInt& e, const BigInt& f, 55 string v1, string v2, string v3, 56 string v4, string v5, string v6) 57 { 58 cout << v1 << " == " << v1 << " = " << (a == a) << endl; 59 cout << v1 << " == " << v2 << " = " << (a == b) << endl; 60 cout << v1 << " == " << v3 << " = " << (a == c) << endl; 61 cout << v1 << " == " << v4 << " = " << (a == d) << endl; 62 cout << v1 << " == " << v5 << " = " << (a == e) << endl; 63 cout << v1 << " == " << v6 << " = " << (a == f) << endl; 64 } int fsaforint(string s) 67 { 68 int state = 0; 69 string::iterator itr; for (itr = s.begin(); itr < s.end(); ++itr) 72 switch (state) 73 { 74 case 0: if (isspace(*itr)) 75 state = 0; 76 else if (*itr == + *itr == - ) 77 state = 1; 78 else if (isdigit(*itr)) 79 state = 2; 80 else 81 state = 4; 82 break; Figure 2. /usr/local/2315/src/lab45main.c (Part 2 of 3) CS 2315 Data Structures and Algorithms Page 3

4 83 case 1: if (isdigit(*itr)) 84 state = 2; 85 else 86 state = 4; 87 break; 88 case 2: if (isdigit(*itr)) 89 state = 2; 90 else if (isspace(*itr)) 91 state = 3; 92 else 93 state = 4; 94 break; 95 case 3: if (isspace(*itr)) 96 state = 3; 97 else 98 state = 4; 99 break; 100 case 4: ; 101 } return state == 2 state == 3; 104 } istream& operator>>(istream& input, BigInt& num) 107 { 108 string s; input >> s; 111 num = BigInt(s); return input; 114 } ostream& operator<<(ostream& output, const BigInt& num) 117 { 118 list<char>::const_reverse_iterator itr; if (num.sign == NEGATIVE) 121 output << - ; for (itr = num.digits.crbegin(); itr!= num.digits.crend(); ++itr) 124 output << *itr; return output; 127 } Figure 2. /usr/local/2315/src/lab45main.c (Part 3 of 3) Page 4 CS 2315 Data Structures and Algorithms

5 1 ~> cd newuser@csunix ~/2315>./getlab.ksh 45 3 * Checking to see if a folder exists for Lab 45...No 4 * Creating a folder for Lab 45 5 * Checking to see if Lab 45 has sample input and output files...yes 6 * Copying input and output files for Lab 45 7 from folder /usr/local/2315/data/45 to folder./45 8 * Checking to see if /usr/local/2315/src/lab45main.c exists...yes 9 * Copying file /usr/local/2315/src/lab45main.c to folder./45 10 * Checking to see if /usr/local/2315/include/lab45.h exists...yes 11 * Copying file /usr/local/2315/include/lab45.h to folder./45 12 * Copying file /usr/local/2315/src/makefile to folder./45 13 * Adding a target of lab45 to targets2srcfiles 14 * Touching file./45/lab45.cpp 15 * Edit file./45/lab45.cpp in Notepad++ 16 newuser@csunix ~/2315> cd newuser@csunix ~/2315/45> ls dat 01.out Makefile lab45.cpp lab45.h lab45main.c 19 newuser@csunix ~/2315/45> make lab45 20 g++ -g -Wall -std=c++11 -c lab45main.c -I/usr/local/2315/include -I. 21 g++ -g -Wall -std=c++11 -c lab45.cpp -I/usr/local/2315/include -I. 22 g++ -o lab45 lab45main.o lab45.o -L/usr/local/2315/lib -lm -lbits 23 newuser@csunix ~/2315/45> cat 01.dat newuser@csunix ~/2315/45> cat 01.dat./lab45 53 a = 0 54 g = 0 55 h = 0 56 i = 0 57 j = 0 58 k = 0 59 a == a = true 60 a == g = true 61 a == h = true 62 a == i = true 63 a == j = true 64 a == k = true 65 g == g = true 66 g == h = true 67 g == i = true 68 g == j = true 69 g == k = true 70 g == a = true 71 h == h = true 72 h == i = true 73 h == j = true 74 h == k = true 75 h == a = true 76 h == g = true 77 i == i = true Figure 3. Commands to Compile, Link, & Run Lab 45 (Part 1 of 3) CS 2315 Data Structures and Algorithms Page 5

6 Page 6 CS 2315 Data Structures and Algorithms 78 i == j = true 79 i == k = true 80 i == a = true 81 i == g = true 82 i == h = true 83 j == j = true 84 j == k = true 85 j == a = true 86 j == g = true 87 j == h = true 88 j == i = true 89 k == k = true 90 k == a = true 91 k == g = true 92 k == h = true 93 k == i = true 94 k == j = true 95 a = 0 96 b = c = 0 98 d = e = f = a = b = c = a == b = true 105 c == b = true 106 a = b = == 0 = false < 0 = true 109 a = -1 b = == 1 = false < 1 = true 112 a = 0 b = == = false < = false 115 a = 0 b = == = false < = true 118 a = b = == = false < = false 121 a = b = == 0 = false < 0 = false 124 a = 0 b = == 0 = true < 0 = false 127 a = b = == = false < = true 130 a = b = == = false < = true 133 a = b = == = false < = false 136 a = b = == = false < = true 139 a = b = == = false < = false 142 a = b = == = true < = false 145 a = b = == = false < = false 148 a = b = == = false < = true 151 a = b = == = false < = true 154 a = b = == = false < = false 157 a = b = 1234 Figure 3. Commands to Compile, Link, & Run Lab 45 (Part 2 of 3) Lab 45

7 == 1234 = false < 1234 = false 160 a = 1234 b = == = false < = true 163 a = 0 b = == 0 = true < 0 = false 166 a = 0 b = == 0 = true < 0 = false 169 a = 0 b = == 0 = true < 0 = false 172 a = 0 b = == 0 = true < 0 = false 175 a = 0 b = == 0 = true < 0 = false 178 a = 0 b = == 0 = true < 0 = false 181 a = 0 b = == 0 = true < 0 = false 184 a = 0 b = == 0 = true < 0 = false 187 a = 0 b = == 0 = true < 0 = false 190 newuser@csunix ~/2315/45> cat 01.dat./lab45 > my.out 191 newuser@csunix ~/2315/45> diff 01.out my.out 192 newuser@csunix ~/2315/45> Figure 3. Commands to Compile, Link, & Run Lab 45 (Part 3 of 3) CS 2315 Data Structures and Algorithms Page 7