data structure lab 1

CSC240_LargeInteger/src/LargeInt.h

#ifndef LARGEINT_H #define LARGEINT_H // This file contains the coded functions from the text. // The implementations are incomplete. #include "SpecializedList.h" // Gain access to SpecializedList #include <fstream> #include <string> #include <iostream> using namespace std; enum SignType {PLUS, MINUS}; enum RelationType {LESS, GREATER, EQUAL}; class LargeInt { public: LargeInt(); LargeInt(string); bool operator<(LargeInt second); bool operator==(LargeInt second); LargeInt operator+(LargeInt second); LargeInt operator-(LargeInt second); LargeInt operator*(LargeInt second); void InsertDigit(int); friend ostream& operator<<(ostream&, LargeInt&); private: SpecializedList number; SignType sign; int numDigits; }; LargeInt::LargeInt(){ sign = PLUS; numDigits = 0; } LargeInt::LargeInt(string num){ //number = new SpecializedList(); sign = PLUS; int firstDigitPosition; // Position of first digit in intString int lastDigitPosition; // Position of last digit in intString // Used to translate character to byte char digitChar; int digitInt; unsigned char digitByte; firstDigitPosition = 0; if (num[0] == '+'){ // Skip leading plus sign firstDigitPosition = 1; sign = PLUS; } else if (num[0] == '-') // Handle leading minus sign { firstDigitPosition = 1; sign = MINUS; } lastDigitPosition = num.size() - 1; for (int count = firstDigitPosition; count <= lastDigitPosition; count++) { digitChar = num[count]; digitInt = digitChar - '0'; digitByte = (unsigned char)digitInt; InsertDigit(digitByte); } } void Add(SpecializedList first, SpecializedList second, SpecializedList& result) // Post: result = first + second. { int carry = 0; bool finished1 = false; bool finished2 = false; int temp; int digit1; int digit2; first.ResetBackward(); second.ResetBackward(); while (!finished1 && !finished2) { first.GetPriorItem(digit1, finished1); second.GetPriorItem(digit2, finished2); temp = digit1 + digit2 + carry; carry = temp / 10; result.PutFront(temp % 10); } while ( !finished1) {// Adds remaining digits (if any) in first to the sum. first.GetPriorItem(digit1, finished1); temp = digit1 + carry; carry = temp / 10; result.PutFront(temp % 10); } while ( !finished2) {// Adds remaining digits (if any) in second to the sum. second.GetPriorItem(digit2, finished2); temp = digit2 + carry; carry = temp / 10; result.PutFront(temp % 10); } if (carry != 0) // Adds in carry (if any) result.PutFront(carry); } void Sub(SpecializedList first, SpecializedList second, SpecializedList& result) // Post: result = first - second. { } //IT 5/6/2019 LargeInt LargeInt::operator*(LargeInt second){ SignType selfSign; SignType secondSign; LargeInt result; return result; } LargeInt LargeInt::operator+(LargeInt second) // self is first operand { SignType selfSign; SignType secondSign; LargeInt result; if (sign == second.sign) { Add(number, second.number, result.number); result.sign = sign; } else { selfSign = sign; secondSign = second.sign; sign = PLUS; second.sign = PLUS; if (*this < second) { Sub(second.number, number, result.number); //NOT WORKING!!! result.sign = secondSign; } else if (second < *this) { Sub(number, second.number, result.number); //NOT WORKING!!! result.sign = selfSign; } sign = selfSign; } return result; } RelationType CompareDigits(SpecializedList first, SpecializedList second) { bool finished = false; int digit1; int digit2; first.ResetForward(); second.ResetForward(); while ( !finished) { first.GetNextItem(digit1, finished); second.GetNextItem(digit2, finished); if (digit1 < digit2) return LESS; if (digit1 > digit2) return GREATER; } return EQUAL; } bool LargeInt::operator<(LargeInt second) { RelationType relation; if (sign == MINUS && second.sign == PLUS) return true; else if (sign == PLUS && second.sign == MINUS) return false; else if (sign == PLUS && numDigits < second.numDigits) return true; else if (sign == PLUS && numDigits > second.numDigits) return false; else if (sign == MINUS && numDigits > second.numDigits) return true; else if (sign == MINUS && numDigits < second.numDigits) return false; else{ // Must compare digit by digit relation = CompareDigits(number, second.number); if (sign == PLUS && relation == LESS){ return true; } else if (sign == PLUS && relation == GREATER){ return false; } else if (sign == MINUS && relation == GREATER){ return true; } else{ return false; } } } void LargeInt::InsertDigit(int digit){ number.PutEnd(digit); } ostream& operator<<(ostream& out, LargeInt& largeInt){ int digit; bool flag = true; string largeIntString; if (largeInt.sign == PLUS) largeIntString = "+"; else largeIntString = "-"; int length; char d; length = largeInt.number.GetLength(); largeInt.number.ResetForward(); for (int count = length; count >= 1; count--) { largeInt.number.GetNextItem(digit, flag); d = '0' + digit; largeIntString += d; if ((((count - 1) % 3) == 0) && (count != 1)) largeIntString = largeIntString + ","; } out << largeIntString; return out; } #endif